@itwin/core-geometry 4.2.0-dev.3 → 4.2.0-dev.31

package/lib/esm/curve/CurveProcessor.js.map

@@ -1 +1 @@
-{"version":3,"file":"CurveProcessor.js","sourceRoot":"","sources":["../../../src/curve/CurveProcessor.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAMlD,mEAAmE;AAEnE;;;;GAIG;AACH,MAAM,OAAgB,uBAAuB;IAC3C;IACA,CAAC;IAED,4BAA4B;IACrB,kBAAkB,CAAC,KAAe,EAAE,cAAsB,IAAI,CAAC;IACtE,gCAAgC;IACzB,sBAAsB,CAAC,KAAqB,EAAE,cAAc,GAAG,CAAC,CAAC,IAAU,CAAC;IAEnF,4CAA4C;IACrC,YAAY,CAAC,IAAU,EAAE,iBAAyB,CAAC,CAAC;QACzD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;IACD,4CAA4C;IACrC,YAAY,CAAC,IAAU,EAAE,iBAAyB,CAAC,CAAC;QACzD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,4DAA4D;IACrD,oBAAoB,CAAC,IAAkB,EAAE,iBAAyB,CAAC,CAAC;QACzE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ;YAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IACD,mDAAmD;IAC5C,mBAAmB,CAAC,IAAiB,EAAE,iBAAyB,CAAC,CAAC;QACvE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,KAAK,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;SAC3C;IACH,CAAC;IAED;;;;OAIG;IACI,mBAAmB,CAAC,IAAiB,EAAE,iBAAyB,CAAC,CAAC;QACvE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,IAAI,KAAK,YAAY,cAAc;gBACjC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;;gBAEnC,KAAK,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;SACxC;IACH,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAgB,gCAAiC,SAAQ,uBAAuB;IAGpF;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;IACnB,CAAC;IACD;;OAEG;IACI,KAAK,CAAC,IAAqB,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/D;;OAEG;IACI,KAAK,KAAkC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEzE,4BAA4B;IACZ,kBAAkB,CAAC,KAAe,EAAE,cAAsB,IAAI,CAAC;IAC/E,gCAAgC;IAChB,sBAAsB,CAAC,KAAqB,EAAE,cAAc,GAAG,CAAC,CAAC,IAAU,CAAC;IAE5F,4CAA4C;IAC5B,YAAY,CAAC,IAAU,EAAE,gBAAwB,CAAC,CAAC;QACjE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IACD,4CAA4C;IAC5B,YAAY,CAAC,IAAU,EAAE,gBAAwB,CAAC,CAAC;QACjE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,4DAA4D;IAC5C,oBAAoB,CAAC,IAAkB,EAAE,iBAAyB,CAAC,CAAC;QAClF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ;YAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IACD,mDAAmD;IACnC,mBAAmB,CAAC,IAAiB,EAAE,gBAAwB,CAAC,CAAC;QAC/E,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACa,mBAAmB,CAAC,IAAiB,EAAE,iBAAyB,CAAC,CAAC;QAChF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,IAAI,KAAK,YAAY,cAAc;gBACjC,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;;gBAExC,KAAK,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;SACxC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { AnyCurve } from \"./CurveChain\";\r\nimport { BagOfCurves, CurveCollection } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { Loop } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { Path } from \"./Path\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\n\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n\r\n/** base class for detailed traversal of curve artifacts.\r\n * * This recurses to children in the quickest way (no records of path)\r\n * * Use the RecursiveCurveProcessorWithStack to record the path along the visit.\r\n * @public\r\n */\r\nexport abstract class RecursiveCurveProcessor {\r\n  protected constructor() {\r\n  }\r\n\r\n  /** process error content */\r\n  public announceUnexpected(_data: AnyCurve, _indexInParent: number) { }\r\n  /** process a leaf primitive. */\r\n  public announceCurvePrimitive(_data: CurvePrimitive, _indexInParent = -1): void { }\r\n\r\n  /** announce a path (recurse to children) */\r\n  public announcePath(data: Path, _indexInParent: number = -1): void {\r\n    let i = 0;\r\n    for (const curve of data.children)\r\n      this.announceCurvePrimitive(curve, i++);\r\n  }\r\n  /** announce a loop (recurse to children) */\r\n  public announceLoop(data: Loop, _indexInParent: number = -1): void {\r\n    let i = 0;\r\n    for (const curve of data.children)\r\n      this.announceCurvePrimitive(curve, i++);\r\n  }\r\n\r\n  /** announce beginning or end of loops in a parity region */\r\n  public announceParityRegion(data: ParityRegion, _indexInParent: number = -1): void {\r\n    let i = 0;\r\n    for (const loop of data.children)\r\n      this.announceLoop(loop, i++);\r\n  }\r\n  /** announce beginning or end of a parity region */\r\n  public announceUnionRegion(data: UnionRegion, _indexInParent: number = -1): void {\r\n    let i = 0;\r\n    for (const child of data.children) {\r\n      child.announceToCurveProcessor(this, i++);\r\n    }\r\n  }\r\n\r\n  /** announce a bag of curves.\r\n   * * The default implementation visits each child and calls the appropriate dispatch to\r\n   * * `this.announceCurvePrimitive(child)`\r\n   * * `child.announceToCurveProcessor(this)`\r\n   */\r\n  public announceBagOfCurves(data: BagOfCurves, _indexInParent: number = -1): void {\r\n    for (const child of data.children) {\r\n      if (child instanceof CurvePrimitive)\r\n        this.announceCurvePrimitive(child);\r\n      else\r\n        child.announceToCurveProcessor(this);\r\n    }\r\n  }\r\n}\r\n\r\n/** base class for detailed traversal of curve artifacts\r\n * * During recursion,  maintains a stack that shows complete path to each artifact.\r\n * * Use the QuickRecursiveCurveProcessor to visit without recording the path.\r\n * @public\r\n */\r\nexport abstract class RecursiveCurveProcessorWithStack extends RecursiveCurveProcessor {\r\n  /** Stack of curve collections that are \"up the tree\" from the current point of the traversal. */\r\n  protected _stack: CurveCollection[];\r\n  protected constructor() {\r\n    super();\r\n    this._stack = [];\r\n  }\r\n  /** Push `data` onto the stack so its status is available during processing of children.\r\n   * * Called when `data` is coming into scope.\r\n   */\r\n  public enter(data: CurveCollection) { this._stack.push(data); }\r\n  /** Pop the stack\r\n   * * called when the top of the stack goes out of scope\r\n   */\r\n  public leave(): CurveCollection | undefined { return this._stack.pop(); }\r\n\r\n  /** process error content */\r\n  public override announceUnexpected(_data: AnyCurve, _indexInParent: number) { }\r\n  /** process a leaf primitive. */\r\n  public override announceCurvePrimitive(_data: CurvePrimitive, _indexInParent = -1): void { }\r\n\r\n  /** announce a path (recurse to children) */\r\n  public override announcePath(data: Path, indexInParent: number = -1): void {\r\n    this.enter(data);\r\n    super.announcePath(data, indexInParent);\r\n    this.leave();\r\n  }\r\n  /** announce a loop (recurse to children) */\r\n  public override announceLoop(data: Loop, indexInParent: number = -1): void {\r\n    this.enter(data);\r\n    super.announceLoop(data, indexInParent);\r\n    this.leave();\r\n  }\r\n\r\n  /** announce beginning or end of loops in a parity region */\r\n  public override announceParityRegion(data: ParityRegion, _indexInParent: number = -1): void {\r\n    this.enter(data);\r\n    let i = 0;\r\n    for (const loop of data.children)\r\n      this.announceLoop(loop, i++);\r\n    this.leave();\r\n  }\r\n  /** announce beginning or end of a parity region */\r\n  public override announceUnionRegion(data: UnionRegion, indexInParent: number = -1): void {\r\n    this.enter(data);\r\n    super.announceUnionRegion(data, indexInParent);\r\n    this.leave();\r\n  }\r\n  /**\r\n   * Announce members of an unstructured collection.\r\n   * * push the collection reference on the stack\r\n   * * announce children\r\n   * * pop the stack\r\n   * @param data the collection\r\n   * @param _indexInParent index where the collection appears in its parent.\r\n   */\r\n  public override announceBagOfCurves(data: BagOfCurves, _indexInParent: number = -1): void {\r\n    this.enter(data);\r\n    let i = 0;\r\n    for (const child of data.children) {\r\n      if (child instanceof CurvePrimitive)\r\n        this.announceCurvePrimitive(child, i++);\r\n      else\r\n        child.announceToCurveProcessor(this);\r\n    }\r\n    this.leave();\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CurveProcessor.js","sourceRoot":"","sources":["../../../src/curve/CurveProcessor.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAMlD,mEAAmE;AAEnE;;;;GAIG;AACH,MAAM,OAAgB,uBAAuB;IAC3C;IACA,CAAC;IAED,4BAA4B;IACrB,kBAAkB,CAAC,KAAe,EAAE,cAAsB,IAAI,CAAC;IACtE,gCAAgC;IACzB,sBAAsB,CAAC,KAAqB,EAAE,cAAc,GAAG,CAAC,CAAC,IAAU,CAAC;IAEnF,4CAA4C;IACrC,YAAY,CAAC,IAAU,EAAE,iBAAyB,CAAC,CAAC;QACzD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;IACD,4CAA4C;IACrC,YAAY,CAAC,IAAU,EAAE,iBAAyB,CAAC,CAAC;QACzD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,4DAA4D;IACrD,oBAAoB,CAAC,IAAkB,EAAE,iBAAyB,CAAC,CAAC;QACzE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ;YAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IACD,mDAAmD;IAC5C,mBAAmB,CAAC,IAAiB,EAAE,iBAAyB,CAAC,CAAC;QACvE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,KAAK,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;SAC3C;IACH,CAAC;IAED;;;;OAIG;IACI,mBAAmB,CAAC,IAAiB,EAAE,iBAAyB,CAAC,CAAC;QACvE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,IAAI,KAAK,YAAY,cAAc;gBACjC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;;gBAEnC,KAAK,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;SACxC;IACH,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAgB,gCAAiC,SAAQ,uBAAuB;IAGpF;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;IACnB,CAAC;IACD;;OAEG;IACI,KAAK,CAAC,IAAqB,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/D;;OAEG;IACI,KAAK,KAAkC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEzE,4BAA4B;IACZ,kBAAkB,CAAC,KAAe,EAAE,cAAsB,IAAI,CAAC;IAC/E,gCAAgC;IAChB,sBAAsB,CAAC,KAAqB,EAAE,cAAc,GAAG,CAAC,CAAC,IAAU,CAAC;IAE5F,4CAA4C;IAC5B,YAAY,CAAC,IAAU,EAAE,gBAAwB,CAAC,CAAC;QACjE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IACD,4CAA4C;IAC5B,YAAY,CAAC,IAAU,EAAE,gBAAwB,CAAC,CAAC;QACjE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,4DAA4D;IAC5C,oBAAoB,CAAC,IAAkB,EAAE,iBAAyB,CAAC,CAAC;QAClF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ;YAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IACD,mDAAmD;IACnC,mBAAmB,CAAC,IAAiB,EAAE,gBAAwB,CAAC,CAAC;QAC/E,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACa,mBAAmB,CAAC,IAAiB,EAAE,iBAAyB,CAAC,CAAC;QAChF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,IAAI,KAAK,YAAY,cAAc;gBACjC,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;;gBAExC,KAAK,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;SACxC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { AnyCurve } from \"./CurveTypes\";\r\nimport { BagOfCurves, CurveCollection } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { Loop } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { Path } from \"./Path\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\n\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n\r\n/** base class for detailed traversal of curve artifacts.\r\n * * This recurses to children in the quickest way (no records of path)\r\n * * Use the RecursiveCurveProcessorWithStack to record the path along the visit.\r\n * @public\r\n */\r\nexport abstract class RecursiveCurveProcessor {\r\n  protected constructor() {\r\n  }\r\n\r\n  /** process error content */\r\n  public announceUnexpected(_data: AnyCurve, _indexInParent: number) { }\r\n  /** process a leaf primitive. */\r\n  public announceCurvePrimitive(_data: CurvePrimitive, _indexInParent = -1): void { }\r\n\r\n  /** announce a path (recurse to children) */\r\n  public announcePath(data: Path, _indexInParent: number = -1): void {\r\n    let i = 0;\r\n    for (const curve of data.children)\r\n      this.announceCurvePrimitive(curve, i++);\r\n  }\r\n  /** announce a loop (recurse to children) */\r\n  public announceLoop(data: Loop, _indexInParent: number = -1): void {\r\n    let i = 0;\r\n    for (const curve of data.children)\r\n      this.announceCurvePrimitive(curve, i++);\r\n  }\r\n\r\n  /** announce beginning or end of loops in a parity region */\r\n  public announceParityRegion(data: ParityRegion, _indexInParent: number = -1): void {\r\n    let i = 0;\r\n    for (const loop of data.children)\r\n      this.announceLoop(loop, i++);\r\n  }\r\n  /** announce beginning or end of a parity region */\r\n  public announceUnionRegion(data: UnionRegion, _indexInParent: number = -1): void {\r\n    let i = 0;\r\n    for (const child of data.children) {\r\n      child.announceToCurveProcessor(this, i++);\r\n    }\r\n  }\r\n\r\n  /** announce a bag of curves.\r\n   * * The default implementation visits each child and calls the appropriate dispatch to\r\n   * * `this.announceCurvePrimitive(child)`\r\n   * * `child.announceToCurveProcessor(this)`\r\n   */\r\n  public announceBagOfCurves(data: BagOfCurves, _indexInParent: number = -1): void {\r\n    for (const child of data.children) {\r\n      if (child instanceof CurvePrimitive)\r\n        this.announceCurvePrimitive(child);\r\n      else\r\n        child.announceToCurveProcessor(this);\r\n    }\r\n  }\r\n}\r\n\r\n/** base class for detailed traversal of curve artifacts\r\n * * During recursion,  maintains a stack that shows complete path to each artifact.\r\n * * Use the QuickRecursiveCurveProcessor to visit without recording the path.\r\n * @public\r\n */\r\nexport abstract class RecursiveCurveProcessorWithStack extends RecursiveCurveProcessor {\r\n  /** Stack of curve collections that are \"up the tree\" from the current point of the traversal. */\r\n  protected _stack: CurveCollection[];\r\n  protected constructor() {\r\n    super();\r\n    this._stack = [];\r\n  }\r\n  /** Push `data` onto the stack so its status is available during processing of children.\r\n   * * Called when `data` is coming into scope.\r\n   */\r\n  public enter(data: CurveCollection) { this._stack.push(data); }\r\n  /** Pop the stack\r\n   * * called when the top of the stack goes out of scope\r\n   */\r\n  public leave(): CurveCollection | undefined { return this._stack.pop(); }\r\n\r\n  /** process error content */\r\n  public override announceUnexpected(_data: AnyCurve, _indexInParent: number) { }\r\n  /** process a leaf primitive. */\r\n  public override announceCurvePrimitive(_data: CurvePrimitive, _indexInParent = -1): void { }\r\n\r\n  /** announce a path (recurse to children) */\r\n  public override announcePath(data: Path, indexInParent: number = -1): void {\r\n    this.enter(data);\r\n    super.announcePath(data, indexInParent);\r\n    this.leave();\r\n  }\r\n  /** announce a loop (recurse to children) */\r\n  public override announceLoop(data: Loop, indexInParent: number = -1): void {\r\n    this.enter(data);\r\n    super.announceLoop(data, indexInParent);\r\n    this.leave();\r\n  }\r\n\r\n  /** announce beginning or end of loops in a parity region */\r\n  public override announceParityRegion(data: ParityRegion, _indexInParent: number = -1): void {\r\n    this.enter(data);\r\n    let i = 0;\r\n    for (const loop of data.children)\r\n      this.announceLoop(loop, i++);\r\n    this.leave();\r\n  }\r\n  /** announce beginning or end of a parity region */\r\n  public override announceUnionRegion(data: UnionRegion, indexInParent: number = -1): void {\r\n    this.enter(data);\r\n    super.announceUnionRegion(data, indexInParent);\r\n    this.leave();\r\n  }\r\n  /**\r\n   * Announce members of an unstructured collection.\r\n   * * push the collection reference on the stack\r\n   * * announce children\r\n   * * pop the stack\r\n   * @param data the collection\r\n   * @param _indexInParent index where the collection appears in its parent.\r\n   */\r\n  public override announceBagOfCurves(data: BagOfCurves, _indexInParent: number = -1): void {\r\n    this.enter(data);\r\n    let i = 0;\r\n    for (const child of data.children) {\r\n      if (child instanceof CurvePrimitive)\r\n        this.announceCurvePrimitive(child, i++);\r\n      else\r\n        child.announceToCurveProcessor(this);\r\n    }\r\n    this.leave();\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/CurveTypes.d.ts

@@ -0,0 +1,19 @@
+/** @packageDocumentation
+ * @module Curve
+ */
+import type { CurveCollection } from "./CurveCollection";
+import type { CurvePrimitive } from "./CurvePrimitive";
+import type { Loop } from "./Loop";
+import type { ParityRegion } from "./ParityRegion";
+import type { UnionRegion } from "./UnionRegion";
+/**
+ * Union type for `GeometryQuery` classes that have contain curves, either as individual parameter space or as collections
+ * @public
+ */
+export type AnyCurve = CurvePrimitive | CurveCollection;
+/**
+ * Union type for `GeometryQuery` classes that bound (planar) regions.
+ * @public
+ */
+export type AnyRegion = Loop | ParityRegion | UnionRegion;
+//# sourceMappingURL=CurveTypes.d.ts.map

package/lib/esm/curve/CurveTypes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CurveTypes.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveTypes.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AACnC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAEjD;;;GAGG;AACH,MAAM,MAAM,QAAQ,GAAG,cAAc,GAAG,eAAe,CAAC;AAExD;;;GAGG;AACH,MAAM,MAAM,SAAS,GAAG,IAAI,GAAG,YAAY,GAAG,WAAW,CAAC"}

package/lib/esm/curve/{CurveChain.js → CurveTypes.js}

@@ -3,4 +3,4 @@
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
 export {};
-//# sourceMappingURL=CurveChain.js.map
+//# sourceMappingURL=CurveTypes.js.map

package/lib/esm/curve/CurveTypes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CurveTypes.js","sourceRoot":"","sources":["../../../src/curve/CurveTypes.ts"],"names":[],"mappings":"AAAA;;;+FAG+F","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport type { CurveCollection } from \"./CurveCollection\";\r\nimport type { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport type { Loop } from \"./Loop\";\r\nimport type { ParityRegion } from \"./ParityRegion\";\r\nimport type { UnionRegion } from \"./UnionRegion\";\r\n\r\n/**\r\n * Union type for `GeometryQuery` classes that have contain curves, either as individual parameter space or as collections\r\n * @public\r\n */\r\nexport type AnyCurve = CurvePrimitive | CurveCollection;\r\n\r\n/**\r\n * Union type for `GeometryQuery` classes that bound (planar) regions.\r\n * @public\r\n */\r\nexport type AnyRegion = Loop | ParityRegion | UnionRegion;\r\n"]}

package/lib/esm/curve/CurveWireMomentsXYZ.d.ts

@@ -1,7 +1,7 @@
 import { IStrokeHandler } from "../geometry3d/GeometryHandler";
 import { Point3d, Vector3d } from "../geometry3d/Point3dVector3d";
 import { MomentData } from "../geometry4d/MomentData";
-import { AnyCurve } from "./CurveChain";
+import { AnyCurve } from "./CurveTypes";
 import { CurvePrimitive } from "./CurvePrimitive";
 /**
  * Class to visit curve primitives and accumulate wire moment integrations.

package/lib/esm/curve/CurveWireMomentsXYZ.js.map

@@ -1 +1 @@
-{"version":3,"file":"CurveWireMomentsXYZ.js","sourceRoot":"","sources":["../../../src/curve/CurveWireMomentsXYZ.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,6DAA6D;AAE7D,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAErD,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IAI9B,YAAmB,iBAAyB,CAAC;QAC3C,IAAI,CAAC,iBAAiB,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC,iBAAiB,CAAC,UAAU,GAAG,IAAI,CAAC;QACzC,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,CAAC,cAAc,CAAC,CAAC;IACtD,CAAC;IACD,IAAW,UAAU,KAAiB,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;IAE/D,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IAC1C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,qCAAqC,CAC1C,EAAkB,EAClB,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACjB,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,UAAU,GAAG,CAAC;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,GAAG,GAAG,UAAU,CAAC;QAC5B,IAAI,WAAW,EAAE,QAAQ,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YAC3E,MAAM,SAAS,GAAG,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YACtG,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;gBACjC,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACvC,MAAM,GAAG,GAAG,EAAE,CAAC,4BAA4B,CAAC,QAAQ,CAAE,CAAC;gBACvD,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;gBACtE,IAAI,CAAC,iBAAiB,CAAC,4BAA4B,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;aAC9E;SACF;IACH,CAAC;IAEM,uBAAuB,CAC5B,GAAmB,EACnB,MAAe,EACf,MAAe,EACf,WAAmB,EACnB,UAAkB,EAClB,UAAkB;QAClB,IAAI,CAAC,iBAAiB,CAAC,wBAAwB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClE,CAAC;IACM,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB;QAC9E,8GAA8G;IAChH,CAAC;IACD,uCAAuC;IAChC,WAAW,CAAC,IAAc;QAC/B,IAAI,IAAI,YAAY,cAAc;YAChC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;aAC3B,IAAI,IAAI,YAAY,eAAe,EAAE;YACxC,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;gBAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;oBACjC,IAAI,CAAC,WAAW,CAAC,KAAiB,CAAC,CAAC;iBACrC;SACJ;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\n// import { Geometry, Angle, AngleSweep } from \"../Geometry\";\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { MomentData } from \"../geometry4d/MomentData\";\r\nimport { GaussMapper } from \"../numerics/Quadrature\";\r\nimport { AnyCurve } from \"./CurveChain\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\n\r\n/**\r\n * Class to visit curve primitives and accumulate wire moment integrations.\r\n * @internal\r\n */\r\nexport class CurveWireMomentsXYZ implements IStrokeHandler {\r\n  private _activeMomentData: MomentData;\r\n  private _gaussMapper: GaussMapper;\r\n\r\n  public constructor(numGaussPoints: number = 5) {\r\n    this._activeMomentData = MomentData.create();\r\n    this._activeMomentData.needOrigin = true;\r\n    this._gaussMapper = new GaussMapper(numGaussPoints);\r\n  }\r\n  public get momentData(): MomentData { return this._activeMomentData; }\r\n\r\n  public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void {\r\n    this.startCurvePrimitive(cp);\r\n    if (numStrokes < 1) numStrokes = 1;\r\n    const df = 1.0 / numStrokes;\r\n    let scaleFactor, fraction;\r\n    for (let i = 1; i <= numStrokes; i++) {\r\n      const fractionA = Geometry.interpolate(fraction0, (i - 1) * df, fraction1);\r\n      const fractionB = i === numStrokes ? fraction1 : Geometry.interpolate(fraction0, (i) * df, fraction1);\r\n      const numGauss = this._gaussMapper.mapXAndW(fractionA, fractionB);\r\n      for (let k = 0; k < numGauss; k++) {\r\n        fraction = this._gaussMapper.gaussX[k];\r\n        const ray = cp.fractionToPointAndDerivative(fraction)!;\r\n        scaleFactor = this._gaussMapper.gaussW[k] * ray.direction.magnitude();\r\n        this._activeMomentData.accumulateScaledOuterProduct(ray.origin, scaleFactor);\r\n      }\r\n    }\r\n  }\r\n\r\n  public announceSegmentInterval(\r\n    _cp: CurvePrimitive,\r\n    point0: Point3d,\r\n    point1: Point3d,\r\n    _numStrokes: number,\r\n    _fraction0: number,\r\n    _fraction1: number): void {\r\n    this._activeMomentData.accumulateLineMomentsXYZ(point0, point1);\r\n  }\r\n  public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d): void {\r\n    // umm ... this should not happen.  We need to know intervals. The other functions should have prevented this.\r\n  }\r\n  /** Recurse to leaf-level primitives */\r\n  public visitLeaves(root: AnyCurve) {\r\n    if (root instanceof CurvePrimitive)\r\n      root.emitStrokableParts(this);\r\n    else if (root instanceof CurveCollection) {\r\n      if (root.children !== undefined)\r\n        for (const child of root.children) {\r\n          this.visitLeaves(child as AnyCurve);\r\n        }\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CurveWireMomentsXYZ.js","sourceRoot":"","sources":["../../../src/curve/CurveWireMomentsXYZ.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,6DAA6D;AAE7D,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAErD,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IAI9B,YAAmB,iBAAyB,CAAC;QAC3C,IAAI,CAAC,iBAAiB,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC,iBAAiB,CAAC,UAAU,GAAG,IAAI,CAAC;QACzC,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,CAAC,cAAc,CAAC,CAAC;IACtD,CAAC;IACD,IAAW,UAAU,KAAiB,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;IAE/D,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IAC1C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,qCAAqC,CAC1C,EAAkB,EAClB,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACjB,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,UAAU,GAAG,CAAC;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,GAAG,GAAG,UAAU,CAAC;QAC5B,IAAI,WAAW,EAAE,QAAQ,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YAC3E,MAAM,SAAS,GAAG,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YACtG,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;gBACjC,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACvC,MAAM,GAAG,GAAG,EAAE,CAAC,4BAA4B,CAAC,QAAQ,CAAE,CAAC;gBACvD,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;gBACtE,IAAI,CAAC,iBAAiB,CAAC,4BAA4B,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;aAC9E;SACF;IACH,CAAC;IAEM,uBAAuB,CAC5B,GAAmB,EACnB,MAAe,EACf,MAAe,EACf,WAAmB,EACnB,UAAkB,EAClB,UAAkB;QAClB,IAAI,CAAC,iBAAiB,CAAC,wBAAwB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClE,CAAC;IACM,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB;QAC9E,8GAA8G;IAChH,CAAC;IACD,uCAAuC;IAChC,WAAW,CAAC,IAAc;QAC/B,IAAI,IAAI,YAAY,cAAc;YAChC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;aAC3B,IAAI,IAAI,YAAY,eAAe,EAAE;YACxC,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;gBAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;oBACjC,IAAI,CAAC,WAAW,CAAC,KAAiB,CAAC,CAAC;iBACrC;SACJ;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\n// import { Geometry, Angle, AngleSweep } from \"../Geometry\";\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { MomentData } from \"../geometry4d/MomentData\";\r\nimport { GaussMapper } from \"../numerics/Quadrature\";\r\nimport { AnyCurve } from \"./CurveTypes\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\n\r\n/**\r\n * Class to visit curve primitives and accumulate wire moment integrations.\r\n * @internal\r\n */\r\nexport class CurveWireMomentsXYZ implements IStrokeHandler {\r\n  private _activeMomentData: MomentData;\r\n  private _gaussMapper: GaussMapper;\r\n\r\n  public constructor(numGaussPoints: number = 5) {\r\n    this._activeMomentData = MomentData.create();\r\n    this._activeMomentData.needOrigin = true;\r\n    this._gaussMapper = new GaussMapper(numGaussPoints);\r\n  }\r\n  public get momentData(): MomentData { return this._activeMomentData; }\r\n\r\n  public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void {\r\n    this.startCurvePrimitive(cp);\r\n    if (numStrokes < 1) numStrokes = 1;\r\n    const df = 1.0 / numStrokes;\r\n    let scaleFactor, fraction;\r\n    for (let i = 1; i <= numStrokes; i++) {\r\n      const fractionA = Geometry.interpolate(fraction0, (i - 1) * df, fraction1);\r\n      const fractionB = i === numStrokes ? fraction1 : Geometry.interpolate(fraction0, (i) * df, fraction1);\r\n      const numGauss = this._gaussMapper.mapXAndW(fractionA, fractionB);\r\n      for (let k = 0; k < numGauss; k++) {\r\n        fraction = this._gaussMapper.gaussX[k];\r\n        const ray = cp.fractionToPointAndDerivative(fraction)!;\r\n        scaleFactor = this._gaussMapper.gaussW[k] * ray.direction.magnitude();\r\n        this._activeMomentData.accumulateScaledOuterProduct(ray.origin, scaleFactor);\r\n      }\r\n    }\r\n  }\r\n\r\n  public announceSegmentInterval(\r\n    _cp: CurvePrimitive,\r\n    point0: Point3d,\r\n    point1: Point3d,\r\n    _numStrokes: number,\r\n    _fraction0: number,\r\n    _fraction1: number): void {\r\n    this._activeMomentData.accumulateLineMomentsXYZ(point0, point1);\r\n  }\r\n  public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d): void {\r\n    // umm ... this should not happen.  We need to know intervals. The other functions should have prevented this.\r\n  }\r\n  /** Recurse to leaf-level primitives */\r\n  public visitLeaves(root: AnyCurve) {\r\n    if (root instanceof CurvePrimitive)\r\n      root.emitStrokableParts(this);\r\n    else if (root instanceof CurveCollection) {\r\n      if (root.children !== undefined)\r\n        for (const child of root.children) {\r\n          this.visitLeaves(child as AnyCurve);\r\n        }\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/ParityRegion.d.ts

@@ -2,7 +2,7 @@
  * @module Curve
  */
 import { GeometryHandler } from "../geometry3d/GeometryHandler";
-import { AnyCurve } from "./CurveChain";
+import { AnyCurve } from "./CurveTypes";
 import { CurveCollection } from "./CurveCollection";
 import { RecursiveCurveProcessor } from "./CurveProcessor";
 import { GeometryQuery } from "./GeometryQuery";
@@ -34,7 +34,7 @@ export declare class ParityRegion extends CurveCollection {
      * * The loops are NOT reorganized by hole analysis.
      */
     static createLoops(data?: Loop | Loop[] | Loop[][]): Loop | ParityRegion;
-    /** Create a parity region with given loops */
+    /** Create a parity region by capturing the given loops as children. */
     static create(...data: Loop[]): ParityRegion;
     /** Return the boundary type (4) of a corresponding  MicroStation CurveVector */
     dgnBoundaryType(): number;
@@ -47,7 +47,7 @@ export declare class ParityRegion extends CurveCollection {
     /** Create a new empty parity region. */
     cloneEmptyPeer(): ParityRegion;
     /**
-     * Add `child` to this parity region.
+     * Add `child` to this parity region (by capturing it).
      * * Any child type other than `Loop` is ignored.
      */
     tryAddChild(child: AnyCurve | undefined): boolean;

package/lib/esm/curve/ParityRegion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ParityRegion.d.ts","sourceRoot":"","sources":["../../../src/curve/ParityRegion.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;;GAMG;AACH,qBAAa,YAAa,SAAQ,eAAe;IAC/C,wCAAwC;IACxC,SAAgB,mBAAmB,kBAAkB;IACrD,uDAAuD;IAChD,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD,4CAA4C;IAC5C,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC;IAC5B,uDAAuD;IACvD,IAAoB,QAAQ,IAAI,IAAI,EAAE,CAErC;IACD,oDAAoD;;IAKpD,wDAAwD;IACjD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,EAAE,GAAG,IAAI;IAatD;;;;OAIG;WACW,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,EAAE,GAAG,IAAI,GAAG,YAAY;IAO/E,8CAA8C;WAChC,MAAM,CAAC,GAAG,IAAI,EAAE,IAAI,EAAE,GAAG,YAAY;IAOnD,gFAAgF;IACzE,eAAe,IAAI,MAAM;IAGhC,mEAAmE;IAC5D,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,0BAA0B;IACV,KAAK,IAAI,YAAY;IAUrC,mDAAmD;IAC5C,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,YAAY;IAU1D,wCAAwC;IACjC,cAAc,IAAI,YAAY;IAGrC;;;OAGG;IACI,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAOxD,8BAA8B;IACvB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAK5C,yEAAyE;IAClE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}
+{"version":3,"file":"ParityRegion.d.ts","sourceRoot":"","sources":["../../../src/curve/ParityRegion.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;;GAMG;AACH,qBAAa,YAAa,SAAQ,eAAe;IAC/C,wCAAwC;IACxC,SAAgB,mBAAmB,kBAAkB;IACrD,uDAAuD;IAChD,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD,4CAA4C;IAC5C,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC;IAC5B,uDAAuD;IACvD,IAAoB,QAAQ,IAAI,IAAI,EAAE,CAErC;IACD,oDAAoD;;IAKpD,wDAAwD;IACjD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,EAAE,GAAG,IAAI;IAatD;;;;OAIG;WACW,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,EAAE,GAAG,IAAI,GAAG,YAAY;IAO/E,uEAAuE;WACzD,MAAM,CAAC,GAAG,IAAI,EAAE,IAAI,EAAE,GAAG,YAAY;IAOnD,gFAAgF;IACzE,eAAe,IAAI,MAAM;IAGhC,mEAAmE;IAC5D,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,0BAA0B;IACV,KAAK,IAAI,YAAY;IAUrC,mDAAmD;IAC5C,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,YAAY;IAU1D,wCAAwC;IACjC,cAAc,IAAI,YAAY;IAGrC;;;OAGG;IACI,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAOxD,8BAA8B;IACvB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAK5C,yEAAyE;IAClE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}

package/lib/esm/curve/ParityRegion.js

@@ -54,7 +54,7 @@ export class ParityRegion extends CurveCollection {
         result.addLoops(data);
         return result;
     }
-    /** Create a parity region with given loops */
+    /** Create a parity region by capturing the given loops as children. */
     static create(...data) {
         const result = new ParityRegion();
         for (const child of data) {
@@ -97,7 +97,7 @@ export class ParityRegion extends CurveCollection {
         return new ParityRegion();
     }
     /**
-     * Add `child` to this parity region.
+     * Add `child` to this parity region (by capturing it).
      * * Any child type other than `Loop` is ignored.
      */
     tryAddChild(child) {

package/lib/esm/curve/ParityRegion.js.map

@@ -1 +1 @@
-{"version":3,"file":"ParityRegion.js","sourceRoot":"","sources":["../../../src/curve/ParityRegion.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAQ/F,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAGpD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAG9B;;;;;;GAMG;AACH,MAAM,OAAO,YAAa,SAAQ,eAAe;IAG/C,uDAAuD;IAChD,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,YAAY,CAAC;IACvC,CAAC;IAGD,uDAAuD;IACvD,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,oDAAoD;IACpD;QACE,KAAK,EAAE,CAAC;QAdV,wCAAwC;QACxB,wBAAmB,GAAG,cAAc,CAAC;QAcnD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD,wDAAwD;IACjD,QAAQ,CAAC,IAA+B;QAC7C,IAAI,IAAI,KAAK,SAAS,EAAE;SACvB;aAAM,IAAI,IAAI,YAAY,IAAI;YAC7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACtB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC5B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;gBACxB,IAAI,KAAK,YAAY,IAAI;oBACvB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;qBACvB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBAC3B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;aACxB;SACF;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,WAAW,CAAC,IAA+B;QACvD,IAAI,IAAI,YAAY,IAAI;YACtB,OAAO,IAAI,CAAC;QACd,MAAM,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAClC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,8CAA8C;IACvC,MAAM,CAAC,MAAM,CAAC,GAAG,IAAY;QAClC,MAAM,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;YACxB,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gFAAgF;IACzE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,mEAAmE;IAC5D,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,oBAAoB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC7D,CAAC;IACD,0BAA0B;IACV,KAAK;QACnB,MAAM,KAAK,GAAG,IAAI,YAAY,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC3B,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,UAAU,YAAY,IAAI;gBAC5B,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SACnC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mDAAmD;IAC5C,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,YAAY,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC3B,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,YAAY;gBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACrC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wCAAwC;IACjC,cAAc;QACnB,OAAO,IAAI,YAAY,EAAE,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK,IAAI,KAAK,YAAY,IAAI,EAAE;YAClC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8BAA8B;IACvB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;YAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,yEAAyE;IAClE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { AnyCurve } from \"./CurveChain\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { Loop } from \"./Loop\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * A `ParityRegion` is a collection of `Loop` objects.\r\n * * The loops collectively define a planar region.\r\n * * A point is \"in\" the composite region if it is \"in\" an odd number of the loops.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport class ParityRegion extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"parityRegion\";\r\n  /** Test if `other` is an instance of `ParityRegion` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof ParityRegion;\r\n  }\r\n  /** Array of loops in this parity region. */\r\n  protected _children: Loop[];\r\n  /** Return the array of loops in this parity region. */\r\n  public override get children(): Loop[] {\r\n    return this._children;\r\n  }\r\n  /** Construct parity region with empty loop array */\r\n  public constructor() {\r\n    super();\r\n    this._children = [];\r\n  }\r\n  /** Add loops (recursively) to this region's children */\r\n  public addLoops(data?: Loop | Loop[] | Loop[][]): void {\r\n    if (data === undefined) {\r\n    } else if (data instanceof Loop)\r\n      this.children.push(data);\r\n    else if (Array.isArray(data)) {\r\n      for (const child of data) {\r\n        if (child instanceof Loop)\r\n          this.children.push(child);\r\n        else if (Array.isArray(child))\r\n          this.addLoops(child);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Return a single loop or parity region with given loops.\r\n   * * The returned structure CAPTURES the loops.\r\n   * * The loops are NOT reorganized by hole analysis.\r\n   */\r\n  public static createLoops(data?: Loop | Loop[] | Loop[][]): Loop | ParityRegion {\r\n    if (data instanceof Loop)\r\n      return data;\r\n    const result = new ParityRegion();\r\n    result.addLoops(data);\r\n    return result;\r\n  }\r\n  /** Create a parity region with given loops */\r\n  public static create(...data: Loop[]): ParityRegion {\r\n    const result = new ParityRegion();\r\n    for (const child of data) {\r\n      result.children.push(child);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return the boundary type (4) of a corresponding  MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 4;\r\n  }\r\n  /** Invoke `processor.announceParityRegion(this, indexInParent)` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceParityRegion(this, indexInParent);\r\n  }\r\n  /** Return a deep copy. */\r\n  public override clone(): ParityRegion {\r\n    const clone = new ParityRegion();\r\n    let child;\r\n    for (child of this.children) {\r\n      const childClone = child.clone();\r\n      if (childClone instanceof Loop)\r\n        clone.children.push(childClone);\r\n    }\r\n    return clone;\r\n  }\r\n  /** Stroke these curves into a new ParityRegion. */\r\n  public cloneStroked(options?: StrokeOptions): ParityRegion {\r\n    const clone = new ParityRegion();\r\n    let child;\r\n    for (child of this.children) {\r\n      const childStrokes = child.cloneStroked(options);\r\n      if (childStrokes)\r\n        clone.children.push(childStrokes);\r\n    }\r\n    return clone;\r\n  }\r\n  /** Create a new empty parity region. */\r\n  public cloneEmptyPeer(): ParityRegion {\r\n    return new ParityRegion();\r\n  }\r\n  /**\r\n   * Add `child` to this parity region.\r\n   * * Any child type other than `Loop` is ignored.\r\n   */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child && child instanceof Loop) {\r\n      this._children.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Get child `i` by index. */\r\n  public getChild(i: number): Loop | undefined {\r\n    if (i < this._children.length)\r\n      return this._children[i];\r\n    return undefined;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleRegion(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleParityRegion(this);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"ParityRegion.js","sourceRoot":"","sources":["../../../src/curve/ParityRegion.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAQ/F,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAGpD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAG9B;;;;;;GAMG;AACH,MAAM,OAAO,YAAa,SAAQ,eAAe;IAG/C,uDAAuD;IAChD,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,YAAY,CAAC;IACvC,CAAC;IAGD,uDAAuD;IACvD,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,oDAAoD;IACpD;QACE,KAAK,EAAE,CAAC;QAdV,wCAAwC;QACxB,wBAAmB,GAAG,cAAc,CAAC;QAcnD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD,wDAAwD;IACjD,QAAQ,CAAC,IAA+B;QAC7C,IAAI,IAAI,KAAK,SAAS,EAAE;SACvB;aAAM,IAAI,IAAI,YAAY,IAAI;YAC7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACtB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC5B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;gBACxB,IAAI,KAAK,YAAY,IAAI;oBACvB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;qBACvB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBAC3B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;aACxB;SACF;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,WAAW,CAAC,IAA+B;QACvD,IAAI,IAAI,YAAY,IAAI;YACtB,OAAO,IAAI,CAAC;QACd,MAAM,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAClC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,uEAAuE;IAChE,MAAM,CAAC,MAAM,CAAC,GAAG,IAAY;QAClC,MAAM,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;YACxB,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gFAAgF;IACzE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,mEAAmE;IAC5D,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,oBAAoB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC7D,CAAC;IACD,0BAA0B;IACV,KAAK;QACnB,MAAM,KAAK,GAAG,IAAI,YAAY,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC3B,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,UAAU,YAAY,IAAI;gBAC5B,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SACnC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mDAAmD;IAC5C,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,YAAY,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC3B,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,YAAY;gBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACrC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wCAAwC;IACjC,cAAc;QACnB,OAAO,IAAI,YAAY,EAAE,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK,IAAI,KAAK,YAAY,IAAI,EAAE;YAClC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8BAA8B;IACvB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;YAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,yEAAyE;IAClE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { AnyCurve } from \"./CurveTypes\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { Loop } from \"./Loop\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * A `ParityRegion` is a collection of `Loop` objects.\r\n * * The loops collectively define a planar region.\r\n * * A point is \"in\" the composite region if it is \"in\" an odd number of the loops.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport class ParityRegion extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"parityRegion\";\r\n  /** Test if `other` is an instance of `ParityRegion` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof ParityRegion;\r\n  }\r\n  /** Array of loops in this parity region. */\r\n  protected _children: Loop[];\r\n  /** Return the array of loops in this parity region. */\r\n  public override get children(): Loop[] {\r\n    return this._children;\r\n  }\r\n  /** Construct parity region with empty loop array */\r\n  public constructor() {\r\n    super();\r\n    this._children = [];\r\n  }\r\n  /** Add loops (recursively) to this region's children */\r\n  public addLoops(data?: Loop | Loop[] | Loop[][]): void {\r\n    if (data === undefined) {\r\n    } else if (data instanceof Loop)\r\n      this.children.push(data);\r\n    else if (Array.isArray(data)) {\r\n      for (const child of data) {\r\n        if (child instanceof Loop)\r\n          this.children.push(child);\r\n        else if (Array.isArray(child))\r\n          this.addLoops(child);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Return a single loop or parity region with given loops.\r\n   * * The returned structure CAPTURES the loops.\r\n   * * The loops are NOT reorganized by hole analysis.\r\n   */\r\n  public static createLoops(data?: Loop | Loop[] | Loop[][]): Loop | ParityRegion {\r\n    if (data instanceof Loop)\r\n      return data;\r\n    const result = new ParityRegion();\r\n    result.addLoops(data);\r\n    return result;\r\n  }\r\n  /** Create a parity region by capturing the given loops as children. */\r\n  public static create(...data: Loop[]): ParityRegion {\r\n    const result = new ParityRegion();\r\n    for (const child of data) {\r\n      result.children.push(child);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return the boundary type (4) of a corresponding  MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 4;\r\n  }\r\n  /** Invoke `processor.announceParityRegion(this, indexInParent)` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceParityRegion(this, indexInParent);\r\n  }\r\n  /** Return a deep copy. */\r\n  public override clone(): ParityRegion {\r\n    const clone = new ParityRegion();\r\n    let child;\r\n    for (child of this.children) {\r\n      const childClone = child.clone();\r\n      if (childClone instanceof Loop)\r\n        clone.children.push(childClone);\r\n    }\r\n    return clone;\r\n  }\r\n  /** Stroke these curves into a new ParityRegion. */\r\n  public cloneStroked(options?: StrokeOptions): ParityRegion {\r\n    const clone = new ParityRegion();\r\n    let child;\r\n    for (child of this.children) {\r\n      const childStrokes = child.cloneStroked(options);\r\n      if (childStrokes)\r\n        clone.children.push(childStrokes);\r\n    }\r\n    return clone;\r\n  }\r\n  /** Create a new empty parity region. */\r\n  public cloneEmptyPeer(): ParityRegion {\r\n    return new ParityRegion();\r\n  }\r\n  /**\r\n   * Add `child` to this parity region (by capturing it).\r\n   * * Any child type other than `Loop` is ignored.\r\n   */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child && child instanceof Loop) {\r\n      this._children.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Get child `i` by index. */\r\n  public getChild(i: number): Loop | undefined {\r\n    if (i < this._children.length)\r\n      return this._children[i];\r\n    return undefined;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleRegion(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleParityRegion(this);\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/Path.d.ts

@@ -36,7 +36,7 @@ export declare class Path extends CurveChain {
     static createArray(curves: CurvePrimitive[]): Path;
     /** Return a deep copy, with leaf-level curve primitives stroked. */
     cloneStroked(options?: StrokeOptions): Path;
-    /** Return the boundary type (1) of a corresponding  MicroStation CurveVector */
+    /** Return the boundary type (1) of a corresponding MicroStation CurveVector */
     dgnBoundaryType(): number;
     /** Clone as a new `Path` with no primitives */
     cloneEmptyPeer(): Path;

package/lib/esm/curve/Path.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Path.d.ts","sourceRoot":"","sources":["../../../src/curve/Path.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;GAKG;AACH,qBAAa,IAAK,SAAQ,UAAU;IAClC,wCAAwC;IACxC,SAAgB,mBAAmB,UAAU;IAC7C,+CAA+C;IACxC,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD,2DAA2D;IACpD,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,+BAA+B;;IAI/B;;;;OAIG;WACW,MAAM,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,cAAc,GAAG,OAAO,EAAE,CAAC,GAAG,IAAI;IAWxE;;;OAGG;WACW,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,GAAG,IAAI;IAOzD,oEAAoE;IAC7D,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAMlD,gFAAgF;IACzE,eAAe,IAAI,MAAM;IAGhC,+CAA+C;IACxC,cAAc,IAAI,IAAI;IAG7B,sEAAsE;IAC/D,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}
+{"version":3,"file":"Path.d.ts","sourceRoot":"","sources":["../../../src/curve/Path.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;GAKG;AACH,qBAAa,IAAK,SAAQ,UAAU;IAClC,wCAAwC;IACxC,SAAgB,mBAAmB,UAAU;IAC7C,+CAA+C;IACxC,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD,2DAA2D;IACpD,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,+BAA+B;;IAI/B;;;;OAIG;WACW,MAAM,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,cAAc,GAAG,OAAO,EAAE,CAAC,GAAG,IAAI;IAWxE;;;OAGG;WACW,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,GAAG,IAAI;IAOzD,oEAAoE;IAC7D,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAMlD,+EAA+E;IACxE,eAAe,IAAI,MAAM;IAGhC,+CAA+C;IACxC,cAAc,IAAI,IAAI;IAG7B,sEAAsE;IAC/D,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}

package/lib/esm/curve/Path.js

@@ -61,7 +61,7 @@ export class Path extends CurveChain {
             curve.emitStrokes(strokes, options);
         return Path.create(strokes);
     }
-    /** Return the boundary type (1) of a corresponding  MicroStation CurveVector */
+    /** Return the boundary type (1) of a corresponding MicroStation CurveVector */
     dgnBoundaryType() {
         return 1;
     }

package/lib/esm/curve/Path.js.map

@@ -1 +1 @@
-{"version":3,"file":"Path.js","sourceRoot":"","sources":["../../../src/curve/Path.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAO/F,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGlD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAG9C;;;;;GAKG;AACH,MAAM,OAAO,IAAK,SAAQ,UAAU;IAGlC,+CAA+C;IACxC,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,IAAI,CAAC;IAC/B,CAAC;IACD,2DAA2D;IACpD,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACrD,CAAC;IACD,+BAA+B;IAC/B;QACE,KAAK,EAAE,CAAC;QAZV,wCAAwC;QACxB,wBAAmB,GAAG,MAAM,CAAC;IAY7C,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,GAAG,MAAyC;QAC/D,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC1B,IAAI,KAAK,YAAY,cAAc;gBACjC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACzB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,YAAY,OAAO,EAAE;gBAChF,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;aAClD;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,WAAW,CAAC,MAAwB;QAChD,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC1B,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oEAAoE;IAC7D,YAAY,CAAC,OAAuB;QACzC,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACtC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IACD,gFAAgF;IACzE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,+CAA+C;IACxC,cAAc;QACnB,OAAO,IAAI,IAAI,EAAE,CAAC;IACpB,CAAC;IACD,sEAAsE;IAC/D,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * A `Path` object is a collection of curves that join head-to-tail to form a path.\r\n * * A `Path` object does not bound a planar region. Use `Loop` to indicate region bounding.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport class Path extends CurveChain {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"path\";\r\n  /** Test if `other` is an instance of `Path` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof Path;\r\n  }\r\n  /** Invoke `processor.announcePath(this, indexInParent)` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announcePath(this, indexInParent);\r\n  }\r\n  /** Construct an empty path. */\r\n  public constructor() {\r\n    super();\r\n  }\r\n  /**\r\n   * Create a path from a variable length list of curve primitives\r\n   * * CurvePrimitive params are captured.\r\n   * @param curves variable length list of individual curve primitives or point arrays.\r\n   */\r\n  public static create(...curves: Array<CurvePrimitive | Point3d[]>): Path {\r\n    const result = new Path();\r\n    for (const curve of curves) {\r\n      if (curve instanceof CurvePrimitive)\r\n        result.children.push(curve);\r\n      else if (Array.isArray(curve) && curve.length > 0 && curve[0] instanceof Point3d) {\r\n        result.children.push(LineString3d.create(curve));\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Create a path from a an array of curve primitives.\r\n   * @param curves array of individual curve primitives.\r\n   */\r\n  public static createArray(curves: CurvePrimitive[]): Path {\r\n    const result = new Path();\r\n    for (const curve of curves) {\r\n      result.children.push(curve);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return a deep copy, with leaf-level curve primitives stroked. */\r\n  public cloneStroked(options?: StrokeOptions): Path {\r\n    const strokes = LineString3d.create();\r\n    for (const curve of this.children)\r\n      curve.emitStrokes(strokes, options);\r\n    return Path.create(strokes);\r\n  }\r\n  /** Return the boundary type (1) of a corresponding  MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 1;\r\n  }\r\n  /** Clone as a new `Path` with no primitives */\r\n  public cloneEmptyPeer(): Path {\r\n    return new Path();\r\n  }\r\n  /** Second step of double dispatch: call `handler.handlePath(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handlePath(this);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"Path.js","sourceRoot":"","sources":["../../../src/curve/Path.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAO/F,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGlD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAG9C;;;;;GAKG;AACH,MAAM,OAAO,IAAK,SAAQ,UAAU;IAGlC,+CAA+C;IACxC,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,IAAI,CAAC;IAC/B,CAAC;IACD,2DAA2D;IACpD,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACrD,CAAC;IACD,+BAA+B;IAC/B;QACE,KAAK,EAAE,CAAC;QAZV,wCAAwC;QACxB,wBAAmB,GAAG,MAAM,CAAC;IAY7C,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,GAAG,MAAyC;QAC/D,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC1B,IAAI,KAAK,YAAY,cAAc;gBACjC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACzB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,YAAY,OAAO,EAAE;gBAChF,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;aAClD;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,WAAW,CAAC,MAAwB;QAChD,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC1B,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oEAAoE;IAC7D,YAAY,CAAC,OAAuB;QACzC,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACtC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IACD,+EAA+E;IACxE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,+CAA+C;IACxC,cAAc;QACnB,OAAO,IAAI,IAAI,EAAE,CAAC;IACpB,CAAC;IACD,sEAAsE;IAC/D,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * A `Path` object is a collection of curves that join head-to-tail to form a path.\r\n * * A `Path` object does not bound a planar region. Use `Loop` to indicate region bounding.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport class Path extends CurveChain {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"path\";\r\n  /** Test if `other` is an instance of `Path` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof Path;\r\n  }\r\n  /** Invoke `processor.announcePath(this, indexInParent)` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announcePath(this, indexInParent);\r\n  }\r\n  /** Construct an empty path. */\r\n  public constructor() {\r\n    super();\r\n  }\r\n  /**\r\n   * Create a path from a variable length list of curve primitives\r\n   * * CurvePrimitive params are captured.\r\n   * @param curves variable length list of individual curve primitives or point arrays.\r\n   */\r\n  public static create(...curves: Array<CurvePrimitive | Point3d[]>): Path {\r\n    const result = new Path();\r\n    for (const curve of curves) {\r\n      if (curve instanceof CurvePrimitive)\r\n        result.children.push(curve);\r\n      else if (Array.isArray(curve) && curve.length > 0 && curve[0] instanceof Point3d) {\r\n        result.children.push(LineString3d.create(curve));\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Create a path from a an array of curve primitives.\r\n   * @param curves array of individual curve primitives.\r\n   */\r\n  public static createArray(curves: CurvePrimitive[]): Path {\r\n    const result = new Path();\r\n    for (const curve of curves) {\r\n      result.children.push(curve);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return a deep copy, with leaf-level curve primitives stroked. */\r\n  public cloneStroked(options?: StrokeOptions): Path {\r\n    const strokes = LineString3d.create();\r\n    for (const curve of this.children)\r\n      curve.emitStrokes(strokes, options);\r\n    return Path.create(strokes);\r\n  }\r\n  /** Return the boundary type (1) of a corresponding MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 1;\r\n  }\r\n  /** Clone as a new `Path` with no primitives */\r\n  public cloneEmptyPeer(): Path {\r\n    return new Path();\r\n  }\r\n  /** Second step of double dispatch: call `handler.handlePath(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handlePath(this);\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.d.ts

@@ -2,10 +2,11 @@
  * @module Curve
  */
 import { NullGeometryHandler } from "../../geometry3d/GeometryHandler";
-import { ConsolidateAdjacentCurvePrimitivesOptions, CurveChain } from "../CurveCollection";
+import { CurveChain } from "../CurveCollection";
 import { Loop } from "../Loop";
-import { Path } from "../Path";
 import { ParityRegion } from "../ParityRegion";
+import { Path } from "../Path";
+import { ConsolidateAdjacentCurvePrimitivesOptions } from "../RegionOps";
 import { UnionRegion } from "../UnionRegion";
 /**
  * * Implementation class for ConsolidateAdjacentCurvePrimitives.

package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ConsolidateAdjacentPrimitivesContext.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/ConsolidateAdjacentPrimitivesContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AAKvE,OAAO,EAAE,yCAAyC,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAI3F,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE7C;;;;GAIG;AACH,qBAAa,yCAA0C,SAAQ,mBAAmB;IAChF,OAAO,CAAC,QAAQ,CAA4C;gBACzC,OAAO,CAAC,EAAE,yCAAyC;IAItE,iEAAiE;IAC1D,gBAAgB,CAAC,CAAC,EAAE,UAAU;IAmErB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,GAAG;IACxB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,GAAG;IACxB,kBAAkB,CAAC,CAAC,EAAE,YAAY,GAAG,GAAG;IAIxC,iBAAiB,CAAC,CAAC,EAAE,WAAW,GAAG,GAAG;CAIvD"}
+{"version":3,"file":"ConsolidateAdjacentPrimitivesContext.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/ConsolidateAdjacentPrimitivesContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AAKvE,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAIhD,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,yCAAyC,EAAE,MAAM,cAAc,CAAC;AACzE,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE7C;;;;GAIG;AACH,qBAAa,yCAA0C,SAAQ,mBAAmB;IAChF,OAAO,CAAC,QAAQ,CAA4C;gBACzC,OAAO,CAAC,EAAE,yCAAyC;IAItE,iEAAiE;IAC1D,gBAAgB,CAAC,CAAC,EAAE,UAAU;IAmErB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,GAAG;IACxB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,GAAG;IACxB,kBAAkB,CAAC,CAAC,EAAE,YAAY,GAAG,GAAG;IAIxC,iBAAiB,CAAC,CAAC,EAAE,WAAW,GAAG,GAAG;CAIvD"}

package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js

@@ -9,10 +9,10 @@ import { NullGeometryHandler } from "../../geometry3d/GeometryHandler";
 import { PolylineCompressionContext } from "../../geometry3d/PolylineCompressionByEdgeOffset";
 import { PolylineOps } from "../../geometry3d/PolylineOps";
 import { Arc3d } from "../Arc3d";
-import { ConsolidateAdjacentCurvePrimitivesOptions } from "../CurveCollection";
 import { CurveFactory } from "../CurveFactory";
 import { LineSegment3d } from "../LineSegment3d";
 import { LineString3d } from "../LineString3d";
+import { ConsolidateAdjacentCurvePrimitivesOptions } from "../RegionOps";
 /**
  * * Implementation class for ConsolidateAdjacentCurvePrimitives.
  *

package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js.map

@@ -1 +1 @@
-{"version":3,"file":"ConsolidateAdjacentPrimitivesContext.js","sourceRoot":"","sources":["../../../../src/curve/Query/ConsolidateAdjacentPrimitivesContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AAEvE,OAAO,EAAE,0BAA0B,EAAE,MAAM,kDAAkD,CAAC;AAC9F,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAC3D,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,yCAAyC,EAAc,MAAM,oBAAoB,CAAC;AAC3F,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAM/C;;;;GAIG;AACH,MAAM,OAAO,yCAA0C,SAAQ,mBAAmB;IAEhF,YAAmB,OAAmD;QACpE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,yCAAyC,EAAE,CAAC;IACtF,CAAC;IACD,iEAAiE;IAC1D,gBAAgB,CAAC,CAAa;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAC5B,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC;QACpC,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,2CAA2C;QAC3C,mFAAmF;QACnF,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,WAAW,GAAG;YAClC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,CAAC,aAAa,YAAY,aAAa,IAAI,aAAa,YAAY,YAAY,CAAC,EAAE;gBAChI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAClB,IAAI,EAAE,GAAG,EAAE,CAAC;gBACZ,6DAA6D;gBAC7D,OAAO,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;oBACnC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,aAAa,YAAY,aAAa,EAAE;wBAC1C,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC;wBACxC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC;qBACvC;yBAAM,IAAI,aAAa,YAAY,YAAY,EAAE;wBAChD,MAAM,MAAM,GAAG,aAAa,CAAC,YAAY,CAAC;wBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACtC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC,CAAC;yBACxD;qBACF;yBAAM;wBACL,MAAM;qBACP;iBACF;gBACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;oBACrB,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC;oBACvD,MAAM,iBAAiB,GAAG,WAAW,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;oBAC5E,MAAM,iBAAiB,GAAG,WAAW,CAAC,+BAA+B,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC;oBACpG,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,WAAW,EAAE;wBAClC,yGAAyG;wBACzG,0BAA0B,CAAC,2BAA2B,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC;qBACtF;oBACD,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;wBAChC,wDAAwD;wBACxD,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;qBACrE;yBAAM,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE;wBACzC,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;qBAC5F;yBAAM;wBACL,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,YAAY,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC;qBACxE;iBACF;qBAAM;oBACL,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC;iBACzC;gBACD,EAAE,GAAG,EAAE,CAAC;aACT;iBAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,aAAa,YAAY,KAAK,EAAE;gBACpF,8CAA8C;gBAC9C,gCAAgC;gBAChC,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG;oBAChC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,CAAC,CAAC,aAAa,YAAY,KAAK,CAAC;wBACnC,MAAM;oBACR,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,aAAa,EAAE,aAAa,CAAC;wBAChE,MAAM;iBACT;gBACD,0BAA0B;gBAC1B,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC,CAAI,2CAA2C;aACxF;iBAAM;gBACL,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC;gBACxC,EAAE,EAAE,CAAC;aACN;SACF;QACD,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,SAAS,CAAC;IAChC,CAAC;IAEe,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,kBAAkB,CAAC,CAAe;QAChD,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ;YAC5B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IACe,iBAAiB,CAAC,CAAc;QAC9C,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ;YAC5B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { NullGeometryHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { PolylineCompressionContext } from \"../../geometry3d/PolylineCompressionByEdgeOffset\";\r\nimport { PolylineOps } from \"../../geometry3d/PolylineOps\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { ConsolidateAdjacentCurvePrimitivesOptions, CurveChain } from \"../CurveCollection\";\r\nimport { CurveFactory } from \"../CurveFactory\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop } from \"../Loop\";\r\nimport { Path } from \"../Path\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { UnionRegion } from \"../UnionRegion\";\r\n\r\n/**\r\n * * Implementation class for ConsolidateAdjacentCurvePrimitives.\r\n *\r\n * @internal\r\n */\r\nexport class ConsolidateAdjacentCurvePrimitivesContext extends NullGeometryHandler {\r\n  private _options: ConsolidateAdjacentCurvePrimitivesOptions;\r\n  public constructor(options?: ConsolidateAdjacentCurvePrimitivesOptions) {\r\n    super();\r\n    this._options = options ? options : new ConsolidateAdjacentCurvePrimitivesOptions();\r\n  }\r\n  /** look for adjacent compatible primitives in a path or loop. */\r\n  public handleCurveChain(g: CurveChain) {\r\n    const children = g.children;\r\n    const numOriginal = children.length;\r\n    const points: Point3d[] = [];\r\n    let numAccept = 0;\r\n    // i0 <=i < i1 is a range of child indices.\r\n    // numAccept is the number of children accepted (contiguously at front of children)\r\n    for (let i0 = 0; i0 < numOriginal;) {\r\n      const basePrimitive = g.children[i0];\r\n      if (this._options.consolidateLinearGeometry && (basePrimitive instanceof LineSegment3d || basePrimitive instanceof LineString3d)) {\r\n        points.length = 0;\r\n        let i1 = i0;\r\n        // on exit, i1 is beyond the block of linear primitives  . ..\r\n        for (; i1 < g.children.length; i1++) {\r\n          const nextPrimitive = g.children[i1];\r\n          if (nextPrimitive instanceof LineSegment3d) {\r\n            points.push(nextPrimitive.startPoint());\r\n            points.push(nextPrimitive.endPoint());\r\n          } else if (nextPrimitive instanceof LineString3d) {\r\n            const source = nextPrimitive.packedPoints;\r\n            for (let k = 0; k < source.length; k++) {\r\n              points.push(source.getPoint3dAtUncheckedPointIndex(k));\r\n            }\r\n          } else {\r\n            break;\r\n          }\r\n        }\r\n        if (points.length > 1) {\r\n          const tolerance = this._options.colinearPointTolerance;\r\n          const compressedPointsA = PolylineOps.compressShortEdges(points, tolerance);\r\n          const compressedPointsB = PolylineOps.compressByPerpendicularDistance(compressedPointsA, tolerance);\r\n          if (i0 === 0 && i1 === numOriginal) {\r\n            // points is the entire curve, and the curve is closed.   Maybe the first and last segments are colinear.\r\n            PolylineCompressionContext.compressColinearWrapInPlace(compressedPointsB, tolerance);\r\n          }\r\n          if (compressedPointsB.length < 2) {\r\n            // Collapsed to a point?  Make a single point linestring\r\n            g.children[numAccept++] = LineString3d.create(compressedPointsB[0]);\r\n          } else if (compressedPointsB.length === 2) {\r\n            g.children[numAccept++] = LineSegment3d.create(compressedPointsB[0], compressedPointsB[1]);\r\n          } else {\r\n            g.children[numAccept++] = LineString3d.createPoints(compressedPointsB);\r\n          }\r\n        } else {\r\n          g.children[numAccept++] = basePrimitive;\r\n        }\r\n        i0 = i1;\r\n      } else if (this._options.consolidateCompatibleArcs && basePrimitive instanceof Arc3d) {\r\n        // subsume subsequent arcs into basePrimitive.\r\n        // always accept base primitive.\r\n        for (; ++i0 < g.children.length;) {\r\n          const nextPrimitive = g.children[i0];\r\n          if (!(nextPrimitive instanceof Arc3d))\r\n            break;\r\n          if (!CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive))\r\n            break;\r\n        }\r\n        // i0 has already advanced\r\n        g.children[numAccept++] = basePrimitive;    // which has been extended 0 or more times.\r\n      } else {\r\n        g.children[numAccept++] = basePrimitive;\r\n        i0++;\r\n      }\r\n    }\r\n    g.children.length = numAccept;\r\n  }\r\n\r\n  public override handlePath(g: Path): any { return this.handleCurveChain(g); }\r\n  public override handleLoop(g: Loop): any { return this.handleCurveChain(g); }\r\n  public override handleParityRegion(g: ParityRegion): any {\r\n    for (const child of g.children)\r\n      child.dispatchToGeometryHandler(this);\r\n  }\r\n  public override handleUnionRegion(g: UnionRegion): any {\r\n    for (const child of g.children)\r\n      child.dispatchToGeometryHandler(this);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"ConsolidateAdjacentPrimitivesContext.js","sourceRoot":"","sources":["../../../../src/curve/Query/ConsolidateAdjacentPrimitivesContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AAEvE,OAAO,EAAE,0BAA0B,EAAE,MAAM,kDAAkD,CAAC;AAC9F,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAC3D,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAEjC,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAI/C,OAAO,EAAE,yCAAyC,EAAE,MAAM,cAAc,CAAC;AAGzE;;;;GAIG;AACH,MAAM,OAAO,yCAA0C,SAAQ,mBAAmB;IAEhF,YAAmB,OAAmD;QACpE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,yCAAyC,EAAE,CAAC;IACtF,CAAC;IACD,iEAAiE;IAC1D,gBAAgB,CAAC,CAAa;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAC5B,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC;QACpC,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,2CAA2C;QAC3C,mFAAmF;QACnF,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,WAAW,GAAG;YAClC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,CAAC,aAAa,YAAY,aAAa,IAAI,aAAa,YAAY,YAAY,CAAC,EAAE;gBAChI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAClB,IAAI,EAAE,GAAG,EAAE,CAAC;gBACZ,6DAA6D;gBAC7D,OAAO,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;oBACnC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,aAAa,YAAY,aAAa,EAAE;wBAC1C,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC;wBACxC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC;qBACvC;yBAAM,IAAI,aAAa,YAAY,YAAY,EAAE;wBAChD,MAAM,MAAM,GAAG,aAAa,CAAC,YAAY,CAAC;wBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACtC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC,CAAC;yBACxD;qBACF;yBAAM;wBACL,MAAM;qBACP;iBACF;gBACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;oBACrB,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC;oBACvD,MAAM,iBAAiB,GAAG,WAAW,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;oBAC5E,MAAM,iBAAiB,GAAG,WAAW,CAAC,+BAA+B,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC;oBACpG,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,WAAW,EAAE;wBAClC,yGAAyG;wBACzG,0BAA0B,CAAC,2BAA2B,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC;qBACtF;oBACD,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;wBAChC,wDAAwD;wBACxD,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;qBACrE;yBAAM,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE;wBACzC,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;qBAC5F;yBAAM;wBACL,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,YAAY,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC;qBACxE;iBACF;qBAAM;oBACL,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC;iBACzC;gBACD,EAAE,GAAG,EAAE,CAAC;aACT;iBAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,aAAa,YAAY,KAAK,EAAE;gBACpF,8CAA8C;gBAC9C,gCAAgC;gBAChC,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG;oBAChC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,CAAC,CAAC,aAAa,YAAY,KAAK,CAAC;wBACnC,MAAM;oBACR,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,aAAa,EAAE,aAAa,CAAC;wBAChE,MAAM;iBACT;gBACD,0BAA0B;gBAC1B,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC,CAAI,2CAA2C;aACxF;iBAAM;gBACL,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC;gBACxC,EAAE,EAAE,CAAC;aACN;SACF;QACD,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,SAAS,CAAC;IAChC,CAAC;IAEe,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,kBAAkB,CAAC,CAAe;QAChD,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ;YAC5B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IACe,iBAAiB,CAAC,CAAc;QAC9C,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ;YAC5B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { NullGeometryHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { PolylineCompressionContext } from \"../../geometry3d/PolylineCompressionByEdgeOffset\";\r\nimport { PolylineOps } from \"../../geometry3d/PolylineOps\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { CurveChain } from \"../CurveCollection\";\r\nimport { CurveFactory } from \"../CurveFactory\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop } from \"../Loop\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { Path } from \"../Path\";\r\nimport { ConsolidateAdjacentCurvePrimitivesOptions } from \"../RegionOps\";\r\nimport { UnionRegion } from \"../UnionRegion\";\r\n\r\n/**\r\n * * Implementation class for ConsolidateAdjacentCurvePrimitives.\r\n *\r\n * @internal\r\n */\r\nexport class ConsolidateAdjacentCurvePrimitivesContext extends NullGeometryHandler {\r\n  private _options: ConsolidateAdjacentCurvePrimitivesOptions;\r\n  public constructor(options?: ConsolidateAdjacentCurvePrimitivesOptions) {\r\n    super();\r\n    this._options = options ? options : new ConsolidateAdjacentCurvePrimitivesOptions();\r\n  }\r\n  /** look for adjacent compatible primitives in a path or loop. */\r\n  public handleCurveChain(g: CurveChain) {\r\n    const children = g.children;\r\n    const numOriginal = children.length;\r\n    const points: Point3d[] = [];\r\n    let numAccept = 0;\r\n    // i0 <=i < i1 is a range of child indices.\r\n    // numAccept is the number of children accepted (contiguously at front of children)\r\n    for (let i0 = 0; i0 < numOriginal;) {\r\n      const basePrimitive = g.children[i0];\r\n      if (this._options.consolidateLinearGeometry && (basePrimitive instanceof LineSegment3d || basePrimitive instanceof LineString3d)) {\r\n        points.length = 0;\r\n        let i1 = i0;\r\n        // on exit, i1 is beyond the block of linear primitives  . ..\r\n        for (; i1 < g.children.length; i1++) {\r\n          const nextPrimitive = g.children[i1];\r\n          if (nextPrimitive instanceof LineSegment3d) {\r\n            points.push(nextPrimitive.startPoint());\r\n            points.push(nextPrimitive.endPoint());\r\n          } else if (nextPrimitive instanceof LineString3d) {\r\n            const source = nextPrimitive.packedPoints;\r\n            for (let k = 0; k < source.length; k++) {\r\n              points.push(source.getPoint3dAtUncheckedPointIndex(k));\r\n            }\r\n          } else {\r\n            break;\r\n          }\r\n        }\r\n        if (points.length > 1) {\r\n          const tolerance = this._options.colinearPointTolerance;\r\n          const compressedPointsA = PolylineOps.compressShortEdges(points, tolerance);\r\n          const compressedPointsB = PolylineOps.compressByPerpendicularDistance(compressedPointsA, tolerance);\r\n          if (i0 === 0 && i1 === numOriginal) {\r\n            // points is the entire curve, and the curve is closed.   Maybe the first and last segments are colinear.\r\n            PolylineCompressionContext.compressColinearWrapInPlace(compressedPointsB, tolerance);\r\n          }\r\n          if (compressedPointsB.length < 2) {\r\n            // Collapsed to a point?  Make a single point linestring\r\n            g.children[numAccept++] = LineString3d.create(compressedPointsB[0]);\r\n          } else if (compressedPointsB.length === 2) {\r\n            g.children[numAccept++] = LineSegment3d.create(compressedPointsB[0], compressedPointsB[1]);\r\n          } else {\r\n            g.children[numAccept++] = LineString3d.createPoints(compressedPointsB);\r\n          }\r\n        } else {\r\n          g.children[numAccept++] = basePrimitive;\r\n        }\r\n        i0 = i1;\r\n      } else if (this._options.consolidateCompatibleArcs && basePrimitive instanceof Arc3d) {\r\n        // subsume subsequent arcs into basePrimitive.\r\n        // always accept base primitive.\r\n        for (; ++i0 < g.children.length;) {\r\n          const nextPrimitive = g.children[i0];\r\n          if (!(nextPrimitive instanceof Arc3d))\r\n            break;\r\n          if (!CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive))\r\n            break;\r\n        }\r\n        // i0 has already advanced\r\n        g.children[numAccept++] = basePrimitive;    // which has been extended 0 or more times.\r\n      } else {\r\n        g.children[numAccept++] = basePrimitive;\r\n        i0++;\r\n      }\r\n    }\r\n    g.children.length = numAccept;\r\n  }\r\n\r\n  public override handlePath(g: Path): any { return this.handleCurveChain(g); }\r\n  public override handleLoop(g: Loop): any { return this.handleCurveChain(g); }\r\n  public override handleParityRegion(g: ParityRegion): any {\r\n    for (const child of g.children)\r\n      child.dispatchToGeometryHandler(this);\r\n  }\r\n  public override handleUnionRegion(g: UnionRegion): any {\r\n    for (const child of g.children)\r\n      child.dispatchToGeometryHandler(this);\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/Query/CurveSplitContext.d.ts

@@ -1,4 +1,4 @@
-import { AnyCurve } from "../CurveChain";
+import { AnyCurve } from "../CurveTypes";
 import { CurveCollection } from "../CurveCollection";
 /**
  * Context for splitting curves.

package/lib/esm/curve/Query/CurveSplitContext.js.map

@@ -1 +1 @@
-{"version":3,"file":"CurveSplitContext.js","sourceRoot":"","sources":["../../../../src/curve/Query/CurveSplitContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,OAAO,EAAE,UAAU,EAAmB,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAE3C,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAE/B;;GAEG;AACH,MAAM,qBAAqB;IAIzB,YAAmB,QAAgB,EAAE,gBAAsC;QACzE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IAC3C,CAAC;IACD;;;OAGG;IACI,OAAO,CAAC,KAA4B,EAAE,cAAuB;QAClE,IAAI,cAAc,IAAI,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;YAC9C,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC;QAClG,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;IACjC,CAAC;IACD,gDAAgD;IACzC,cAAc,CAAC,KAA4B;QAChD,OAAO,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IACtE,CAAC;IACD,2BAA2B;IACpB,GAAG,CAAC,QAAgB,EAAE,gBAAsC;QACjE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IAC3C,CAAC;CACF;AACD;;;;GAIG;AACH,MAAM,OAAO,iBAAiB;IAC5B,kEAAkE;IAC1D,MAAM,CAAC,+BAA+B,CAAC,IAA+B,EAAE,oBAA4B,QAAQ,CAAC,iBAAiB;QACpI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACnB,OAAO,KAAK,CAAC;QACf,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;YACvB,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,iBAAiB,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,GAAG,iBAAiB;gBAC5F,OAAO,IAAI,CAAC;SACf;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACO,4BAA4B,CAAC,UAA0B,EAAE,IAA2B,EAAE,IAA2B,EAAE,IAAsB;QAC/I,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE;YAC9B,MAAM,QAAQ,GAAG,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5E,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC;gBAC1C,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aACrB;SACF;QACD,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;IACD;;OAEG;IACK,+BAA+B,CAAC,UAA0B,EAAE,aAAoD,EAAE,SAA2B;QAEnJ,IAAI,aAAa,KAAK,SAAS,IAAI,CAAC,iBAAiB,CAAC,+BAA+B,CAAC,aAAa,CAAC,EAAE;YACpG,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;YACnC,OAAO;SACR;QACD,aAAa,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1I,MAAM,IAAI,GAAG,IAAI,qBAAqB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAI,qBAAqB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,qDAAqD;QAC7G,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE;YAChC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YAC9C,IAAI,CAAC,4BAA4B,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;SACtE;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QACzB,IAAI,CAAC,4BAA4B,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACvE,CAAC;IACM,MAAM,CAAC,uBAAuB,CAAC,WAAiC,EAAE,YAA6B;QACpG,MAAM,OAAO,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACxC,IAAI,WAAW,YAAY,cAAc,EAAE;YACzC,MAAM,MAAM,GAAqB,EAAE,CAAC;YACpC,MAAM,aAAa,GAAG,UAAU,CAAC,mBAAmB,CAAC,WAAW,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YAC9F,OAAO,CAAC,+BAA+B,CAAC,WAAW,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;YAC5E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;SACjC;aAAM,IAAI,WAAW,YAAY,UAAU,EAAE;YAC5C,MAAM,MAAM,GAAqB,EAAE,CAAC;YACpC,KAAK,MAAM,SAAS,IAAI,WAAW,CAAC,QAAQ,EAAE;gBAC5C,MAAM,aAAa,GAAG,UAAU,CAAC,mBAAmB,CAAC,SAAS,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;gBAC5F,OAAO,CAAC,+BAA+B,CAAC,SAAS,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;aAC3E;YACD,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;SACjC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { AnyCurve } from \"../CurveChain\";\r\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { CurveCurve } from \"../CurveCurve\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Path } from \"../Path\";\r\n\r\n/**\r\n * Data about a curve cut.\r\n */\r\nclass CutFractionDescriptor {\r\n  /** Fractional position along the curve */\r\n  public fraction: number;\r\n  public otherCurveDetail?: CurveLocationDetail;\r\n  public constructor(fraction: number, otherCurveDetail?: CurveLocationDetail) {\r\n    this.fraction = fraction;\r\n    this.otherCurveDetail = otherCurveDetail;\r\n  }\r\n  /** Transfer data from other to this.\r\n   * * Optionally look at both to set `otherCurveDetail`\r\n   *   * `other.otherCurveDetail` wins over `this.otherCurveDetail`\r\n   */\r\n  public setFrom(other: CutFractionDescriptor, combineCutFlag: boolean) {\r\n    if (combineCutFlag && this.isSameFraction(other))\r\n      this.otherCurveDetail = other.otherCurveDetail ? other.otherCurveDetail : this.otherCurveDetail;\r\n    this.fraction = other.fraction;\r\n  }\r\n  /** Test if a the fractions are almost equal. */\r\n  public isSameFraction(other: CutFractionDescriptor): boolean {\r\n    return Geometry.isSmallAngleRadians(this.fraction - other.fraction);\r\n  }\r\n  /** set from direct data */\r\n  public set(fraction: number, otherCurveDetail?: CurveLocationDetail) {\r\n    this.fraction = fraction;\r\n    this.otherCurveDetail = otherCurveDetail;\r\n  }\r\n}\r\n/**\r\n * Context for splitting curves.\r\n * * Sets startCut and endCut details on CurvePrimitive fragments.\r\n * @internal\r\n */\r\nexport class CurveSplitContext {\r\n  // return true if data has one or more non-endpoint intersections.\r\n  private static hasInteriorDetailAIntersections(data: CurveLocationDetailPair[], fractionTolerance: number = Geometry.smallAngleRadians): boolean {\r\n    if (data.length === 0)\r\n      return false;\r\n    for (const pair of data) {\r\n      if (pair.detailA.fraction > fractionTolerance || pair.detailA.fraction < 1 - fractionTolerance)\r\n        return true;\r\n    }\r\n    return false;\r\n  }\r\n  private collectFragmentAndAdvanceCut(curveToCut: CurvePrimitive, cutA: CutFractionDescriptor, cutB: CutFractionDescriptor, dest: CurvePrimitive[]) {\r\n    if (!cutA.isSameFraction(cutB)) {\r\n      const fragment = curveToCut.clonePartialCurve(cutA.fraction, cutB.fraction);\r\n      if (fragment !== undefined) {\r\n        fragment.startCut = cutA.otherCurveDetail;\r\n        fragment.endCut = cutB.otherCurveDetail;\r\n        dest.push(fragment);\r\n      }\r\n    }\r\n    cutA.setFrom(cutB, true);\r\n  }\r\n  /** Collect fragments from an intersections array, with the array detailA entries all referencing to curveToCut.\r\n   * * The `intersections` array is sorted on its detailA field.\r\n   */\r\n  private collectSinglePrimitiveFragments(curveToCut: CurvePrimitive, intersections: CurveLocationDetailPair[] | undefined, fragments: CurvePrimitive[]) {\r\n\r\n    if (intersections === undefined || !CurveSplitContext.hasInteriorDetailAIntersections(intersections)) {\r\n      fragments.push(curveToCut.clone());\r\n      return;\r\n    }\r\n    intersections.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => (pairA.detailA.fraction - pairB.detailA.fraction));\r\n    const cutA = new CutFractionDescriptor(0.0, undefined);\r\n    const cutB = new CutFractionDescriptor(1.0, undefined); // but those values are immediately reset before use.\r\n    for (const pair of intersections) {\r\n      cutB.set(pair.detailA.fraction, pair.detailB);\r\n      this.collectFragmentAndAdvanceCut(curveToCut, cutA, cutB, fragments);\r\n    }\r\n    cutB.set(1.0, undefined);\r\n    this.collectFragmentAndAdvanceCut(curveToCut, cutA, cutB, fragments);\r\n  }\r\n  public static cloneCurvesWithXYSplits(curvesToCut: AnyCurve | undefined, cutterCurves: CurveCollection): AnyCurve | undefined {\r\n    const context = new CurveSplitContext();\r\n    if (curvesToCut instanceof CurvePrimitive) {\r\n      const result: CurvePrimitive[] = [];\r\n      const intersections = CurveCurve.intersectionXYPairs(curvesToCut, false, cutterCurves, false);\r\n      context.collectSinglePrimitiveFragments(curvesToCut, intersections, result);\r\n      if (result.length === 1)\r\n        return result[0];\r\n      return Path.createArray(result);\r\n    } else if (curvesToCut instanceof CurveChain) {\r\n      const result: CurvePrimitive[] = [];\r\n      for (const primitive of curvesToCut.children) {\r\n        const intersections = CurveCurve.intersectionXYPairs(primitive, false, cutterCurves, false);\r\n        context.collectSinglePrimitiveFragments(primitive, intersections, result);\r\n      }\r\n      return Path.createArray(result);\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CurveSplitContext.js","sourceRoot":"","sources":["../../../../src/curve/Query/CurveSplitContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,OAAO,EAAE,UAAU,EAAmB,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAE3C,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAE/B;;GAEG;AACH,MAAM,qBAAqB;IAIzB,YAAmB,QAAgB,EAAE,gBAAsC;QACzE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IAC3C,CAAC;IACD;;;OAGG;IACI,OAAO,CAAC,KAA4B,EAAE,cAAuB;QAClE,IAAI,cAAc,IAAI,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;YAC9C,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC;QAClG,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;IACjC,CAAC;IACD,gDAAgD;IACzC,cAAc,CAAC,KAA4B;QAChD,OAAO,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IACtE,CAAC;IACD,2BAA2B;IACpB,GAAG,CAAC,QAAgB,EAAE,gBAAsC;QACjE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IAC3C,CAAC;CACF;AACD;;;;GAIG;AACH,MAAM,OAAO,iBAAiB;IAC5B,kEAAkE;IAC1D,MAAM,CAAC,+BAA+B,CAAC,IAA+B,EAAE,oBAA4B,QAAQ,CAAC,iBAAiB;QACpI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACnB,OAAO,KAAK,CAAC;QACf,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;YACvB,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,iBAAiB,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,GAAG,iBAAiB;gBAC5F,OAAO,IAAI,CAAC;SACf;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACO,4BAA4B,CAAC,UAA0B,EAAE,IAA2B,EAAE,IAA2B,EAAE,IAAsB;QAC/I,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE;YAC9B,MAAM,QAAQ,GAAG,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5E,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC;gBAC1C,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aACrB;SACF;QACD,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;IACD;;OAEG;IACK,+BAA+B,CAAC,UAA0B,EAAE,aAAoD,EAAE,SAA2B;QAEnJ,IAAI,aAAa,KAAK,SAAS,IAAI,CAAC,iBAAiB,CAAC,+BAA+B,CAAC,aAAa,CAAC,EAAE;YACpG,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;YACnC,OAAO;SACR;QACD,aAAa,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1I,MAAM,IAAI,GAAG,IAAI,qBAAqB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAI,qBAAqB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,qDAAqD;QAC7G,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE;YAChC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YAC9C,IAAI,CAAC,4BAA4B,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;SACtE;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QACzB,IAAI,CAAC,4BAA4B,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACvE,CAAC;IACM,MAAM,CAAC,uBAAuB,CAAC,WAAiC,EAAE,YAA6B;QACpG,MAAM,OAAO,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACxC,IAAI,WAAW,YAAY,cAAc,EAAE;YACzC,MAAM,MAAM,GAAqB,EAAE,CAAC;YACpC,MAAM,aAAa,GAAG,UAAU,CAAC,mBAAmB,CAAC,WAAW,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YAC9F,OAAO,CAAC,+BAA+B,CAAC,WAAW,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;YAC5E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;SACjC;aAAM,IAAI,WAAW,YAAY,UAAU,EAAE;YAC5C,MAAM,MAAM,GAAqB,EAAE,CAAC;YACpC,KAAK,MAAM,SAAS,IAAI,WAAW,CAAC,QAAQ,EAAE;gBAC5C,MAAM,aAAa,GAAG,UAAU,CAAC,mBAAmB,CAAC,SAAS,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;gBAC5F,OAAO,CAAC,+BAA+B,CAAC,SAAS,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;aAC3E;YACD,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;SACjC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { AnyCurve } from \"../CurveTypes\";\r\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { CurveCurve } from \"../CurveCurve\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Path } from \"../Path\";\r\n\r\n/**\r\n * Data about a curve cut.\r\n */\r\nclass CutFractionDescriptor {\r\n  /** Fractional position along the curve */\r\n  public fraction: number;\r\n  public otherCurveDetail?: CurveLocationDetail;\r\n  public constructor(fraction: number, otherCurveDetail?: CurveLocationDetail) {\r\n    this.fraction = fraction;\r\n    this.otherCurveDetail = otherCurveDetail;\r\n  }\r\n  /** Transfer data from other to this.\r\n   * * Optionally look at both to set `otherCurveDetail`\r\n   *   * `other.otherCurveDetail` wins over `this.otherCurveDetail`\r\n   */\r\n  public setFrom(other: CutFractionDescriptor, combineCutFlag: boolean) {\r\n    if (combineCutFlag && this.isSameFraction(other))\r\n      this.otherCurveDetail = other.otherCurveDetail ? other.otherCurveDetail : this.otherCurveDetail;\r\n    this.fraction = other.fraction;\r\n  }\r\n  /** Test if a the fractions are almost equal. */\r\n  public isSameFraction(other: CutFractionDescriptor): boolean {\r\n    return Geometry.isSmallAngleRadians(this.fraction - other.fraction);\r\n  }\r\n  /** set from direct data */\r\n  public set(fraction: number, otherCurveDetail?: CurveLocationDetail) {\r\n    this.fraction = fraction;\r\n    this.otherCurveDetail = otherCurveDetail;\r\n  }\r\n}\r\n/**\r\n * Context for splitting curves.\r\n * * Sets startCut and endCut details on CurvePrimitive fragments.\r\n * @internal\r\n */\r\nexport class CurveSplitContext {\r\n  // return true if data has one or more non-endpoint intersections.\r\n  private static hasInteriorDetailAIntersections(data: CurveLocationDetailPair[], fractionTolerance: number = Geometry.smallAngleRadians): boolean {\r\n    if (data.length === 0)\r\n      return false;\r\n    for (const pair of data) {\r\n      if (pair.detailA.fraction > fractionTolerance || pair.detailA.fraction < 1 - fractionTolerance)\r\n        return true;\r\n    }\r\n    return false;\r\n  }\r\n  private collectFragmentAndAdvanceCut(curveToCut: CurvePrimitive, cutA: CutFractionDescriptor, cutB: CutFractionDescriptor, dest: CurvePrimitive[]) {\r\n    if (!cutA.isSameFraction(cutB)) {\r\n      const fragment = curveToCut.clonePartialCurve(cutA.fraction, cutB.fraction);\r\n      if (fragment !== undefined) {\r\n        fragment.startCut = cutA.otherCurveDetail;\r\n        fragment.endCut = cutB.otherCurveDetail;\r\n        dest.push(fragment);\r\n      }\r\n    }\r\n    cutA.setFrom(cutB, true);\r\n  }\r\n  /** Collect fragments from an intersections array, with the array detailA entries all referencing to curveToCut.\r\n   * * The `intersections` array is sorted on its detailA field.\r\n   */\r\n  private collectSinglePrimitiveFragments(curveToCut: CurvePrimitive, intersections: CurveLocationDetailPair[] | undefined, fragments: CurvePrimitive[]) {\r\n\r\n    if (intersections === undefined || !CurveSplitContext.hasInteriorDetailAIntersections(intersections)) {\r\n      fragments.push(curveToCut.clone());\r\n      return;\r\n    }\r\n    intersections.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => (pairA.detailA.fraction - pairB.detailA.fraction));\r\n    const cutA = new CutFractionDescriptor(0.0, undefined);\r\n    const cutB = new CutFractionDescriptor(1.0, undefined); // but those values are immediately reset before use.\r\n    for (const pair of intersections) {\r\n      cutB.set(pair.detailA.fraction, pair.detailB);\r\n      this.collectFragmentAndAdvanceCut(curveToCut, cutA, cutB, fragments);\r\n    }\r\n    cutB.set(1.0, undefined);\r\n    this.collectFragmentAndAdvanceCut(curveToCut, cutA, cutB, fragments);\r\n  }\r\n  public static cloneCurvesWithXYSplits(curvesToCut: AnyCurve | undefined, cutterCurves: CurveCollection): AnyCurve | undefined {\r\n    const context = new CurveSplitContext();\r\n    if (curvesToCut instanceof CurvePrimitive) {\r\n      const result: CurvePrimitive[] = [];\r\n      const intersections = CurveCurve.intersectionXYPairs(curvesToCut, false, cutterCurves, false);\r\n      context.collectSinglePrimitiveFragments(curvesToCut, intersections, result);\r\n      if (result.length === 1)\r\n        return result[0];\r\n      return Path.createArray(result);\r\n    } else if (curvesToCut instanceof CurveChain) {\r\n      const result: CurvePrimitive[] = [];\r\n      for (const primitive of curvesToCut.children) {\r\n        const intersections = CurveCurve.intersectionXYPairs(primitive, false, cutterCurves, false);\r\n        context.collectSinglePrimitiveFragments(primitive, intersections, result);\r\n      }\r\n      return Path.createArray(result);\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/Query/CylindricalRange.d.ts

@@ -5,7 +5,7 @@ import { RecurseToCurvesGeometryHandler } from "../../geometry3d/GeometryHandler
 import { Vector3d } from "../../geometry3d/Point3dVector3d";
 import { Ray3d } from "../../geometry3d/Ray3d";
 import { Arc3d } from "../Arc3d";
-import { AnyCurve } from "../CurveChain";
+import { AnyCurve } from "../CurveTypes";
 import { GeometryQuery } from "../GeometryQuery";
 import { LineSegment3d } from "../LineSegment3d";
 import { LineString3d } from "../LineString3d";

package/lib/esm/curve/Query/CylindricalRange.js.map

@@ -1 +1 @@
-{"version":3,"file":"CylindricalRange.js","sourceRoot":"","sources":["../../../../src/curve/Query/CylindricalRange.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAOrE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD;;;GAGG;AACH,MAAM,OAAO,qBAAsB,SAAQ,8BAA8B;IAKvE,kDAAkD;IAClD,YAAoB,GAAU;QAC5B,KAAK,EAAE,CAAC;QAKF,gBAAW,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,gBAAW,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QALrC,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC;QACxB,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,aAAa,EAAG,CAAC;IAC5C,CAAC;IAGO,aAAa,CAAC,GAAY;QAChC,IAAI,CAAC,aAAa,CAAC,sBAAsB,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC;QAChD,IAAI,QAAQ,IAAI,IAAI,CAAC,YAAY,EAAE;YACjC,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;YAC7B,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClD,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,GAAG,CAAC;YACzB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;SAChG;IACH,CAAC;IAEe,mBAAmB,CAAC,QAAuB;QACzD,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1D,CAAC;IACe,kBAAkB,CAAC,GAAiB;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,EAAE;YACxC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SACtC;IACH,CAAC;IAEe,WAAW,CAAC,IAAW;QACrC,8BAA8B;QAC9B,qBAAqB;QACrB,0DAA0D;QAC1D,iCAAiC;QACjC,MAAM,SAAS,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;QAC1F,MAAM,EAAE,GAAG,GAAG,GAAG,SAAS,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE;YACnC,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC/C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,uBAAuB,CAAC,GAAU,EAAE,QAAuB;QACvE,MAAM,WAAW,GAAG,IAAI,qBAAqB,CAAC,GAAG,CAAC,CAAC;QACnD,QAAQ,CAAC,yBAAyB,CAAC,WAAW,CAAC,CAAC;QAChD,OAAO,WAAW,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IACzC,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,mCAAmC,CAAC,QAAkB,EAAE,IAAW,EAAE,qBAA+B;QAChH,IAAI,QAAQ,YAAY,YAAY,EAAE;YACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC;YACrC,MAAM,WAAW,GAAG,QAAQ,CAAC,iBAAiB,CAAC;YAC/C,MAAM,OAAO,GAAG,QAAQ,CAAC,yBAAyB,EAAE,CAAC;YACrD,IAAI,WAAW,IAAI,OAAO,EAAE;gBAC1B,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAClC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAE,8DAA8D;gBAClG,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC/C,IAAI,CAAC,iCAAiC,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;oBACrD,IAAI,OAAO,CAAC,YAAY;wBACtB,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,qBAAqB,EAAE,OAAO,CAAC,CAAC;;wBAE5D,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;oBAChD,QAAQ,CAAC,iBAAiB,CAAC,+BAA+B,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,qCAAqC;oBAC7G,OAAO,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAE,4BAA4B;oBACrE,OAAO,CAAC,gBAAgB,EAAE,CAAC;oBAC3B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;iBACvB;aACF;SACF;aAAM,IAAI,QAAQ,CAAC,QAAQ,EAAE;YAC5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;YACnC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;gBAC5B,IAAI,CAAC,mCAAmC,CAAC,KAAiB,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;aAC1F;SACF;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { AnyCurve } from \"../CurveChain\";\r\nimport { GeometryQuery } from \"../GeometryQuery\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { StrokeOptions } from \"../StrokeOptions\";\r\n\r\n/**\r\n * Context for computing geometry range around an axis.\r\n * * The publicly called method is `computeZRRange (ray, geometry)\r\n */\r\nexport class CylindricalRangeQuery extends RecurseToCurvesGeometryHandler {\r\n  // private geometry0: GeometryQuery;  <-- Never used\r\n  private _perpVector: Vector3d;\r\n  private _maxDistance: number;\r\n  private _localToWorld: Transform;\r\n  /** capture ray and initialize evolving ranges. */\r\n  private constructor(ray: Ray3d) {\r\n    super();\r\n    this._perpVector = Vector3d.createZero();\r\n    this._maxDistance = 0.0;\r\n    this._localToWorld = ray.toRigidZFrame()!;\r\n  }\r\n  private _localPoint = Point3d.create();\r\n  private _worldPoint = Point3d.create();\r\n  private announcePoint(xyz: Point3d) {\r\n    this._localToWorld.multiplyInversePoint3d(xyz, this._localPoint);\r\n    const distance = this._localPoint.magnitudeXY();\r\n    if (distance >= this._maxDistance) {\r\n      this._maxDistance = distance;\r\n      this._perpVector.setFromPoint3d(this._localPoint);\r\n      this._perpVector.z = 0.0;\r\n      this._localToWorld.matrix.multiplyXY(this._localPoint.x, this._localPoint.y, this._perpVector);\r\n    }\r\n  }\r\n\r\n  public override handleLineSegment3d(segment0: LineSegment3d) {\r\n    this.announcePoint(segment0.startPoint(this._worldPoint));\r\n    this.announcePoint(segment0.endPoint(this._worldPoint));\r\n  }\r\n  public override handleLineString3d(ls0: LineString3d) {\r\n    for (let i = 0; i < ls0.numPoints(); i++) {\r\n      ls0.pointAt(i, this._worldPoint);\r\n      this.announcePoint(this._worldPoint);\r\n    }\r\n  }\r\n\r\n  public override handleArc3d(arc0: Arc3d): any {\r\n    // humbug .. just stroke it ..\r\n    // exact solution is:\r\n    //   project the arc to the z=0 plane of the local system.\r\n    //   find max distance to origin.\r\n    const numStroke = StrokeOptions.applyAngleTol(undefined, 3, arc0.sweep.sweepRadians, 0.1);\r\n    const df = 1.0 / numStroke;\r\n    for (let i = 0; i <= numStroke; i++) {\r\n      arc0.fractionToPoint(i * df, this._worldPoint);\r\n      this.announcePoint(this._worldPoint);\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * Compute the largest vector perpendicular to a ray and ending on the geometry.\r\n   * @param geometry0 geometry to search\r\n   * @returns vector from ray to geometry.\r\n   */\r\n  public static computeMaxVectorFromRay(ray: Ray3d, geometry: GeometryQuery): Vector3d {\r\n    const accumulator = new CylindricalRangeQuery(ray);\r\n    geometry.dispatchToGeometryHandler(accumulator);\r\n    return accumulator._perpVector.clone();\r\n  }\r\n\r\n  /**\r\n   * Recurse through geometry.children to find linestrings.\r\n   * In each linestring, compute the surface normal annotation from\r\n   *  * the curve tangent stored in the linestring\r\n   *  * the axis of rotation\r\n   *  * a default V vector to be used when the linestring point is close to the axis.\r\n   * @param geometry\r\n   * @param axis\r\n   * @param defaultVectorV\r\n   */\r\n  public static buildRotationalNormalsInLineStrings(geometry: AnyCurve, axis: Ray3d, defaultVectorFromAxis: Vector3d) {\r\n    if (geometry instanceof LineString3d) {\r\n      const points = geometry.packedPoints;\r\n      const derivatives = geometry.packedDerivatives;\r\n      const normals = geometry.ensureEmptySurfaceNormals();\r\n      if (derivatives && normals) {\r\n        const vectorU = Vector3d.create();\r\n        const vectorV = Vector3d.create();  // v direction (forwward along sweep) for surface of rotation.\r\n        const xyz = Point3d.create();\r\n        const n = points.length;\r\n        for (let i = 0; i < n; i++) {\r\n          points.getPoint3dAtUncheckedPointIndex(i, xyz);\r\n          axis.perpendicularPartOfVectorToTarget(xyz, vectorU);\r\n          if (vectorU.isAlmostZero)\r\n            axis.direction.crossProduct(defaultVectorFromAxis, vectorV);\r\n          else\r\n            axis.direction.crossProduct(vectorU, vectorV);\r\n          geometry.packedDerivatives.getVector3dAtCheckedVectorIndex(i, vectorU); // reuse vector U as curve derivative\r\n          vectorU.crossProduct(vectorV, vectorV);  // reuse vector V as normal!\r\n          vectorV.normalizeInPlace();\r\n          normals.push(vectorV);\r\n        }\r\n      }\r\n    } else if (geometry.children) {\r\n      const children = geometry.children;\r\n      for (const child of children) {\r\n        this.buildRotationalNormalsInLineStrings(child as AnyCurve, axis, defaultVectorFromAxis);\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CylindricalRange.js","sourceRoot":"","sources":["../../../../src/curve/Query/CylindricalRange.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAOrE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD;;;GAGG;AACH,MAAM,OAAO,qBAAsB,SAAQ,8BAA8B;IAKvE,kDAAkD;IAClD,YAAoB,GAAU;QAC5B,KAAK,EAAE,CAAC;QAKF,gBAAW,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,gBAAW,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QALrC,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC;QACxB,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,aAAa,EAAG,CAAC;IAC5C,CAAC;IAGO,aAAa,CAAC,GAAY;QAChC,IAAI,CAAC,aAAa,CAAC,sBAAsB,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC;QAChD,IAAI,QAAQ,IAAI,IAAI,CAAC,YAAY,EAAE;YACjC,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;YAC7B,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClD,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,GAAG,CAAC;YACzB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;SAChG;IACH,CAAC;IAEe,mBAAmB,CAAC,QAAuB;QACzD,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1D,CAAC;IACe,kBAAkB,CAAC,GAAiB;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,EAAE;YACxC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SACtC;IACH,CAAC;IAEe,WAAW,CAAC,IAAW;QACrC,8BAA8B;QAC9B,qBAAqB;QACrB,0DAA0D;QAC1D,iCAAiC;QACjC,MAAM,SAAS,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;QAC1F,MAAM,EAAE,GAAG,GAAG,GAAG,SAAS,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE;YACnC,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC/C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,uBAAuB,CAAC,GAAU,EAAE,QAAuB;QACvE,MAAM,WAAW,GAAG,IAAI,qBAAqB,CAAC,GAAG,CAAC,CAAC;QACnD,QAAQ,CAAC,yBAAyB,CAAC,WAAW,CAAC,CAAC;QAChD,OAAO,WAAW,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IACzC,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,mCAAmC,CAAC,QAAkB,EAAE,IAAW,EAAE,qBAA+B;QAChH,IAAI,QAAQ,YAAY,YAAY,EAAE;YACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC;YACrC,MAAM,WAAW,GAAG,QAAQ,CAAC,iBAAiB,CAAC;YAC/C,MAAM,OAAO,GAAG,QAAQ,CAAC,yBAAyB,EAAE,CAAC;YACrD,IAAI,WAAW,IAAI,OAAO,EAAE;gBAC1B,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAClC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAE,8DAA8D;gBAClG,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC/C,IAAI,CAAC,iCAAiC,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;oBACrD,IAAI,OAAO,CAAC,YAAY;wBACtB,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,qBAAqB,EAAE,OAAO,CAAC,CAAC;;wBAE5D,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;oBAChD,QAAQ,CAAC,iBAAiB,CAAC,+BAA+B,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,qCAAqC;oBAC7G,OAAO,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAE,4BAA4B;oBACrE,OAAO,CAAC,gBAAgB,EAAE,CAAC;oBAC3B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;iBACvB;aACF;SACF;aAAM,IAAI,QAAQ,CAAC,QAAQ,EAAE;YAC5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;YACnC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;gBAC5B,IAAI,CAAC,mCAAmC,CAAC,KAAiB,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;aAC1F;SACF;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { AnyCurve } from \"../CurveTypes\";\r\nimport { GeometryQuery } from \"../GeometryQuery\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { StrokeOptions } from \"../StrokeOptions\";\r\n\r\n/**\r\n * Context for computing geometry range around an axis.\r\n * * The publicly called method is `computeZRRange (ray, geometry)\r\n */\r\nexport class CylindricalRangeQuery extends RecurseToCurvesGeometryHandler {\r\n  // private geometry0: GeometryQuery;  <-- Never used\r\n  private _perpVector: Vector3d;\r\n  private _maxDistance: number;\r\n  private _localToWorld: Transform;\r\n  /** capture ray and initialize evolving ranges. */\r\n  private constructor(ray: Ray3d) {\r\n    super();\r\n    this._perpVector = Vector3d.createZero();\r\n    this._maxDistance = 0.0;\r\n    this._localToWorld = ray.toRigidZFrame()!;\r\n  }\r\n  private _localPoint = Point3d.create();\r\n  private _worldPoint = Point3d.create();\r\n  private announcePoint(xyz: Point3d) {\r\n    this._localToWorld.multiplyInversePoint3d(xyz, this._localPoint);\r\n    const distance = this._localPoint.magnitudeXY();\r\n    if (distance >= this._maxDistance) {\r\n      this._maxDistance = distance;\r\n      this._perpVector.setFromPoint3d(this._localPoint);\r\n      this._perpVector.z = 0.0;\r\n      this._localToWorld.matrix.multiplyXY(this._localPoint.x, this._localPoint.y, this._perpVector);\r\n    }\r\n  }\r\n\r\n  public override handleLineSegment3d(segment0: LineSegment3d) {\r\n    this.announcePoint(segment0.startPoint(this._worldPoint));\r\n    this.announcePoint(segment0.endPoint(this._worldPoint));\r\n  }\r\n  public override handleLineString3d(ls0: LineString3d) {\r\n    for (let i = 0; i < ls0.numPoints(); i++) {\r\n      ls0.pointAt(i, this._worldPoint);\r\n      this.announcePoint(this._worldPoint);\r\n    }\r\n  }\r\n\r\n  public override handleArc3d(arc0: Arc3d): any {\r\n    // humbug .. just stroke it ..\r\n    // exact solution is:\r\n    //   project the arc to the z=0 plane of the local system.\r\n    //   find max distance to origin.\r\n    const numStroke = StrokeOptions.applyAngleTol(undefined, 3, arc0.sweep.sweepRadians, 0.1);\r\n    const df = 1.0 / numStroke;\r\n    for (let i = 0; i <= numStroke; i++) {\r\n      arc0.fractionToPoint(i * df, this._worldPoint);\r\n      this.announcePoint(this._worldPoint);\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * Compute the largest vector perpendicular to a ray and ending on the geometry.\r\n   * @param geometry0 geometry to search\r\n   * @returns vector from ray to geometry.\r\n   */\r\n  public static computeMaxVectorFromRay(ray: Ray3d, geometry: GeometryQuery): Vector3d {\r\n    const accumulator = new CylindricalRangeQuery(ray);\r\n    geometry.dispatchToGeometryHandler(accumulator);\r\n    return accumulator._perpVector.clone();\r\n  }\r\n\r\n  /**\r\n   * Recurse through geometry.children to find linestrings.\r\n   * In each linestring, compute the surface normal annotation from\r\n   *  * the curve tangent stored in the linestring\r\n   *  * the axis of rotation\r\n   *  * a default V vector to be used when the linestring point is close to the axis.\r\n   * @param geometry\r\n   * @param axis\r\n   * @param defaultVectorV\r\n   */\r\n  public static buildRotationalNormalsInLineStrings(geometry: AnyCurve, axis: Ray3d, defaultVectorFromAxis: Vector3d) {\r\n    if (geometry instanceof LineString3d) {\r\n      const points = geometry.packedPoints;\r\n      const derivatives = geometry.packedDerivatives;\r\n      const normals = geometry.ensureEmptySurfaceNormals();\r\n      if (derivatives && normals) {\r\n        const vectorU = Vector3d.create();\r\n        const vectorV = Vector3d.create();  // v direction (forwward along sweep) for surface of rotation.\r\n        const xyz = Point3d.create();\r\n        const n = points.length;\r\n        for (let i = 0; i < n; i++) {\r\n          points.getPoint3dAtUncheckedPointIndex(i, xyz);\r\n          axis.perpendicularPartOfVectorToTarget(xyz, vectorU);\r\n          if (vectorU.isAlmostZero)\r\n            axis.direction.crossProduct(defaultVectorFromAxis, vectorV);\r\n          else\r\n            axis.direction.crossProduct(vectorU, vectorV);\r\n          geometry.packedDerivatives.getVector3dAtCheckedVectorIndex(i, vectorU); // reuse vector U as curve derivative\r\n          vectorU.crossProduct(vectorV, vectorV);  // reuse vector V as normal!\r\n          vectorV.normalizeInPlace();\r\n          normals.push(vectorV);\r\n        }\r\n      }\r\n    } else if (geometry.children) {\r\n      const children = geometry.children;\r\n      for (const child of children) {\r\n        this.buildRotationalNormalsInLineStrings(child as AnyCurve, axis, defaultVectorFromAxis);\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/Query/InOutTests.d.ts

@@ -1,4 +1,4 @@
-import { AnyRegion } from "../CurveChain";
+import { AnyRegion } from "../CurveTypes";
 import { Loop } from "../Loop";
 import { ParityRegion } from "../ParityRegion";
 import { UnionRegion } from "../UnionRegion";

package/lib/esm/curve/Query/InOutTests.js.map

@@ -1 +1 @@
-{"version":3,"file":"InOutTests.js","sourceRoot":"","sources":["../../../../src/curve/Query/InOutTests.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,4BAA4B,EAAE,MAAM,+CAA+C,CAAC;AAC7F,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAE3D,OAAO,EAAE,iBAAiB,EAAuB,MAAM,wBAAwB,CAAC;AAChF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE7C;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IAC9B;;;;;;;;;;OAUG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAU,EAAE,CAAS,EAAE,CAAS;QACnE,IAAI,KAAmC,CAAC;QACxC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,KAAK,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,GAAG,EAAE,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE;YAC1F,KAAK,GAAG,4BAA4B,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAE,CAAC;YACxF,MAAM,MAAM,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;YACpC,MAAM,aAAa,GAA0B,EAAE,CAAC;YAChD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAC9B,IAAI,EAAE,YAAY,cAAc;oBAC9B,EAAE,CAAC,6BAA6B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;aAC1D;YACD,cAAc,CAAC,sBAAsB,CAAC,aAAa,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAClE,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,IAAI,EAAE,EAAE,EAAE,CAAC;YACX,4CAA4C;YAC5C,oDAAoD;YACpD,kEAAkE;YAClE,sEAAsE;YACtE,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE;gBACxC,IAAI,YAAY,CAAC,YAAY,KAAK,iBAAiB,CAAC,QAAQ;uBACvD,YAAY,CAAC,YAAY,KAAK,SAAS,EAAE;oBAC5C,SAAS,EAAE,CAAC;iBACb;gBACD,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC9B,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC9B,IAAI,QAAQ,CAAC,kBAAkB,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;oBAC3C,OAAO,CAAC,CAAC;gBACX,MAAM,KAAK,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBACpE,IAAI,EAAE,CAAC,eAAe,CAAC,YAAY,CAAC,KAAK,CAAC;oBACxC,OAAO,CAAC,CAAC;gBACX,IAAI,KAAK,GAAG,GAAG;oBACb,OAAO,EAAE,CAAC;qBACP,IAAI,KAAK,GAAG,GAAG;oBAClB,QAAQ,EAAE,CAAC;aACd;YACD,IAAI,SAAS,KAAK,CAAC,EAAE,uBAAuB;gBAC1C,SAAS;YACX,MAAM,UAAU,GAAG,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,WAAW,GAAG,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,UAAU,KAAK,WAAW;gBAC5B,OAAO,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACpC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,8BAA8B,CAAC,MAAoB,EAAE,CAAS,EAAE,CAAS;QACrF,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,QAAQ,EAAE;YAClC,IAAI,IAAI,YAAY,IAAI,EAAE;gBACxB,MAAM,CAAC,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC;oBACT,OAAO,CAAC,CAAC;gBACX,IAAI,CAAC,GAAG,CAAC;oBACP,MAAM,GAAG,CAAE,MAAM,CAAC;aACrB;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,MAAM,CAAC,6BAA6B,CAAC,MAAmB,EAAE,CAAS,EAAE,CAAS;QACnF,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,QAAQ,EAAE;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,IAAI,QAAQ,IAAI,CAAC;gBACf,OAAO,QAAQ,CAAC;SACnB;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACM,MAAM,CAAC,wBAAwB,CAAC,MAAiB,EAAE,CAAS,EAAE,CAAS;QAC5E,IAAI,MAAM,YAAY,IAAI;YACxB,OAAO,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;aAC9C,IAAI,MAAM,YAAY,YAAY;YACrC,OAAO,IAAI,CAAC,8BAA8B,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;aACtD,IAAI,MAAM,YAAY,WAAW;YACpC,OAAO,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;CAEF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Angle } from \"../../geometry3d/Angle\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { AnyRegion } from \"../CurveChain\";\r\nimport { CurveIntervalRole, CurveLocationDetail } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Loop } from \"../Loop\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { UnionRegion } from \"../UnionRegion\";\r\n\r\n/**\r\n * Context for testing containment in Loop, ParityRegion and UnionRegion.\r\n * @internal\r\n */\r\nexport class PointInOnOutContext {\r\n  /**\r\n   * In-out test for a single loop.\r\n   * * Test by finding intersections with an xy line (xyz plane) in \"some\" direction.\r\n   * * Test logic gets complicated if the plane has a vertex hit.\r\n   * * If that happens, don't try to figure out the cases.   Just move on to another plane.\r\n   * * Any \"on\" point triggers immediate 0 return.\r\n   *   * (Hence if there are overlapping lines their self-canceling effect might be wrong.)\r\n   * @param loop\r\n   * @param x tested x coordinate\r\n   * @param y tested y coordinate\r\n   */\r\n  public static testPointInOnOutLoopXY(loop: Loop, x: number, y: number): number {\r\n    let plane: Plane3dByOriginAndUnitNormal;\r\n    const xy = Point3d.create(x, y);\r\n    for (let radians = 0.0; Math.abs(radians) < 6.0; radians = -1.2313 * (radians + 0.3212897)) {\r\n      plane = Plane3dByOriginAndUnitNormal.createXYAngle(x, y, Angle.createRadians(radians))!;\r\n      const normal = plane.getNormalRef();\r\n      const intersections: CurveLocationDetail[] = [];\r\n      for (const cp of loop.children) {\r\n        if (cp instanceof CurvePrimitive)\r\n          cp.appendPlaneIntersectionPoints(plane, intersections);\r\n      }\r\n      CurvePrimitive.snapAndRestrictDetails(intersections, false, true);\r\n      let numLeft = 0;\r\n      let numRight = 0;\r\n      let numTricky = 0;\r\n      let wx, wy;\r\n      // Count simple crossings to left and right.\r\n      // Also count tricky crossings (vertex hits, onEdge)\r\n      // If there are any tricky ones, go around with a different plane.\r\n      // A intently devious tester could make every plane hit tricky things.\r\n      for (const intersection of intersections) {\r\n        if (intersection.intervalRole !== CurveIntervalRole.isolated\r\n          && intersection.intervalRole !== undefined) {\r\n          numTricky++;\r\n        }\r\n        wx = intersection.point.x - x;\r\n        wy = intersection.point.y - y;\r\n        if (Geometry.isSameCoordinateXY(wx, wy, 0, 0))\r\n          return 0;\r\n        const cross = Geometry.crossProductXYXY(normal.x, normal.y, wx, wy);\r\n        if (xy.isAlmostEqualXY(intersection.point))\r\n          return 0;\r\n        if (cross < 0.0)\r\n          numLeft++;\r\n        else if (cross > 0.0)\r\n          numRight++;\r\n      }\r\n      if (numTricky !== 0) // try another angle !!\r\n        continue;\r\n      const leftParity = numLeft & (0x01);\r\n      const rightParity = numRight & (0x01);\r\n      if (leftParity === rightParity)\r\n        return leftParity === 1 ? 1 : -1;\r\n    }\r\n    return -1;\r\n  }\r\n  /**\r\n   * strongly-typed parity region handling: XOR of all loops. (But any ON is returned as edge hit.)\r\n   * @param parent\r\n   * @param x\r\n   * @param y\r\n   */\r\n  public static testPointInOnOutParityRegionXY(parent: ParityRegion, x: number, y: number): number {\r\n    let result = -1;\r\n    for (const loop of parent.children) {\r\n      if (loop instanceof Loop) {\r\n        const q = this.testPointInOnOutLoopXY(loop, x, y);\r\n        if (q === 0)\r\n          return 0;\r\n        if (q > 0)\r\n          result = - result;\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  public static testPointInOnOutUnionRegionXY(parent: UnionRegion, x: number, y: number): number {\r\n    for (const loop of parent.children) {\r\n      const classify = this.testPointInOnOutRegionXY(loop, x, y);\r\n      if (classify >= 0)\r\n        return classify;\r\n    }\r\n    return -1;\r\n  }\r\n  public static testPointInOnOutRegionXY(parent: AnyRegion, x: number, y: number): number {\r\n    if (parent instanceof Loop)\r\n      return this.testPointInOnOutLoopXY(parent, x, y);\r\n    else if (parent instanceof ParityRegion)\r\n      return this.testPointInOnOutParityRegionXY(parent, x, y);\r\n    else if (parent instanceof UnionRegion)\r\n      return this.testPointInOnOutUnionRegionXY(parent, x, y);\r\n    return -1;\r\n  }\r\n\r\n}\r\n"]}
+{"version":3,"file":"InOutTests.js","sourceRoot":"","sources":["../../../../src/curve/Query/InOutTests.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,4BAA4B,EAAE,MAAM,+CAA+C,CAAC;AAC7F,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAE3D,OAAO,EAAE,iBAAiB,EAAuB,MAAM,wBAAwB,CAAC;AAChF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE7C;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IAC9B;;;;;;;;;;OAUG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAU,EAAE,CAAS,EAAE,CAAS;QACnE,IAAI,KAAmC,CAAC;QACxC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,KAAK,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,GAAG,EAAE,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE;YAC1F,KAAK,GAAG,4BAA4B,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAE,CAAC;YACxF,MAAM,MAAM,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;YACpC,MAAM,aAAa,GAA0B,EAAE,CAAC;YAChD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAC9B,IAAI,EAAE,YAAY,cAAc;oBAC9B,EAAE,CAAC,6BAA6B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;aAC1D;YACD,cAAc,CAAC,sBAAsB,CAAC,aAAa,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAClE,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,IAAI,EAAE,EAAE,EAAE,CAAC;YACX,4CAA4C;YAC5C,oDAAoD;YACpD,kEAAkE;YAClE,sEAAsE;YACtE,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE;gBACxC,IAAI,YAAY,CAAC,YAAY,KAAK,iBAAiB,CAAC,QAAQ;uBACvD,YAAY,CAAC,YAAY,KAAK,SAAS,EAAE;oBAC5C,SAAS,EAAE,CAAC;iBACb;gBACD,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC9B,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC9B,IAAI,QAAQ,CAAC,kBAAkB,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;oBAC3C,OAAO,CAAC,CAAC;gBACX,MAAM,KAAK,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBACpE,IAAI,EAAE,CAAC,eAAe,CAAC,YAAY,CAAC,KAAK,CAAC;oBACxC,OAAO,CAAC,CAAC;gBACX,IAAI,KAAK,GAAG,GAAG;oBACb,OAAO,EAAE,CAAC;qBACP,IAAI,KAAK,GAAG,GAAG;oBAClB,QAAQ,EAAE,CAAC;aACd;YACD,IAAI,SAAS,KAAK,CAAC,EAAE,uBAAuB;gBAC1C,SAAS;YACX,MAAM,UAAU,GAAG,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,WAAW,GAAG,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,UAAU,KAAK,WAAW;gBAC5B,OAAO,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACpC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,8BAA8B,CAAC,MAAoB,EAAE,CAAS,EAAE,CAAS;QACrF,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,QAAQ,EAAE;YAClC,IAAI,IAAI,YAAY,IAAI,EAAE;gBACxB,MAAM,CAAC,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC;oBACT,OAAO,CAAC,CAAC;gBACX,IAAI,CAAC,GAAG,CAAC;oBACP,MAAM,GAAG,CAAE,MAAM,CAAC;aACrB;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,MAAM,CAAC,6BAA6B,CAAC,MAAmB,EAAE,CAAS,EAAE,CAAS;QACnF,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,QAAQ,EAAE;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,IAAI,QAAQ,IAAI,CAAC;gBACf,OAAO,QAAQ,CAAC;SACnB;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACM,MAAM,CAAC,wBAAwB,CAAC,MAAiB,EAAE,CAAS,EAAE,CAAS;QAC5E,IAAI,MAAM,YAAY,IAAI;YACxB,OAAO,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;aAC9C,IAAI,MAAM,YAAY,YAAY;YACrC,OAAO,IAAI,CAAC,8BAA8B,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;aACtD,IAAI,MAAM,YAAY,WAAW;YACpC,OAAO,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;CAEF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Angle } from \"../../geometry3d/Angle\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { AnyRegion } from \"../CurveTypes\";\r\nimport { CurveIntervalRole, CurveLocationDetail } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Loop } from \"../Loop\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { UnionRegion } from \"../UnionRegion\";\r\n\r\n/**\r\n * Context for testing containment in Loop, ParityRegion and UnionRegion.\r\n * @internal\r\n */\r\nexport class PointInOnOutContext {\r\n  /**\r\n   * In-out test for a single loop.\r\n   * * Test by finding intersections with an xy line (xyz plane) in \"some\" direction.\r\n   * * Test logic gets complicated if the plane has a vertex hit.\r\n   * * If that happens, don't try to figure out the cases.   Just move on to another plane.\r\n   * * Any \"on\" point triggers immediate 0 return.\r\n   *   * (Hence if there are overlapping lines their self-canceling effect might be wrong.)\r\n   * @param loop\r\n   * @param x tested x coordinate\r\n   * @param y tested y coordinate\r\n   */\r\n  public static testPointInOnOutLoopXY(loop: Loop, x: number, y: number): number {\r\n    let plane: Plane3dByOriginAndUnitNormal;\r\n    const xy = Point3d.create(x, y);\r\n    for (let radians = 0.0; Math.abs(radians) < 6.0; radians = -1.2313 * (radians + 0.3212897)) {\r\n      plane = Plane3dByOriginAndUnitNormal.createXYAngle(x, y, Angle.createRadians(radians))!;\r\n      const normal = plane.getNormalRef();\r\n      const intersections: CurveLocationDetail[] = [];\r\n      for (const cp of loop.children) {\r\n        if (cp instanceof CurvePrimitive)\r\n          cp.appendPlaneIntersectionPoints(plane, intersections);\r\n      }\r\n      CurvePrimitive.snapAndRestrictDetails(intersections, false, true);\r\n      let numLeft = 0;\r\n      let numRight = 0;\r\n      let numTricky = 0;\r\n      let wx, wy;\r\n      // Count simple crossings to left and right.\r\n      // Also count tricky crossings (vertex hits, onEdge)\r\n      // If there are any tricky ones, go around with a different plane.\r\n      // A intently devious tester could make every plane hit tricky things.\r\n      for (const intersection of intersections) {\r\n        if (intersection.intervalRole !== CurveIntervalRole.isolated\r\n          && intersection.intervalRole !== undefined) {\r\n          numTricky++;\r\n        }\r\n        wx = intersection.point.x - x;\r\n        wy = intersection.point.y - y;\r\n        if (Geometry.isSameCoordinateXY(wx, wy, 0, 0))\r\n          return 0;\r\n        const cross = Geometry.crossProductXYXY(normal.x, normal.y, wx, wy);\r\n        if (xy.isAlmostEqualXY(intersection.point))\r\n          return 0;\r\n        if (cross < 0.0)\r\n          numLeft++;\r\n        else if (cross > 0.0)\r\n          numRight++;\r\n      }\r\n      if (numTricky !== 0) // try another angle !!\r\n        continue;\r\n      const leftParity = numLeft & (0x01);\r\n      const rightParity = numRight & (0x01);\r\n      if (leftParity === rightParity)\r\n        return leftParity === 1 ? 1 : -1;\r\n    }\r\n    return -1;\r\n  }\r\n  /**\r\n   * strongly-typed parity region handling: XOR of all loops. (But any ON is returned as edge hit.)\r\n   * @param parent\r\n   * @param x\r\n   * @param y\r\n   */\r\n  public static testPointInOnOutParityRegionXY(parent: ParityRegion, x: number, y: number): number {\r\n    let result = -1;\r\n    for (const loop of parent.children) {\r\n      if (loop instanceof Loop) {\r\n        const q = this.testPointInOnOutLoopXY(loop, x, y);\r\n        if (q === 0)\r\n          return 0;\r\n        if (q > 0)\r\n          result = - result;\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  public static testPointInOnOutUnionRegionXY(parent: UnionRegion, x: number, y: number): number {\r\n    for (const loop of parent.children) {\r\n      const classify = this.testPointInOnOutRegionXY(loop, x, y);\r\n      if (classify >= 0)\r\n        return classify;\r\n    }\r\n    return -1;\r\n  }\r\n  public static testPointInOnOutRegionXY(parent: AnyRegion, x: number, y: number): number {\r\n    if (parent instanceof Loop)\r\n      return this.testPointInOnOutLoopXY(parent, x, y);\r\n    else if (parent instanceof ParityRegion)\r\n      return this.testPointInOnOutParityRegionXY(parent, x, y);\r\n    else if (parent instanceof UnionRegion)\r\n      return this.testPointInOnOutUnionRegionXY(parent, x, y);\r\n    return -1;\r\n  }\r\n\r\n}\r\n"]}

package/lib/esm/curve/Query/StrokeCountChain.d.ts

@@ -2,7 +2,7 @@
  * @module Curve
  */
 import { Range1d } from "../../geometry3d/Range";
-import { AnyCurve } from "../CurveChain";
+import { AnyCurve } from "../CurveTypes";
 import { CurveChain, CurveCollection } from "../CurveCollection";
 import { LineString3d } from "../LineString3d";
 import { StrokeOptions } from "../StrokeOptions";