@itwin/core-geometry 5.0.0-dev.40 → 5.0.0-dev.49

package/lib/esm/topology/HalfEdgeGraphFromIndexedLoopsContext.d.ts

@@ -29,7 +29,7 @@ export declare class HalfEdgeGraphFromIndexedLoopsContext {
      *         * those coordinates and indices will never be referenced again by this construction sequence -- the caller is free to mutate them as needed.
      *   * if [indexB, indexA] appeared previously (and its outer HalfEdge was left "unmatched"),
      *     the "unmatched" HalfEdge is used in the loop being constructed, and its EXTERIOR mask is cleared.
-     * @param indices Array of indices around the edge.  This is accessed cyclically, so first and last indices should be different.
+     * @param indices Array of indices around the loop.  This is accessed cyclically, so first and last indices should be different.
      * @param announceMatedHalfEdges optional function to be called as mated pairs are created. At the call,
      *     the given HalfEdge and its mate will have a pair of successive indices from the array.
      */

package/lib/esm/topology/HalfEdgeGraphFromIndexedLoopsContext.js

@@ -36,7 +36,7 @@ export class HalfEdgeGraphFromIndexedLoopsContext {
      *         * those coordinates and indices will never be referenced again by this construction sequence -- the caller is free to mutate them as needed.
      *   * if [indexB, indexA] appeared previously (and its outer HalfEdge was left "unmatched"),
      *     the "unmatched" HalfEdge is used in the loop being constructed, and its EXTERIOR mask is cleared.
-     * @param indices Array of indices around the edge.  This is accessed cyclically, so first and last indices should be different.
+     * @param indices Array of indices around the loop.  This is accessed cyclically, so first and last indices should be different.
      * @param announceMatedHalfEdges optional function to be called as mated pairs are created. At the call,
      *     the given HalfEdge and its mate will have a pair of successive indices from the array.
      */

package/lib/esm/topology/HalfEdgeGraphFromIndexedLoopsContext.js.map

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgeGraphFromIndexedLoopsContext.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphFromIndexedLoopsContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAEhE;;GAEG;AAEH;;;;;;;GAOG;AACH,MAAM,OAAO,oCAAoC;IAC/C;QACE,IAAI,CAAC,eAAe,GAAG,IAAI,GAAG,EAAG,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,aAAa,EAAG,CAAC;QACnC,IAAI,CAAC,2BAA2B,GAAG,EAAE,CAAC;IACxC,CAAC;IAGD,IAAW,KAAK,KAAmB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAA,CAAC;IAI/C,iBAAiB,CAAC,MAAc,EAAE,MAAc;QACtD,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,IAAI,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC;IACrD,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,UAAU,CAAC,OAAiB,EAAE,sBAAqD;QACxF,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,IAAI,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,2BAA2B,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAC,CAAC;gBAC5B,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAE,MAAM,EAAE,MAAM,CAAC,CAAC;gBAC7D,MAAM,6CAA6C,GAAyB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAE,YAAY,CAAC,CAAC;gBACpH,IAAI,6CAA6C,KAAK,SAAS,EAAC,CAAC;oBAC/D,iEAAiE;oBACjE,MAAM,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,uDAAuD;oBACtH,MAAM,qBAAqB,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAE,MAAM,EAAE,MAAM,CAAC,CAAC;oBAC1E,IAAI,sBAAsB,KAAK,SAAS;wBACtC,sBAAsB,CAAE,qBAAqB,CAAC,CAAC;oBACjD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAE,aAAa,EAAE,qBAAqB,CAAC,QAAQ,CAAC,CAAC;oBACzE,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAE,qBAAqB,CAAC,CAAC;oBAC9D,qBAAqB,CAAC,QAAQ,CAAC,OAAO,CAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;gBACjE,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAE,6CAA6C,CAAC,CAAC;oBACtF,6CAA6C,CAAC,SAAS,CAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;gBAClF,CAAC;gBACD,MAAM,GAAG,MAAM,CAAC;YAClB,CAAC;YACD,IAAI,SAAS,GAAG,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,2BAA2B,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9F,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,2BAA2B,EAAC,CAAC;gBACxD,MAAM,SAAS,GAAG,SAAS,CAAC,aAAa,CAAC;gBAC1C,QAAQ,CAAC,KAAK,CAAE,SAAS,EAAE,SAAS,CAAC,CAAC;gBACtC,SAAS,GAAG,SAAS,CAAC;YACxB,CAAC;YACD,OAAO,IAAI,CAAC,2BAA2B,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\n\n/** @packageDocumentation\n * @module Topology\n */\n\n/**\n * Context for building a half edge graph from loops defined only by indices.\n * * Direct use case:\n *   * Create the context.\n *   * Repeatedly call insertLoop(indicesAroundLoop) to announce various loops.\n *   * Finish by accessing the graph property.\n * @internal\n */\nexport class HalfEdgeGraphFromIndexedLoopsContext {\n  public constructor(){\n    this._unmatchedEdges = new Map ();\n    this._graph = new HalfEdgeGraph ();\n    this._halfEdgesAroundCurrentLoop = [];\n  }\n  private _unmatchedEdges: Map<string, HalfEdge>;\n  private _graph: HalfEdgeGraph;\n  public get graph(): HalfEdgeGraph {return this._graph;}\n\n  // for multiple uses by insert loop.\n  private _halfEdgesAroundCurrentLoop: HalfEdge[];\n  private indexPairToString(index0: number, index1: number): string{\n    return `${index0.toString()},${index1.toString()}`;\n  }\n  /** Create a loop with specified indices at its vertices.\n   * * For an edge with index pair [indexA, indexB]:\n   *   * if [indexB, indexA] has never appeared, a HalfEdge mated pair is created.\n   *      * One of that mated pair becomes a HalfEdge in this loop.\n   *      * The other is \"unmatched\" and gets the EXTERIOR mask.\n   *      * When announceMatedHalfEdges(halfEdge) is called:\n   *         * halfEdge and its mate are \"new\"\n   *         * all coordinates are zeros.\n   *         * each contains (as its `i` property) one index of the [indexA,indexB] pair.\n   *         * those coordinates and indices will never be referenced again by this construction sequence -- the caller is free to mutate them as needed.\n   *   * if [indexB, indexA] appeared previously (and its outer HalfEdge was left \"unmatched\"),\n   *     the \"unmatched\" HalfEdge is used in the loop being constructed, and its EXTERIOR mask is cleared.\n   * @param indices Array of indices around the edge.  This is accessed cyclically, so first and last indices should be different.\n   * @param announceMatedHalfEdges optional function to be called as mated pairs are created. At the call,\n   *     the given HalfEdge and its mate will have a pair of successive indices from the array.\n   */\n  public insertLoop(indices: number[], announceMatedHalfEdges?: (halfEdge: HalfEdge) => void): HalfEdge | undefined{\n    const n = indices.length;\n    if (n > 2) {\n      let index0 = indices[indices.length - 1];\n      this._halfEdgesAroundCurrentLoop.length = 0;\n      for (const index1 of indices){\n        const insideString = this.indexPairToString (index0, index1);\n        const halfEdgePreviouslyConstructedFromOppositeSide: HalfEdge | undefined = this._unmatchedEdges.get (insideString);\n        if (halfEdgePreviouslyConstructedFromOppositeSide === undefined){\n          // This is the first appearance of this edge in either direction.\n          const outsideString = this.indexPairToString (index1, index0); // string referencing the \"other\" side of the new edge.\n          const newHalfEdgeAroundLoop = this._graph.createEdgeIdId (index0, index1);\n          if (announceMatedHalfEdges !== undefined)\n            announceMatedHalfEdges (newHalfEdgeAroundLoop);\n          this._unmatchedEdges.set (outsideString, newHalfEdgeAroundLoop.edgeMate);\n          this._halfEdgesAroundCurrentLoop.push (newHalfEdgeAroundLoop);\n          newHalfEdgeAroundLoop.edgeMate.setMask (HalfEdgeMask.EXTERIOR);\n        } else {\n          this._halfEdgesAroundCurrentLoop.push (halfEdgePreviouslyConstructedFromOppositeSide);\n          halfEdgePreviouslyConstructedFromOppositeSide.clearMask (HalfEdgeMask.EXTERIOR);\n        }\n        index0 = index1;\n      }\n      let halfEdgeA = this._halfEdgesAroundCurrentLoop[this._halfEdgesAroundCurrentLoop.length - 1];\n      for (const halfEdgeB of this._halfEdgesAroundCurrentLoop){\n        const halfEdgeC = halfEdgeA.faceSuccessor;\n        HalfEdge.pinch (halfEdgeB, halfEdgeC);\n        halfEdgeA = halfEdgeB;\n      }\n      return this._halfEdgesAroundCurrentLoop[0];\n    }\n    return undefined;\n  }\n}\n"]}
+{"version":3,"file":"HalfEdgeGraphFromIndexedLoopsContext.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphFromIndexedLoopsContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAEhE;;GAEG;AAEH;;;;;;;GAOG;AACH,MAAM,OAAO,oCAAoC;IAC/C;QACE,IAAI,CAAC,eAAe,GAAG,IAAI,GAAG,EAAG,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,aAAa,EAAG,CAAC;QACnC,IAAI,CAAC,2BAA2B,GAAG,EAAE,CAAC;IACxC,CAAC;IAGD,IAAW,KAAK,KAAmB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAA,CAAC;IAI/C,iBAAiB,CAAC,MAAc,EAAE,MAAc;QACtD,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,IAAI,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC;IACrD,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,UAAU,CAAC,OAAiB,EAAE,sBAAqD;QACxF,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,IAAI,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,2BAA2B,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAE,MAAM,EAAE,MAAM,CAAC,CAAC;gBAC7D,MAAM,6CAA6C,GAAyB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAE,YAAY,CAAC,CAAC;gBACpH,IAAI,6CAA6C,KAAK,SAAS,EAAC,CAAC;oBAC/D,iEAAiE;oBACjE,MAAM,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,uDAAuD;oBACtH,MAAM,qBAAqB,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAE,MAAM,EAAE,MAAM,CAAC,CAAC;oBAC1E,IAAI,sBAAsB,KAAK,SAAS;wBACtC,sBAAsB,CAAE,qBAAqB,CAAC,CAAC;oBACjD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAE,aAAa,EAAE,qBAAqB,CAAC,QAAQ,CAAC,CAAC;oBACzE,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAE,qBAAqB,CAAC,CAAC;oBAC9D,qBAAqB,CAAC,QAAQ,CAAC,OAAO,CAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;gBACjE,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAE,6CAA6C,CAAC,CAAC;oBACtF,6CAA6C,CAAC,SAAS,CAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;gBAClF,CAAC;gBACD,MAAM,GAAG,MAAM,CAAC;YAClB,CAAC;YACD,IAAI,SAAS,GAAG,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,2BAA2B,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9F,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,2BAA2B,EAAC,CAAC;gBACxD,MAAM,SAAS,GAAG,SAAS,CAAC,aAAa,CAAC;gBAC1C,QAAQ,CAAC,KAAK,CAAE,SAAS,EAAE,SAAS,CAAC,CAAC;gBACtC,SAAS,GAAG,SAAS,CAAC;YACxB,CAAC;YACD,OAAO,IAAI,CAAC,2BAA2B,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\n\n/** @packageDocumentation\n * @module Topology\n */\n\n/**\n * Context for building a half edge graph from loops defined only by indices.\n * * Direct use case:\n *   * Create the context.\n *   * Repeatedly call insertLoop(indicesAroundLoop) to announce various loops.\n *   * Finish by accessing the graph property.\n * @internal\n */\nexport class HalfEdgeGraphFromIndexedLoopsContext {\n  public constructor(){\n    this._unmatchedEdges = new Map ();\n    this._graph = new HalfEdgeGraph ();\n    this._halfEdgesAroundCurrentLoop = [];\n  }\n  private _unmatchedEdges: Map<string, HalfEdge>;\n  private _graph: HalfEdgeGraph;\n  public get graph(): HalfEdgeGraph {return this._graph;}\n\n  // for multiple uses by insert loop.\n  private _halfEdgesAroundCurrentLoop: HalfEdge[];\n  private indexPairToString(index0: number, index1: number): string{\n    return `${index0.toString()},${index1.toString()}`;\n  }\n  /** Create a loop with specified indices at its vertices.\n   * * For an edge with index pair [indexA, indexB]:\n   *   * if [indexB, indexA] has never appeared, a HalfEdge mated pair is created.\n   *      * One of that mated pair becomes a HalfEdge in this loop.\n   *      * The other is \"unmatched\" and gets the EXTERIOR mask.\n   *      * When announceMatedHalfEdges(halfEdge) is called:\n   *         * halfEdge and its mate are \"new\"\n   *         * all coordinates are zeros.\n   *         * each contains (as its `i` property) one index of the [indexA,indexB] pair.\n   *         * those coordinates and indices will never be referenced again by this construction sequence -- the caller is free to mutate them as needed.\n   *   * if [indexB, indexA] appeared previously (and its outer HalfEdge was left \"unmatched\"),\n   *     the \"unmatched\" HalfEdge is used in the loop being constructed, and its EXTERIOR mask is cleared.\n   * @param indices Array of indices around the loop.  This is accessed cyclically, so first and last indices should be different.\n   * @param announceMatedHalfEdges optional function to be called as mated pairs are created. At the call,\n   *     the given HalfEdge and its mate will have a pair of successive indices from the array.\n   */\n  public insertLoop(indices: number[], announceMatedHalfEdges?: (halfEdge: HalfEdge) => void): HalfEdge | undefined{\n    const n = indices.length;\n    if (n > 2) {\n      let index0 = indices[indices.length - 1];\n      this._halfEdgesAroundCurrentLoop.length = 0;\n      for (const index1 of indices) {\n        const insideString = this.indexPairToString (index0, index1);\n        const halfEdgePreviouslyConstructedFromOppositeSide: HalfEdge | undefined = this._unmatchedEdges.get (insideString);\n        if (halfEdgePreviouslyConstructedFromOppositeSide === undefined){\n          // This is the first appearance of this edge in either direction.\n          const outsideString = this.indexPairToString (index1, index0); // string referencing the \"other\" side of the new edge.\n          const newHalfEdgeAroundLoop = this._graph.createEdgeIdId (index0, index1);\n          if (announceMatedHalfEdges !== undefined)\n            announceMatedHalfEdges (newHalfEdgeAroundLoop);\n          this._unmatchedEdges.set (outsideString, newHalfEdgeAroundLoop.edgeMate);\n          this._halfEdgesAroundCurrentLoop.push (newHalfEdgeAroundLoop);\n          newHalfEdgeAroundLoop.edgeMate.setMask (HalfEdgeMask.EXTERIOR);\n        } else {\n          this._halfEdgesAroundCurrentLoop.push (halfEdgePreviouslyConstructedFromOppositeSide);\n          halfEdgePreviouslyConstructedFromOppositeSide.clearMask (HalfEdgeMask.EXTERIOR);\n        }\n        index0 = index1;\n      }\n      let halfEdgeA = this._halfEdgesAroundCurrentLoop[this._halfEdgesAroundCurrentLoop.length - 1];\n      for (const halfEdgeB of this._halfEdgesAroundCurrentLoop){\n        const halfEdgeC = halfEdgeA.faceSuccessor;\n        HalfEdge.pinch (halfEdgeB, halfEdgeC);\n        halfEdgeA = halfEdgeB;\n      }\n      return this._halfEdgesAroundCurrentLoop[0];\n    }\n    return undefined;\n  }\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@itwin/core-geometry",
-  "version": "5.0.0-dev.40",
+  "version": "5.0.0-dev.49",
   "description": "iTwin.js Core Geometry library",
   "main": "lib/cjs/core-geometry.js",
   "module": "lib/esm/core-geometry.js",
@@ -25,17 +25,17 @@
   "devDependencies": {
     "@itwin/eslint-plugin": "5.0.0-dev.1",
     "@types/flatbuffers": "~1.10.0",
-    "@types/node": "~20.9.5",
+    "@types/node": "~20.17.0",
     "@vitest/coverage-v8": "^2.1.0",
     "eslint": "^9.13.0",
     "rimraf": "^3.0.2",
     "typescript": "~5.6.2",
     "vitest": "^2.1.0",
-    "@itwin/build-tools": "5.0.0-dev.40"
+    "@itwin/build-tools": "5.0.0-dev.49"
   },
   "dependencies": {
     "flatbuffers": "~1.12.0",
-    "@itwin/core-bentley": "5.0.0-dev.40"
+    "@itwin/core-bentley": "5.0.0-dev.49"
   },
   "scripts": {
     "build": "npm run -s build:cjs && npm run -s build:esm",