@itwin/core-geometry 4.4.0-dev.2 → 4.4.0-dev.20

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

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgeGraphSearch.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphSearch.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAY,aAAa,EAAE,YAAY,EAAmD,MAAM,SAAS,CAAC;AACjH,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAQhE;GACG;AACH,MAAM,OAAO,kBAAkB;IAG7B;;;;OAIG;IACH,YAAmB,IAAkB,EAAE,cAAuB,IAAI;QAChE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IACD,yEAAyE;IAClE,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC,YAAY,CAAC;IAChE,CAAC;CAEF;AACD,oCAAoC;AACpC,MAAM,OAAO,mBAAmB;IAE9B;;;OAGG;IACK,MAAM,CAAC,yBAAyB,CAAC,QAAkB,EAAE,IAAY,EAAE,YAAwB,EAAE,eAA2B;QAC9H,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,QAAQ,CAAC,iBAAiB,CAAC,CAAC,IAAc,EAAE,EAAE;YAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,uBAAmD,EAAE,gBAAuC;QAC5H,MAAM,OAAO,GAAG,mBAAmB,CAAC,sBAAsB,CAAC,uBAAuB,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;QAC7G,OAAO,OAAO,CAAC,mBAAmB,CAAC;IACrC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,cAAc,CAAC,IAAc,IAAY,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IACtF;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAkC,EAAE,kBAA2B,KAAK,EACvG,eAAqC,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC;QACvF,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAW,eAAe,CAAC,CAAC;QAChE,IAAI,QAAoB,CAAC;QAEzB,IAAI,MAAM,YAAY,aAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACjC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAAkC,EAAE,iCAA0C,IAAI,EAAE,4BAA4B,GAAG,CAAC;QAClJ,IAAI,QAAoB,CAAC;QAEzB,IAAI,MAAM,YAAY,aAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC7C,IAAI,QAAQ,IAAI,CAAC,EAAE;gBACjB,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;gBACnC,IAAI,IAAI,GAAG,CAAC,EAAE;oBACZ,IAAI,QAAQ,GAAG,CAAC,EAAE;wBAChB,qBAAqB,EAAE,CAAC;wBACxB,IAAI,qBAAqB,GAAG,4BAA4B;4BACtD,OAAO,KAAK,CAAC;qBAChB;iBACF;qBAAM;oBACL,WAAW,EAAE,CAAC;oBACd,IAAI,WAAW,GAAG,CAAC,EAAE;wBACnB,IAAI,CAAC,8BAA8B;4BACjC,OAAO,KAAK,CAAC;qBAChB;iBACF;aACF;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;OAUG;IACK,MAAM,CAAC,mBAAmB,CAAC,QAAkB,EAAE,SAAuB,EAAE,gBAAgD,EAAE,UAAwB;QACxJ,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,QAAQ;QAEzD,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,gFAAgF;QAChF,mBAAmB,CAAC,yBAAyB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAE,8BAA8B;QAChH,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC;YACxB,IAAI,CAAC,IAAI;gBACP,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;gBAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;gBACvC,IAAI,CAAC,gBAAgB,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACnD,QAAQ,GAAG,CAAC,QAAQ,CAAC;gBACvB,mBAAmB,CAAC,yBAAyB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;aACpG;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,MAAqB,EAAE,IAAkB,EAAE,KAAiB;QACxG,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACxE,IAAI,CAAC,gBAAgB,EAAE;SACtB;aAAM,IAAI,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;YAC3C,uCAAuC;SACxC;aAAM;YACL,qEAAqE;YACrE,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE;gBAC5B,IAAI,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;oBAC5B,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;iBACpC;qBAAM;oBACL,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;iBAClC;aACF;SACF;IACH,CAAC;IACD,0GAA0G;IAClG,MAAM,CAAC,8BAA8B,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB;QAC9G,IAAI,IAAI,KAAK,YAAY,CAAC,SAAS;YACjC,OAAO;QACT,KAAK,MAAM,gBAAgB,IAAI,UAAU;YACvC,mBAAmB,CAAC,8BAA8B,CAAC,KAAK,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;IACtF,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iDAAiD,CAAC,KAAoB,EAAE,gBAAgD,EAAE,aAA2B,YAAY,CAAC,SAAS;QACvL,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC;QACvC,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC1B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,YAAY,EAAE;YACzC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE;gBAC7C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;gBAC5G,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aAC3B;SACF;QACD,mBAAmB,CAAC,8BAA8B,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClF,OAAO,UAAU,CAAC;IACpB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,QAAkB,EAAE,CAAS,EAAE,CAAS;QACtE,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,yFAAyF;QACzF,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,GAAG,QAAQ,CAAC,aAAa,CAAC;QACnC,QAAS,KAAK,GAAG,KAAK,EAAE;YACtB,IAAI,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC1D,MAAM;YACR,IAAI,KAAK,KAAK,QAAQ,EAAE;gBACtB,uCAAuC;gBACvC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;SAC7B;QAED,sFAAsF;QACtF,kDAAkD;QAClD,IAAI,IAAI,GAAG,KAAK,CAAC,aAAa,CAAC;QAC/B,SAAU;YACR,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE;gBACpC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,IAAI,IAAI,KAAK,KAAK;gBAChB,MAAM;YACR,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC;SAC3B;QACD,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IAClC,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,mCAAmC,CAAC,IAAc,EAAE,SAAuB,EAAE,cAAyC,EAClI,YAAuD;QACvD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;YACvD,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACxB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC;YACtC,IAAI,qBAAqB,GAAG,UAAU,CAAC;YACvC,SAAU;gBACR,IAAI,qBAAqB,CAAC,OAAO,CAAC,SAAS,CAAC;oBAC1C,OAAO;gBACT,IAAI,cAAc,CAAC,qBAAqB,CAAC,EAAE;oBACzC,IAAI,GAAG,qBAAqB,CAAC;oBAC7B,MAAM;iBACP;gBACD,qBAAqB,GAAG,qBAAqB,CAAC,iBAAiB,CAAC;gBAChE,IAAI,qBAAqB,KAAK,UAAU;oBACtC,MAAM;aACT;SACF;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,mCAAmC,CAAC,KAAoB,EAAE,YAA0B;QAChG,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,cAAc,GAAG,CAAC,IAAc,EAAW,EAAE;YACjD,OAAO,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACvF,CAAC,CAAC;QACF,MAAM,sBAAsB,GAAG,CAAC,IAAc,EAAE,OAAe,EAAE,EAAE;YACjE,IAAI,OAAO,KAAK,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,mCAAmC,CAAC,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,sBAAsB,CAAC,CAAC;SACnG;QACD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC1B,OAAO,KAAK,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\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, HalfEdgeToBooleanFunction, NodeToNumberFunction } from \"./Graph\";\r\nimport { SignedDataSummary } from \"./SignedDataSummary\";\r\nimport { XYParitySearchContext } from \"./XYParitySearchContext\";\r\n\r\n/**\r\n * Interface for an object that executes boolean tests on edges.\r\n */\r\nexport interface HalfEdgeTestObject {\r\n  testEdge(h: HalfEdge): boolean;\r\n}\r\n/**\r\n */\r\nexport class HalfEdgeMaskTester {\r\n  private _targetMask: HalfEdgeMask;\r\n  private _targetValue: boolean;\r\n  /**\r\n   *\r\n   * @param mask mask to test in `testEdge` function\r\n   * @param targetValue value to match for true return\r\n   */\r\n  public constructor(mask: HalfEdgeMask, targetValue: boolean = true) {\r\n    this._targetMask = mask;\r\n    this._targetValue = targetValue;\r\n  }\r\n  /** Return true if the value of the targetMask matches the targetValue */\r\n  public testEdge(edge: HalfEdge): boolean {\r\n    return edge.isMaskSet(this._targetMask) === this._targetValue;\r\n  }\r\n\r\n}\r\n// Search services for HalfEdgeGraph\r\nexport class HalfEdgeGraphSearch {\r\n\r\n  /**\r\n   * * for each node of face, set the mask push to allNodesStack\r\n   * * push the faceSeed on onePerFaceStack[]\r\n   */\r\n  private static pushAndMaskAllNodesInFace(faceSeed: HalfEdge, mask: number, allNodeStack: HalfEdge[], onePerFaceStack: HalfEdge[]) {\r\n    onePerFaceStack.push(faceSeed);\r\n    faceSeed.collectAroundFace((node: HalfEdge) => {\r\n      node.setMask(mask);\r\n      allNodeStack.push(node);\r\n    });\r\n  }\r\n\r\n  /**\r\n   * Search an array of faceSeed nodes for the face with the most negative area.\r\n   * @param oneCandidateNodePerFace array containing one node from each face to be considered.\r\n   * @returns node on the minimum area face, or undefined if no such face (e.g., all faces have zero area).\r\n   */\r\n  public static findMinimumAreaFace(oneCandidateNodePerFace: HalfEdgeGraph | HalfEdge[], faceAreaFunction?: NodeToNumberFunction): HalfEdge | undefined {\r\n    const summary = HalfEdgeGraphSearch.collectFaceAreaSummary(oneCandidateNodePerFace, false, faceAreaFunction);\r\n    return summary.largestNegativeItem;\r\n  }\r\n\r\n  /**\r\n   * static method for face area computation -- useful as function parameter in collect FaceAreaSummary.\r\n   * * This simply calls `node.signedFaceArea ()`\r\n   * @param node instance for signedFaceArea call.\r\n   */\r\n  public static signedFaceArea(node: HalfEdge): number { return node.signedFaceArea(); }\r\n  /**\r\n   *\r\n   * Return a summary structure data about face (or other numeric quantity if the caller's areaFunction returns other value)\r\n   * * The default areaFunction computes area of polygonal face.\r\n   * * Callers with curved edge graphs must supply their own area function.\r\n   * @param source graph or array of nodes to examine\r\n   * @param collectAllNodes flag to pass to the SignedDataSummary constructor to control collection of nodes.\r\n   * @param areaFunction function to all to obtain area (or other numeric value)\r\n   */\r\n  public static collectFaceAreaSummary(source: HalfEdgeGraph | HalfEdge[], collectAllNodes: boolean = false,\r\n    areaFunction: NodeToNumberFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node)): SignedDataSummary<HalfEdge> {\r\n    const result = new SignedDataSummary<HalfEdge>(collectAllNodes);\r\n    let allFaces: HalfEdge[];\r\n\r\n    if (source instanceof HalfEdgeGraph)\r\n      allFaces = source.collectFaceLoops();\r\n    else\r\n      allFaces = source;\r\n\r\n    for (const node of allFaces) {\r\n      const area = areaFunction(node);\r\n      result.announceItem(node, area);\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * * Test if the graph is triangulated.\r\n   * * Return false if:\r\n   *   * Positive area face with more than 3 edges\r\n   *   * more than 1 negative area face with `allowMultipleNegativeAreaFaces` false\r\n   * * 2-edge faces are ignored.\r\n   */\r\n  public static isTriangulatedCCW(source: HalfEdgeGraph | HalfEdge[], allowMultipleNegativeAreaFaces: boolean = true, numPositiveExceptionsAllowed = 0): boolean {\r\n    let allFaces: HalfEdge[];\r\n\r\n    if (source instanceof HalfEdgeGraph)\r\n      allFaces = source.collectFaceLoops();\r\n    else\r\n      allFaces = source;\r\n    let numNegative = 0;\r\n    let numPositiveExceptions = 0;\r\n    for (const node of allFaces) {\r\n      const numEdges = node.countEdgesAroundFace();\r\n      if (numEdges >= 3) {\r\n        const area = node.signedFaceArea();\r\n        if (area > 0) {\r\n          if (numEdges > 3) {\r\n            numPositiveExceptions++;\r\n            if (numPositiveExceptions > numPositiveExceptionsAllowed)\r\n              return false;\r\n          }\r\n        } else {\r\n          numNegative++;\r\n          if (numNegative > 1) {\r\n            if (!allowMultipleNegativeAreaFaces)\r\n              return false;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Search to all accessible faces from given seed.\r\n   * * The returned array contains one representative node in each face of the connected component.\r\n   * * If (nonnull) parity mask is given, on return:\r\n   *    * It is entirely set or entirely clear around each face\r\n   *    * It is entirely set on all faces that are an even number of face-to-face steps away from the seed.\r\n   *    * It is entirely clear on all faces that are an odd number of face-to-face steps away from the seed.\r\n   * @param seedEdge first edge to search.\r\n   * @param visitMask mask applied to all faces as visited.\r\n   * @param parityMask mask to apply (a) to first face, (b) to faces with alternating parity during the search.\r\n   */\r\n  private static parityFloodFromSeed(seedEdge: HalfEdge, visitMask: HalfEdgeMask, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask: HalfEdgeMask): HalfEdge[] {\r\n    const faces: HalfEdge[] = [];\r\n    if (seedEdge.isMaskSet(visitMask)) return faces; // empty\r\n\r\n    const allMasks = parityMask | visitMask;\r\n    const stack: HalfEdge[] = [];\r\n    // arbitrarily call the seed face exterior ... others will alternate as visited.\r\n    HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(seedEdge, allMasks, stack, faces);  // Start with exterior as mask\r\n    while (stack.length > 0) {\r\n      const p = stack.pop()!;\r\n      const mate = p.edgeMate;\r\n      if (!mate)\r\n        continue;\r\n      if (!mate.isMaskSet(visitMask)) {\r\n        let newState = p.isMaskSet(parityMask);\r\n        if (!parityEdgeTester || parityEdgeTester.testEdge(p))\r\n          newState = !newState;\r\n        HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(mate, newState ? allMasks : visitMask, stack, faces);\r\n      }\r\n    }\r\n    return faces;\r\n  }\r\n  /**\r\n   * * Search the given faces for the one with the minimum area.\r\n   * * If the mask in that face is OFF, toggle it on (all half edges of) all the faces.\r\n   * * In a properly merged planar subdivision there should be only one true negative area face per component.\r\n   * @param graph parent graph\r\n   * @param parityMask mask which was previously set with alternating parity, but with an arbitrary start face.\r\n   * @param faces array of faces to search.\r\n   */\r\n  private static correctParityInSingleComponent(_graph: HalfEdgeGraph, mask: HalfEdgeMask, faces: HalfEdge[]) {\r\n    const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(faces);\r\n    if (!exteriorHalfEdge) {\r\n    } else if (exteriorHalfEdge.isMaskSet(mask)) {\r\n      // all should be well .. nothing to do.\r\n    } else {\r\n      // TOGGLE around the face (assuming all are consistent with the seed)\r\n      for (const faceSeed of faces) {\r\n        if (faceSeed.isMaskSet(mask)) {\r\n          faceSeed.clearMaskAroundFace(mask);\r\n        } else {\r\n          faceSeed.setMaskAroundFace(mask);\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /** Apply correctParityInSingleComponent to each array in components. (Quick exit if mask in NULL_MASK) */\r\n  private static correctParityInComponentArrays(graph: HalfEdgeGraph, mask: HalfEdgeMask, components: HalfEdge[][]) {\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return;\r\n    for (const facesInComponent of components)\r\n      HalfEdgeGraphSearch.correctParityInSingleComponent(graph, mask, facesInComponent);\r\n  }\r\n  /**\r\n   * Collect arrays gathering faces by connected component.\r\n   * @param graph graph to inspect\r\n   * @param parityEdgeTester (optional) function to test if an edge is a parity change (e.g., a boundary edge).\r\n   * @param parityMask (optional, along with parityEdgeTester) mask to apply indicating parity.  If this is Mask.NULL_MASK, there is no record of parity.\r\n   */\r\n  public static collectConnectedComponentsWithExteriorParityMasks(graph: HalfEdgeGraph, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask: HalfEdgeMask = HalfEdgeMask.NULL_MASK): HalfEdge[][] {\r\n    const components = [];\r\n    const visitMask = HalfEdgeMask.VISITED;\r\n    const allMasks = parityMask | visitMask;\r\n    graph.clearMask(allMasks);\r\n    for (const faceSeed of graph.allHalfEdges) {\r\n      if (!faceSeed.isMaskSet(HalfEdgeMask.VISITED)) {\r\n        const newFaces = HalfEdgeGraphSearch.parityFloodFromSeed(faceSeed, visitMask, parityEdgeTester, parityMask);\r\n        components.push(newFaces);\r\n      }\r\n    }\r\n    HalfEdgeGraphSearch.correctParityInComponentArrays(graph, parityMask, components);\r\n    return components;\r\n  }\r\n  /**\r\n   * Test if (x,y) is inside (1), on an edge (0) or outside (-1) a face.\r\n   * @param seedNode any node on the face loop\r\n   * @param x x coordinate of test point.\r\n   * @param y y coordinate of test point.\r\n   */\r\n  public static pointInOrOnFaceXY(seedNode: HalfEdge, x: number, y: number): number | undefined {\r\n    const context = new XYParitySearchContext(x, y);\r\n    // walk around looking for an accepted node to start the search (seedNode is usually ok!)\r\n    let nodeA = seedNode;\r\n    let nodeB = seedNode.faceSuccessor;\r\n    for (; ; nodeA = nodeB) {\r\n      if (context.tryStartEdge(nodeA.x, nodeA.y, nodeB.x, nodeB.y))\r\n        break;\r\n      if (nodeB === seedNode) {\r\n        // umm.. the face is all on the x axis?\r\n        return context.classifyCounts();\r\n      }\r\n      nodeB = nodeA.faceSuccessor;\r\n    }\r\n\r\n    // nodeB is the real start node for search ... emit ends of each edge around the face,\r\n    //   stopping after emitting nodeB as an edge end.\r\n    let node = nodeB.faceSuccessor;\r\n    for (; ;) {\r\n      if (!context.advance(node.x, node.y)) {\r\n        return context.classifyCounts();\r\n      }\r\n      if (node === nodeB)\r\n        break;\r\n      node = node.faceSuccessor;\r\n    }\r\n    return context.classifyCounts();\r\n  }\r\n  /**\r\n   * Announce nodes that are \"extended face boundary\" by conditions (usually mask of node and mate) in test functions.\r\n   * * After each node, the next candidate in reached by looking \"around the head vertex loop\" for the next boundary.\r\n   *   * \"Around the vertex\" from nodeA means\r\n   *      * First look at nodeA.faceSuccessor;\r\n   *      * Then look at vertexPredecessor around that vertex loop.\r\n   * * Each accepted node is passed to announceNode, and marked with the visit mask.\r\n   * * The counter of the announceEdge function is zero for the first edge, then increases with each edge.\r\n   * @param seed start node.\r\n   * @param isBoundaryEdge\r\n   * @param announceEdge\r\n   */\r\n  public static collectExtendedBoundaryLoopFromSeed(seed: HalfEdge, visitMask: HalfEdgeMask, isBoundaryEdge: HalfEdgeToBooleanFunction,\r\n    announceEdge: (edge: HalfEdge, counter: number) => void) {\r\n    let counter = 0;\r\n    while (!seed.getMask(visitMask) && isBoundaryEdge(seed)) {\r\n      announceEdge(seed, counter++);\r\n      seed.setMask(visitMask);\r\n      const vertexBase = seed.faceSuccessor;\r\n      let candidateAroundVertex = vertexBase;\r\n      for (; ;) {\r\n        if (candidateAroundVertex.getMask(visitMask))\r\n          return;\r\n        if (isBoundaryEdge(candidateAroundVertex)) {\r\n          seed = candidateAroundVertex;\r\n          break;\r\n        }\r\n        candidateAroundVertex = candidateAroundVertex.vertexPredecessor;\r\n        if (candidateAroundVertex === vertexBase)\r\n          break;\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Collect arrays of nodes \"around the boundary\" of a graph with extraneous (non-boundary) edges.\r\n   * * The \"boundary\" is nodes that do NOT have the exterior mask, but whose mates DO have the exterior mask.\r\n   * * After each node, the next candidate in reached by looking \"around the head vertex loop\" for the next boundary.\r\n   *   * \"Around the vertex\" from nodeA means\r\n   *      * First look at nodeA.faceSuccessor;\r\n   *      * Then look at vertexPredecessor around that vertex loop.\r\n   * * Each accepted node is passed to announceNode, and marked with the visit mask.\r\n   * @param seed start node.\r\n   * @param isBoundaryNode\r\n   * @param announceNode\r\n   */\r\n  public static collectExtendedBoundaryLoopsInGraph(graph: HalfEdgeGraph, exteriorMask: HalfEdgeMask): HalfEdge[][] {\r\n    const loops: HalfEdge[][] = [];\r\n    const visitMask = graph.grabMask(true);\r\n    const isBoundaryEdge = (edge: HalfEdge): boolean => {\r\n      return edge.getMask(exteriorMask) === 0 && edge.edgeMate.getMask(exteriorMask) !== 0;\r\n    };\r\n    const announceEdgeInBoundary = (edge: HalfEdge, counter: number) => {\r\n      if (counter === 0)\r\n        loops.push([]);\r\n      loops[loops.length - 1].push(edge);\r\n    };\r\n    for (const seed of graph.allHalfEdges) {\r\n      this.collectExtendedBoundaryLoopFromSeed(seed, visitMask, isBoundaryEdge, announceEdgeInBoundary);\r\n    }\r\n    graph.dropMask(visitMask);\r\n    return loops;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"HalfEdgeGraphSearch.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphSearch.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAY,aAAa,EAAE,YAAY,EAAmD,MAAM,SAAS,CAAC;AACjH,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAQhE,6CAA6C;AAC7C,MAAM,OAAO,kBAAkB;IAG7B;;;;OAIG;IACH,YAAmB,IAAkB,EAAE,cAAuB,IAAI;QAChE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IACD,0EAA0E;IACnE,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC,YAAY,CAAC;IAChE,CAAC;CACF;AACD,+DAA+D;AAC/D,MAAM,OAAO,mBAAmB;IAC9B;;;;OAIG;IACI,MAAM,CAAC,cAAc,CAAC,IAAc;QACzC,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC;IAC/B,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAkC,EAClC,kBAA2B,KAAK,EAChC,eAAqC,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC;QAEvF,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAW,eAAe,CAAC,CAAC;QAChE,IAAI,QAAoB,CAAC;QACzB,IAAI,MAAM,YAAY,aAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACjC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAC/B,uBAAmD,EAAE,gBAAuC;QAE5F,MAAM,OAAO,GAAG,mBAAmB,CAAC,sBAAsB,CAAC,uBAAuB,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;QAC7G,OAAO,OAAO,CAAC,mBAAmB,CAAC;IACrC,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAC7B,MAAkC,EAClC,iCAA0C,IAAI,EAC9C,+BAAuC,CAAC;QAExC,IAAI,QAAoB,CAAC;QACzB,IAAI,MAAM,YAAY,aAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC7C,IAAI,QAAQ,IAAI,CAAC,EAAE;gBACjB,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;gBACnC,IAAI,IAAI,GAAG,CAAC,EAAE;oBACZ,IAAI,QAAQ,GAAG,CAAC,EAAE;wBAChB,qBAAqB,EAAE,CAAC;wBACxB,IAAI,qBAAqB,GAAG,4BAA4B;4BACtD,OAAO,KAAK,CAAC;qBAChB;iBACF;qBAAM;oBACL,WAAW,EAAE,CAAC;oBACd,IAAI,WAAW,GAAG,CAAC,EAAE;wBACnB,IAAI,CAAC,8BAA8B;4BACjC,OAAO,KAAK,CAAC;qBAChB;iBACF;aACF;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;OAMG;IACK,MAAM,CAAC,yBAAyB,CACtC,QAAkB,EAAE,IAAY,EAAE,YAAwB,EAAE,eAA2B;QAEvF,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,QAAQ,CAAC,iBAAiB,CAAC,CAAC,IAAc,EAAE,EAAE;YAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IACD;;;;;;;;;;;;;OAaG;IACK,MAAM,CAAC,mBAAmB,CAChC,QAAkB,EAClB,SAAuB,EACvB,gBAAgD,EAChD,UAAwB;QAExB,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;YAC/B,OAAO,KAAK,CAAC,CAAC,cAAc;QAC9B,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,wDAAwD;QACxD,mBAAmB,CAAC,yBAAyB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAChF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC;YACxB,IAAI,CAAC,IAAI;gBACP,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;gBAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;gBACvC,IAAI,CAAC,gBAAgB,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACnD,QAAQ,GAAG,CAAC,QAAQ,CAAC;gBACvB,mBAAmB,CAAC,yBAAyB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;aACpG;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;OASG;IACK,MAAM,CAAC,8BAA8B,CAAC,UAAwB,EAAE,KAAiB;QACvF,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACxE,IAAI,CAAC,gBAAgB,EAAE;YACrB,6CAA6C;SAC9C;aAAM,IAAI,gBAAgB,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE;YACjD,oCAAoC;SACrC;aAAM;YACL,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE;gBAC5B,IAAI,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE;oBAClC,QAAQ,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;iBAC1C;qBAAM;oBACL,QAAQ,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;iBACxC;aACF;SACF;IACH,CAAC;IACD,sHAAsH;IAC9G,MAAM,CAAC,8BAA8B,CAAC,UAAwB,EAAE,UAAwB;QAC9F,IAAI,UAAU,KAAK,YAAY,CAAC,SAAS;YACvC,OAAO;QACT,KAAK,MAAM,gBAAgB,IAAI,UAAU;YACvC,mBAAmB,CAAC,8BAA8B,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,iDAAiD,CAC7D,KAAoB,EACpB,gBAAgD,EAChD,aAA2B,YAAY,CAAC,SAAS;QAEjD,+EAA+E;QAC/E,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC;QACvC,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC1B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,YAAY,EAAE;YACzC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;gBAClC,MAAM,QAAQ,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;gBAC5G,mGAAmG;gBACnG,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aAC3B;SACF;QACD,mBAAmB,CAAC,8BAA8B,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;QAC3E,OAAO,UAAU,CAAC;IACpB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,QAAkB,EAAE,KAAa,EAAE,KAAa;QAC9E,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxD,wFAAwF;QACxF,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,GAAG,QAAQ,CAAC,aAAa,CAAC;QACnC,QAAS,KAAK,GAAG,KAAK,EAAE;YACtB,IAAI,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC1D,MAAM;YACR,IAAI,KAAK,KAAK,QAAQ,EAAE;gBACtB,0DAA0D;gBAC1D,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;gBAC/D,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACxC;YACD,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;SAC7B;QACD,iHAAiH;QACjH,IAAI,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAChC,SAAU;YACR,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE;gBACtC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,IAAI,KAAK,KAAK,KAAK;gBACjB,MAAM;YACR,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;SAC7B;QACD,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IAClC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,mCAAmC,CAC/C,IAAc,EACd,SAAuB,EACvB,cAAyC,EACzC,sBAAiE;QAEjE,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;YACvD,sBAAsB,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACxB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC;YACtC,IAAI,qBAAqB,GAAG,UAAU,CAAC;YACvC,SAAU;gBACR,IAAI,qBAAqB,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,uBAAuB;oBACnE,OAAO;gBACT,IAAI,cAAc,CAAC,qBAAqB,CAAC,EAAE;oBACzC,IAAI,GAAG,qBAAqB,CAAC;oBAC7B,MAAM;iBACP;gBACD,qBAAqB,GAAG,qBAAqB,CAAC,iBAAiB,CAAC;gBAChE,IAAI,qBAAqB,KAAK,UAAU;oBACtC,MAAM,CAAC,8FAA8F;aACxG;SACF;IACH,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,mCAAmC,CAAC,KAAoB,EAAE,YAA0B;QAChG,+EAA+E;QAC/E,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,cAAc,GAAG,CAAC,IAAc,EAAW,EAAE;YACjD,OAAO,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACvF,CAAC,CAAC;QACF,MAAM,sBAAsB,GAAG,CAAC,IAAc,EAAE,OAAe,EAAE,EAAE;YACjE,IAAI,OAAO,KAAK,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,mCAAmC,CAAC,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,sBAAsB,CAAC,CAAC;SACnG;QACD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC1B,OAAO,KAAK,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\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\nimport { Range1d } from \"../geometry3d/Range\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, HalfEdgeToBooleanFunction, NodeToNumberFunction } from \"./Graph\";\r\nimport { SignedDataSummary } from \"./SignedDataSummary\";\r\nimport { XYParitySearchContext } from \"./XYParitySearchContext\";\r\n\r\n// cspell:word internaldocs\r\n\r\n/** Interface for an object that executes boolean tests on edges. */\r\nexport interface HalfEdgeTestObject {\r\n  testEdge(h: HalfEdge): boolean;\r\n}\r\n/** Class to test match of half edge mask. */\r\nexport class HalfEdgeMaskTester {\r\n  private _targetMask: HalfEdgeMask;\r\n  private _targetValue: boolean;\r\n  /**\r\n   * Constructor\r\n   * @param mask mask to test in `testEdge` function\r\n   * @param targetValue value to match for true return\r\n   */\r\n  public constructor(mask: HalfEdgeMask, targetValue: boolean = true) {\r\n    this._targetMask = mask;\r\n    this._targetValue = targetValue;\r\n  }\r\n  /** Return true if the value of the targetMask matches the targetValue. */\r\n  public testEdge(edge: HalfEdge): boolean {\r\n    return edge.isMaskSet(this._targetMask) === this._targetValue;\r\n  }\r\n}\r\n/** Class for different types of searches for HalfEdgeGraph. */\r\nexport class HalfEdgeGraphSearch {\r\n  /**\r\n   * Static method for face area computation -- useful as function parameter in `collectFaceAreaSummary`.\r\n   * * This simply calls `node.signedFaceArea()`\r\n   * @param node instance for signedFaceArea call.\r\n   */\r\n  public static signedFaceArea(node: HalfEdge): number {\r\n    return node.signedFaceArea();\r\n  }\r\n  /**\r\n   * Return a summary of face data (e.g., area) as computed by the callback on the faces of the graph.\r\n   * * Callers with curved edge graphs must supply their own area function.\r\n   * @param source graph or array of nodes to examine.\r\n   * @param collectAllNodes flag to pass to the `SignedDataSummary` constructor to control collection of nodes.\r\n   * @param areaFunction function to obtain area (or other numeric value). Default computes polygonal face area.\r\n   */\r\n  public static collectFaceAreaSummary(\r\n    source: HalfEdgeGraph | HalfEdge[],\r\n    collectAllNodes: boolean = false,\r\n    areaFunction: NodeToNumberFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node),\r\n  ): SignedDataSummary<HalfEdge> {\r\n    const result = new SignedDataSummary<HalfEdge>(collectAllNodes);\r\n    let allFaces: HalfEdge[];\r\n    if (source instanceof HalfEdgeGraph)\r\n      allFaces = source.collectFaceLoops();\r\n    else\r\n      allFaces = source;\r\n    for (const node of allFaces) {\r\n      const area = areaFunction(node);\r\n      result.announceItem(node, area);\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Search the graph for the face with the most negative area.\r\n   * @param oneCandidateNodePerFace graph or an array containing one node from each face to be considered.\r\n   * @returns node on the negative area face with largest absolute area, or `undefined` if no negative area face.\r\n   */\r\n  public static findMinimumAreaFace(\r\n    oneCandidateNodePerFace: HalfEdgeGraph | HalfEdge[], faceAreaFunction?: NodeToNumberFunction,\r\n  ): HalfEdge | undefined {\r\n    const summary = HalfEdgeGraphSearch.collectFaceAreaSummary(oneCandidateNodePerFace, false, faceAreaFunction);\r\n    return summary.largestNegativeItem;\r\n  }\r\n  /**\r\n   * Test if the graph is triangulated.\r\n   * * Return `false` if:\r\n   *   * number of positive area faces with more than 3 edges is larger than `numPositiveExceptionsAllowed`.\r\n   *   * graph has more than 1 negative area face when `allowMultipleNegativeAreaFaces` is `false`.\r\n   * * 2-edge faces are ignored.\r\n   */\r\n  public static isTriangulatedCCW(\r\n    source: HalfEdgeGraph | HalfEdge[],\r\n    allowMultipleNegativeAreaFaces: boolean = true,\r\n    numPositiveExceptionsAllowed: number = 0,\r\n  ): boolean {\r\n    let allFaces: HalfEdge[];\r\n    if (source instanceof HalfEdgeGraph)\r\n      allFaces = source.collectFaceLoops();\r\n    else\r\n      allFaces = source;\r\n    let numNegative = 0;\r\n    let numPositiveExceptions = 0;\r\n    for (const node of allFaces) {\r\n      const numEdges = node.countEdgesAroundFace();\r\n      if (numEdges >= 3) {\r\n        const area = node.signedFaceArea();\r\n        if (area > 0) {\r\n          if (numEdges > 3) {\r\n            numPositiveExceptions++;\r\n            if (numPositiveExceptions > numPositiveExceptionsAllowed)\r\n              return false;\r\n          }\r\n        } else {\r\n          numNegative++;\r\n          if (numNegative > 1) {\r\n            if (!allowMultipleNegativeAreaFaces)\r\n              return false;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n  /**\r\n   * Process a face during graph traversal.\r\n   * @param faceSeed a node in the face.\r\n   * @param mask mask to set on each node of the face.\r\n   * @param allNodeStack array appended with each node of the face.\r\n   * @param onePerFaceStack array appended with `faceSeed`.\r\n   */\r\n  private static pushAndMaskAllNodesInFace(\r\n    faceSeed: HalfEdge, mask: number, allNodeStack: HalfEdge[], onePerFaceStack: HalfEdge[],\r\n  ): void {\r\n    onePerFaceStack.push(faceSeed);\r\n    faceSeed.collectAroundFace((node: HalfEdge) => {\r\n      node.setMask(mask);\r\n      allNodeStack.push(node);\r\n    });\r\n  }\r\n  /**\r\n   * Traverse (via Depth First Search) to all accessible faces from the given seed.\r\n   * @param faceSeed first node to start the traverse.\r\n   * @param visitMask mask applied to all faces as visited.\r\n   * @param parityEdgeTester function to test if an edge is adjacent to two faces of opposite parity, e.g., a boundary\r\n   * edge that separates an \"interior\" face and an \"exterior\" face. If `parityEdgeTester` is not supplied and `parityMask`\r\n   * is supplied, the default parity rule is to alternate parity state in a \"bullseye\" pattern starting at the seed face,\r\n   * with each successive concentric ring of faces at constant topological distance from the seed face receiving the\r\n   * opposite parity state of the previous ring.\r\n   * @param parityMask mask to apply to the first face and faces that share the same parity as the first face, as\r\n   * determined by the parity rule. If this is `NULL_MASK`, there is no record of parity. If (non-null) parity mask\r\n   * is given, on return it is entirely set or entirely clear around each face.\r\n   * @returns an array that contains one representative node in each face of the connected component.\r\n   */\r\n  private static parityFloodFromSeed(\r\n    faceSeed: HalfEdge,\r\n    visitMask: HalfEdgeMask,\r\n    parityEdgeTester: HalfEdgeTestObject | undefined,\r\n    parityMask: HalfEdgeMask,\r\n  ): HalfEdge[] {\r\n    const faces: HalfEdge[] = [];\r\n    if (faceSeed.isMaskSet(visitMask))\r\n      return faces; // empty array\r\n    const allMasks = parityMask | visitMask;\r\n    const stack: HalfEdge[] = [];\r\n    // the seed face is arbitrarily assigned the parity mask\r\n    HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(faceSeed, allMasks, stack, faces);\r\n    while (stack.length > 0) {\r\n      const p = stack.pop()!;\r\n      const mate = p.edgeMate;\r\n      if (!mate)\r\n        continue;\r\n      if (!mate.isMaskSet(visitMask)) {\r\n        let newState = p.isMaskSet(parityMask);\r\n        if (!parityEdgeTester || parityEdgeTester.testEdge(p))\r\n          newState = !newState;\r\n        HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(mate, newState ? allMasks : visitMask, stack, faces);\r\n      }\r\n    }\r\n    return faces;\r\n  }\r\n  /**\r\n   * * Correct the parity mask in the faces of a component.\r\n   * * It is assumed that the parity mask is applied _consistently_ throughout the supplied faces, but maybe\r\n   * not _correctly_.\r\n   * * A consistently applied parity mask is \"correct\" if it is set on the negative area (\"exterior\") face of\r\n   * a connected component.\r\n   * * This method finds a face with negative area and toggles the mask throughout the input faces if this face\r\n   * lacks the parity mask.\r\n   * * In a properly merged planar subdivision there should be only one true negative area face per component.\r\n   */\r\n  private static correctParityInSingleComponent(parityMask: HalfEdgeMask, faces: HalfEdge[]): void {\r\n    const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(faces);\r\n    if (!exteriorHalfEdge) {\r\n      // graph has all degenerate faces; do nothing\r\n    } else if (exteriorHalfEdge.isMaskSet(parityMask)) {\r\n      // all should be well; nothing to do\r\n    } else {\r\n      for (const faceSeed of faces) {\r\n        if (faceSeed.isMaskSet(parityMask)) {\r\n          faceSeed.clearMaskAroundFace(parityMask);\r\n        } else {\r\n          faceSeed.setMaskAroundFace(parityMask);\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /** Apply `correctParityInSingleComponent` to each array in components (quick exit if `parityMask` is `NULL_MASK`). */\r\n  private static correctParityInComponentArrays(parityMask: HalfEdgeMask, components: HalfEdge[][]): void {\r\n    if (parityMask === HalfEdgeMask.NULL_MASK)\r\n      return;\r\n    for (const facesInComponent of components)\r\n      HalfEdgeGraphSearch.correctParityInSingleComponent(parityMask, facesInComponent);\r\n  }\r\n  /**\r\n   * Collect connected components of the graph (via Depth First Search).\r\n   * @param graph graph to inspect.\r\n   * @param parityEdgeTester (optional) function to test if an edge is adjacent to two faces of opposite parity,\r\n   * e.g., a boundary edge that separates an \"interior\" face and an \"exterior\" face. If `parityEdgeTester` is not\r\n   * supplied and `parityMask` is supplied, the default parity rule is to alternate parity state in a \"bullseye\"\r\n   * pattern starting at the seed face, with each successive concentric ring of faces at constant topological\r\n   * distance from the seed face receiving the opposite parity state of the previous ring.\r\n   * @param parityMask (optional) mask to apply to the first face and faces that share the same parity as the\r\n   * first face, as determined by the parity rule. If this is `NULL_MASK`, there is no record of parity. If\r\n   * (non-null) parity mask is given, on return it is entirely set or entirely clear around each face.\r\n   * @returns the components of the graph, each component represented by an array of nodes, one node per face\r\n   * of the component. In other words, entry [i][j] is a HalfEdge in the j_th face loop of the i_th component.\r\n   */\r\n  public static collectConnectedComponentsWithExteriorParityMasks(\r\n    graph: HalfEdgeGraph,\r\n    parityEdgeTester: HalfEdgeTestObject | undefined,\r\n    parityMask: HalfEdgeMask = HalfEdgeMask.NULL_MASK,\r\n  ): HalfEdge[][] {\r\n    // Illustration of the algorithm can be found at geometry/internaldocs/Graph.md\r\n    const components = [];\r\n    const visitMask = HalfEdgeMask.VISITED;\r\n    const allMasks = parityMask | visitMask;\r\n    graph.clearMask(allMasks);\r\n    for (const faceSeed of graph.allHalfEdges) {\r\n      if (!faceSeed.isMaskSet(visitMask)) {\r\n        const newFaces = HalfEdgeGraphSearch.parityFloodFromSeed(faceSeed, visitMask, parityEdgeTester, parityMask);\r\n        // parityFloodFromSeed does not return an empty array because it is called on an unvisited faceSeed\r\n        components.push(newFaces);\r\n      }\r\n    }\r\n    HalfEdgeGraphSearch.correctParityInComponentArrays(parityMask, components);\r\n    return components;\r\n  }\r\n  /**\r\n   * Test if test point (xTest,yTest) is inside/outside a face or on an edge.\r\n   * @param seedNode any node on the face loop.\r\n   * @param xTest x coordinate of the test point.\r\n   * @param yTest y coordinate of the test point.\r\n   * @returns 0 if ON, 1 if IN, -1 if OUT.\r\n   */\r\n  public static pointInOrOnFaceXY(seedNode: HalfEdge, xTest: number, yTest: number): number | undefined {\r\n    const context = new XYParitySearchContext(xTest, yTest);\r\n    // walk around looking for an accepted node to start the search (seedNode is usually ok)\r\n    let nodeA = seedNode;\r\n    let nodeB = seedNode.faceSuccessor;\r\n    for (; ; nodeA = nodeB) {\r\n      if (context.tryStartEdge(nodeA.x, nodeA.y, nodeB.x, nodeB.y))\r\n        break;\r\n      if (nodeB === seedNode) {\r\n        // the test point and the face are all on line \"y = yTest\"\r\n        const range = Range1d.createXX(nodeB.x, nodeB.faceSuccessor.x);\r\n        return range.containsX(xTest) ? 0 : -1;\r\n      }\r\n      nodeB = nodeA.faceSuccessor;\r\n    }\r\n    // nodeB is the real start node for search, so stop when we revisit it. For each edge, accumulate parity and hits\r\n    let nodeC = nodeB.faceSuccessor;\r\n    for (; ;) {\r\n      if (!context.advance(nodeC.x, nodeC.y)) {\r\n        return context.classifyCounts();\r\n      }\r\n      if (nodeC === nodeB)\r\n        break;\r\n      nodeC = nodeC.faceSuccessor;\r\n    }\r\n    return context.classifyCounts();\r\n  }\r\n  /**\r\n   * Collect boundary edges starting from `seed`.\r\n   * * If `seed` is not a boundary node or is already visited, the function exists early.\r\n   * @param seed start node.\r\n   * @param visitMask mask to set on processed nodes.\r\n   * @param isBoundaryEdge function to test if an edge in a boundary edge.\r\n   * @param announceEdgeInBoundary callback invoked on each edge in the boundary loop in order. The counter is zero\r\n   * for the first edge, and incremented with each successive edge.\r\n   */\r\n  public static collectExtendedBoundaryLoopFromSeed(\r\n    seed: HalfEdge,\r\n    visitMask: HalfEdgeMask,\r\n    isBoundaryEdge: HalfEdgeToBooleanFunction,\r\n    announceEdgeInBoundary: (edge: HalfEdge, counter: number) => void,\r\n  ): void {\r\n    let counter = 0;\r\n    while (!seed.getMask(visitMask) && isBoundaryEdge(seed)) {\r\n      announceEdgeInBoundary(seed, counter++);\r\n      seed.setMask(visitMask);\r\n      const vertexBase = seed.faceSuccessor;\r\n      let candidateAroundVertex = vertexBase;\r\n      for (; ;) {\r\n        if (candidateAroundVertex.getMask(visitMask)) // end of boundary loop\r\n          return;\r\n        if (isBoundaryEdge(candidateAroundVertex)) {\r\n          seed = candidateAroundVertex;\r\n          break;\r\n        }\r\n        candidateAroundVertex = candidateAroundVertex.vertexPredecessor;\r\n        if (candidateAroundVertex === vertexBase)\r\n          break; // prevent infinite loop in case exteriorMask is not set on the edge mate of the boundary edge\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Collect boundary edges in the graph.\r\n   * * A boundary edge is defined by `exteriorMask` being set on only its \"exterior\" edge mate.\r\n   * * Each boundary edge is identified in the output by its edge mate that lacks `exteriorMask`.\r\n   * * Each inner array is ordered in the output so that its boundary edges form a connected path. If `exteriorMask`\r\n   * is preset consistently around each \"exterior\" face, these paths are loops.\r\n   * @param graph the graph to query\r\n   * @param exteriorMask mask preset on exactly one side of boundary edges\r\n   * @returns array of boundary loops, each loop an array of the unmasked mates of boundary edges\r\n   */\r\n  public static collectExtendedBoundaryLoopsInGraph(graph: HalfEdgeGraph, exteriorMask: HalfEdgeMask): HalfEdge[][] {\r\n    // Illustration of the algorithm can be found at geometry/internaldocs/Graph.md\r\n    const loops: HalfEdge[][] = [];\r\n    const visitMask = graph.grabMask(true);\r\n    const isBoundaryEdge = (edge: HalfEdge): boolean => {\r\n      return edge.getMask(exteriorMask) === 0 && edge.edgeMate.getMask(exteriorMask) !== 0;\r\n    };\r\n    const announceEdgeInBoundary = (edge: HalfEdge, counter: number) => {\r\n      if (counter === 0)\r\n        loops.push([]);\r\n      loops[loops.length - 1].push(edge);\r\n    };\r\n    for (const seed of graph.allHalfEdges) {\r\n      this.collectExtendedBoundaryLoopFromSeed(seed, visitMask, isBoundaryEdge, announceEdgeInBoundary);\r\n    }\r\n    graph.dropMask(visitMask);\r\n    return loops;\r\n  }\r\n}\r\n"]}

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

@@ -2,8 +2,9 @@
  * @module Topology
  */
 import { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from "./Graph";
-/** HalfEdgePointerInspector has methods to check HalfEdge objects for pointer errors.
- * * For a one-step test of the whole graph,
+/**
+ * HalfEdgePointerInspector has methods to check HalfEdge objects for pointer errors.
+ * * For a one-step test of the whole graph.
  */
 export declare class HalfEdgePointerInspector {
     numUndefinedEdgeMate: number;
@@ -13,39 +14,43 @@ export declare class HalfEdgePointerInspector {
     numMatePairError: number;
     numTested: number;
     numWithMatchedEdgeMate: number;
-    /** Clear all counts */
+    /** Clear all counts. */
     clearCounts(): void;
-    /** Inspect a single half edge.   Increment counters according to the half edge's pointers. */
+    /** Inspect a single half edge. Increment counters according to the half edge's pointers. */
     inspectHalfEdge(he: HalfEdge): void;
-    /** Return true if all pointer pairings are correct for a complete half edge graph:
+    /**
+     * Return true if all pointer pairings are correct for a closed half edge graph (with no boundary):
      * * For each he:  `he.edgeMate.edgeMate === he`
-     * * For each he:  `he.faceSuccessor.facePredecessor !== he`
-     * * For each he:  `he.facePredecessor.faceSuccessor !== he`
+     * * For each he:  `he.faceSuccessor.facePredecessor === he`
+     * * For each he:  `he.facePredecessor.faceSuccessor === he`
      */
     get isValidClosedHalfEdgeGraph(): boolean;
-    /** Return true if all counts are correct for a half edge graph that has complete pairings:
+    /**
+     * Return true if all pointer pairings are correct for a half edge graph with possible boundary:
      * * For each he:  `he.edgeMate.edgeMate === he`
-     * * For each he:  `he.faceSuccessor.facePredecessor !== he`
-     * * For each he:  `he.facePredecessor.faceSuccessor !== he`
+     * * For each he:  `he.faceSuccessor.facePredecessor === he`
+     * * For each he:  `he.facePredecessor.faceSuccessor === he`
      */
     get isValidHalfEdgeGraphAllowRaggedBoundary(): boolean;
-    /** inspect all half edges of graph.
-     * All pointer counts are left in member vars for later inspection.
+    /**
+     * Inspect all half edges of graph.
+     * * All pointer counts are left in member vars for later inspection.
      */
     inspectHalfEdges(graph: HalfEdgeGraph): void;
-    /** Inspect a graph's pointer properties.
-     * @param expectAllMates [in] true for "complete" graph with
-     * @returns true if all pointers are valid
+    /**
+     * Inspect a graph's pointer properties.
+     * @param expectAllMates true for "complete" graph.
+     * @returns true if all pointers are valid.
      */
     static inspectGraph(graph: HalfEdgeGraph, expectAllMates: boolean): boolean;
 }
-/** static methods to inspect mask consistency properties in HalfEdgeGraph. */
+/** Static methods to inspect mask consistency properties in HalfEdgeGraph. */
 export declare class HalfEdgeMaskValidation {
     /**
      * Test if a mask is used consistently around faces.
-     * * At the low level, there is no actual traversal around faces.  It is only necessary to verify that the mask matches for each HalfEdge and its faceSuccessor.
+     * * At the low level, there is no actual traversal around faces. It is only necessary to verify that the mask
+     * matches for each HalfEdge and its faceSuccessor.
      * @returns Return true if mask is "all or nothing around all faces"
-     *
      */
     static isMaskConsistentAroundAllFaces(graph: HalfEdgeGraph, mask: HalfEdgeMask): boolean;
 }

package/lib/esm/topology/HalfEdgeGraphValidation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgeGraphValidation.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphValidation.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAGhE;;GAEG;AACH,qBAAa,wBAAwB;IAC5B,oBAAoB,EAAE,MAAM,CAAK;IACjC,cAAc,EAAE,MAAM,CAAK;IAC3B,cAAc,EAAE,MAAM,CAAK;IAC3B,YAAY,EAAE,MAAM,CAAK;IACzB,gBAAgB,EAAE,MAAM,CAAK;IAC7B,SAAS,EAAE,MAAM,CAAK;IACtB,sBAAsB,EAAE,MAAM,CAAK;IAC1C,uBAAuB;IAChB,WAAW;IASlB,8FAA8F;IACvF,eAAe,CAAC,EAAE,EAAE,QAAQ;IAYnC;;;;OAIG;IACH,IAAW,0BAA0B,IAAI,OAAO,CAM/C;IACD;;;;OAIG;IACH,IAAW,uCAAuC,IAAI,OAAO,CAM5D;IACD;;OAEG;IACI,gBAAgB,CAAC,KAAK,EAAE,aAAa;IAK5C;;;OAGG;WACW,YAAY,CAAC,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,OAAO,GAAG,OAAO;CAMnF;AACD,8EAA8E;AAC9E,qBAAa,sBAAsB;IACjC;;;;;OAKG;WACW,8BAA8B,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,OAAO;CAOhG"}
+{"version":3,"file":"HalfEdgeGraphValidation.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphValidation.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAGhE;;;GAGG;AACH,qBAAa,wBAAwB;IAC5B,oBAAoB,EAAE,MAAM,CAAK;IACjC,cAAc,EAAE,MAAM,CAAK;IAC3B,cAAc,EAAE,MAAM,CAAK;IAC3B,YAAY,EAAE,MAAM,CAAK;IACzB,gBAAgB,EAAE,MAAM,CAAK;IAC7B,SAAS,EAAE,MAAM,CAAK;IACtB,sBAAsB,EAAE,MAAM,CAAK;IAC1C,wBAAwB;IACjB,WAAW;IASlB,4FAA4F;IACrF,eAAe,CAAC,EAAE,EAAE,QAAQ;IAmBnC;;;;;OAKG;IACH,IAAW,0BAA0B,IAAI,OAAO,CAM/C;IACD;;;;;OAKG;IACH,IAAW,uCAAuC,IAAI,OAAO,CAM5D;IACD;;;OAGG;IACI,gBAAgB,CAAC,KAAK,EAAE,aAAa;IAK5C;;;;OAIG;WACW,YAAY,CAAC,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,OAAO,GAAG,OAAO;CAOnF;AACD,8EAA8E;AAC9E,qBAAa,sBAAsB;IACjC;;;;;OAKG;WACW,8BAA8B,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,OAAO;CAOhG"}

package/lib/esm/topology/HalfEdgeGraphValidation.js

@@ -3,8 +3,9 @@
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
 // Search services for HalfEdgeGraph
-/** HalfEdgePointerInspector has methods to check HalfEdge objects for pointer errors.
- * * For a one-step test of the whole graph,
+/**
+ * HalfEdgePointerInspector has methods to check HalfEdge objects for pointer errors.
+ * * For a one-step test of the whole graph.
  */
 export class HalfEdgePointerInspector {
     constructor() {
@@ -16,7 +17,7 @@ export class HalfEdgePointerInspector {
         this.numTested = 0;
         this.numWithMatchedEdgeMate = 0;
     }
-    /** Clear all counts */
+    /** Clear all counts. */
     clearCounts() {
         this.numUndefinedEdgeMate = 0;
         this.numUndefinedFP = 0;
@@ -26,7 +27,7 @@ export class HalfEdgePointerInspector {
         this.numWithMatchedEdgeMate = 0;
         this.numTested = 0;
     }
-    /** Inspect a single half edge.   Increment counters according to the half edge's pointers. */
+    /** Inspect a single half edge. Increment counters according to the half edge's pointers. */
     inspectHalfEdge(he) {
         this.numTested++;
         if (he.facePredecessor === undefined)
@@ -44,10 +45,11 @@ export class HalfEdgePointerInspector {
         else
             this.numMatePairError++;
     }
-    /** Return true if all pointer pairings are correct for a complete half edge graph:
+    /**
+     * Return true if all pointer pairings are correct for a closed half edge graph (with no boundary):
      * * For each he:  `he.edgeMate.edgeMate === he`
-     * * For each he:  `he.faceSuccessor.facePredecessor !== he`
-     * * For each he:  `he.facePredecessor.faceSuccessor !== he`
+     * * For each he:  `he.faceSuccessor.facePredecessor === he`
+     * * For each he:  `he.facePredecessor.faceSuccessor === he`
      */
     get isValidClosedHalfEdgeGraph() {
         return this.numWithMatchedEdgeMate === this.numTested
@@ -56,10 +58,11 @@ export class HalfEdgePointerInspector {
             && this.numFSFPError === 0
             && this.numMatePairError === 0;
     }
-    /** Return true if all counts are correct for a half edge graph that has complete pairings:
+    /**
+     * Return true if all pointer pairings are correct for a half edge graph with possible boundary:
      * * For each he:  `he.edgeMate.edgeMate === he`
-     * * For each he:  `he.faceSuccessor.facePredecessor !== he`
-     * * For each he:  `he.facePredecessor.faceSuccessor !== he`
+     * * For each he:  `he.faceSuccessor.facePredecessor === he`
+     * * For each he:  `he.facePredecessor.faceSuccessor === he`
      */
     get isValidHalfEdgeGraphAllowRaggedBoundary() {
         return this.numWithMatchedEdgeMate + this.numUndefinedEdgeMate === this.numTested
@@ -68,17 +71,19 @@ export class HalfEdgePointerInspector {
             && this.numFSFPError === 0
             && this.numMatePairError === 0;
     }
-    /** inspect all half edges of graph.
-     * All pointer counts are left in member vars for later inspection.
+    /**
+     * Inspect all half edges of graph.
+     * * All pointer counts are left in member vars for later inspection.
      */
     inspectHalfEdges(graph) {
         this.clearCounts();
         for (const he of graph.allHalfEdges)
             this.inspectHalfEdge(he);
     }
-    /** Inspect a graph's pointer properties.
-     * @param expectAllMates [in] true for "complete" graph with
-     * @returns true if all pointers are valid
+    /**
+     * Inspect a graph's pointer properties.
+     * @param expectAllMates true for "complete" graph.
+     * @returns true if all pointers are valid.
      */
     static inspectGraph(graph, expectAllMates) {
         const inspector = new HalfEdgePointerInspector();
@@ -88,13 +93,13 @@ export class HalfEdgePointerInspector {
         return inspector.isValidHalfEdgeGraphAllowRaggedBoundary;
     }
 }
-/** static methods to inspect mask consistency properties in HalfEdgeGraph. */
+/** Static methods to inspect mask consistency properties in HalfEdgeGraph. */
 export class HalfEdgeMaskValidation {
     /**
      * Test if a mask is used consistently around faces.
-     * * At the low level, there is no actual traversal around faces.  It is only necessary to verify that the mask matches for each HalfEdge and its faceSuccessor.
+     * * At the low level, there is no actual traversal around faces. It is only necessary to verify that the mask
+     * matches for each HalfEdge and its faceSuccessor.
      * @returns Return true if mask is "all or nothing around all faces"
-     *
      */
     static isMaskConsistentAroundAllFaces(graph, mask) {
         for (const he of graph.allHalfEdges) {

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

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgeGraphValidation.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphValidation.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAQ/F,oCAAoC;AACpC;;GAEG;AACH,MAAM,OAAO,wBAAwB;IAArC;QACS,yBAAoB,GAAW,CAAC,CAAC;QACjC,mBAAc,GAAW,CAAC,CAAC;QAC3B,mBAAc,GAAW,CAAC,CAAC;QAC3B,iBAAY,GAAW,CAAC,CAAC;QACzB,qBAAgB,GAAW,CAAC,CAAC;QAC7B,cAAS,GAAW,CAAC,CAAC;QACtB,2BAAsB,GAAW,CAAC,CAAC;IAkE5C,CAAC;IAjEC,uBAAuB;IAChB,WAAW;QAChB,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,sBAAsB,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IACD,8FAA8F;IACvF,eAAe,CAAC,EAAY;QACjC,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,EAAE,CAAC,eAAe,KAAK,SAAS;YAAE,IAAI,CAAC,cAAc,EAAE,CAAC;aACvD,IAAI,EAAE,CAAC,eAAe,CAAC,aAAa,KAAK,EAAE;YAAE,IAAI,CAAC,YAAY,EAAE,CAAC;QAEtE,IAAI,EAAE,CAAC,aAAa,KAAK,SAAS;YAAE,IAAI,CAAC,cAAc,EAAE,CAAC;aACrD,IAAI,EAAE,CAAC,aAAa,CAAC,eAAe,KAAK,EAAE;YAAE,IAAI,CAAC,YAAY,EAAE,CAAC;QAEtE,IAAI,EAAE,CAAC,QAAQ,KAAK,SAAS;YAAE,IAAI,CAAC,oBAAoB,EAAE,CAAC;aACtD,IAAI,EAAE,CAAC,QAAQ,CAAC,QAAQ,KAAK,EAAE;YAAE,IAAI,CAAC,sBAAsB,EAAE,CAAC;;YAC/D,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC/B,CAAC;IACD;;;;OAIG;IACH,IAAW,0BAA0B;QACnC,OAAO,IAAI,CAAC,sBAAsB,KAAK,IAAI,CAAC,SAAS;eAChD,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,YAAY,KAAK,CAAC;eACvB,IAAI,CAAC,gBAAgB,KAAK,CAAC,CAAC;IACnC,CAAC;IACD;;;;OAIG;IACH,IAAW,uCAAuC;QAChD,OAAO,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC,oBAAoB,KAAK,IAAI,CAAC,SAAS;eAC5E,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,YAAY,KAAK,CAAC;eACvB,IAAI,CAAC,gBAAgB,KAAK,CAAC,CAAC;IACnC,CAAC;IACD;;OAEG;IACI,gBAAgB,CAAC,KAAoB;QAC1C,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,YAAY;YAAE,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IAEhE,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,YAAY,CAAC,KAAoB,EAAE,cAAuB;QACtE,MAAM,SAAS,GAAG,IAAI,wBAAwB,EAAE,CAAC;QACjD,SAAS,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,cAAc;YAAE,OAAO,SAAS,CAAC,0BAA0B,CAAC;QAChE,OAAO,SAAS,CAAC,uCAAuC,CAAC;IAC3D,CAAC;CACF;AACD,8EAA8E;AAC9E,MAAM,OAAO,sBAAsB;IACjC;;;;;OAKG;IACI,MAAM,CAAC,8BAA8B,CAAC,KAAoB,EAAE,IAAkB;QACnF,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,YAAY,EAAE;YACnC,IAAI,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;gBACrD,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n// cspell:word FSFP\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\n\r\n// Search services for HalfEdgeGraph\r\n/** HalfEdgePointerInspector has methods to check HalfEdge objects for pointer errors.\r\n * * For a one-step test of the whole graph,\r\n */\r\nexport class HalfEdgePointerInspector {\r\n  public numUndefinedEdgeMate: number = 0;\r\n  public numUndefinedFS: number = 0;\r\n  public numUndefinedFP: number = 0;\r\n  public numFSFPError: number = 0;\r\n  public numMatePairError: number = 0;\r\n  public numTested: number = 0;\r\n  public numWithMatchedEdgeMate: number = 0;\r\n  /** Clear all counts */\r\n  public clearCounts() {\r\n    this.numUndefinedEdgeMate = 0;\r\n    this.numUndefinedFP = 0;\r\n    this.numUndefinedFS = 0;\r\n    this.numFSFPError = 0;\r\n    this.numMatePairError = 0;\r\n    this.numWithMatchedEdgeMate = 0;\r\n    this.numTested = 0;\r\n  }\r\n  /** Inspect a single half edge.   Increment counters according to the half edge's pointers. */\r\n  public inspectHalfEdge(he: HalfEdge) {\r\n    this.numTested++;\r\n    if (he.facePredecessor === undefined) this.numUndefinedFP++;\r\n    else if (he.facePredecessor.faceSuccessor !== he) this.numFSFPError++;\r\n\r\n    if (he.faceSuccessor === undefined) this.numUndefinedFS++;\r\n    else if (he.faceSuccessor.facePredecessor !== he) this.numFSFPError++;\r\n\r\n    if (he.edgeMate === undefined) this.numUndefinedEdgeMate++;\r\n    else if (he.edgeMate.edgeMate === he) this.numWithMatchedEdgeMate++;\r\n    else this.numMatePairError++;\r\n  }\r\n  /** Return true if all pointer pairings are correct for a complete half edge graph:\r\n   * * For each he:  `he.edgeMate.edgeMate === he`\r\n   * * For each he:  `he.faceSuccessor.facePredecessor !== he`\r\n   * * For each he:  `he.facePredecessor.faceSuccessor !== he`\r\n   */\r\n  public get isValidClosedHalfEdgeGraph(): boolean {\r\n    return this.numWithMatchedEdgeMate === this.numTested\r\n      && this.numUndefinedFS === 0\r\n      && this.numUndefinedFP === 0\r\n      && this.numFSFPError === 0\r\n      && this.numMatePairError === 0;\r\n  }\r\n  /** Return true if all counts are correct for a half edge graph that has complete pairings:\r\n   * * For each he:  `he.edgeMate.edgeMate === he`\r\n   * * For each he:  `he.faceSuccessor.facePredecessor !== he`\r\n   * * For each he:  `he.facePredecessor.faceSuccessor !== he`\r\n   */\r\n  public get isValidHalfEdgeGraphAllowRaggedBoundary(): boolean {\r\n    return this.numWithMatchedEdgeMate + this.numUndefinedEdgeMate === this.numTested\r\n      && this.numUndefinedFS === 0\r\n      && this.numUndefinedFP === 0\r\n      && this.numFSFPError === 0\r\n      && this.numMatePairError === 0;\r\n  }\r\n  /** inspect all half edges of graph.\r\n   * All pointer counts are left in member vars for later inspection.\r\n   */\r\n  public inspectHalfEdges(graph: HalfEdgeGraph) {\r\n    this.clearCounts();\r\n    for (const he of graph.allHalfEdges) this.inspectHalfEdge(he);\r\n\r\n  }\r\n  /** Inspect a graph's pointer properties.\r\n   * @param expectAllMates [in] true for \"complete\" graph with\r\n   * @returns true if all pointers are valid\r\n   */\r\n  public static inspectGraph(graph: HalfEdgeGraph, expectAllMates: boolean): boolean {\r\n    const inspector = new HalfEdgePointerInspector();\r\n    inspector.inspectHalfEdges(graph);\r\n    if (expectAllMates) return inspector.isValidClosedHalfEdgeGraph;\r\n    return inspector.isValidHalfEdgeGraphAllowRaggedBoundary;\r\n  }\r\n}\r\n/** static methods to inspect mask consistency properties in HalfEdgeGraph. */\r\nexport class HalfEdgeMaskValidation {\r\n  /**\r\n   * Test if a mask is used consistently around faces.\r\n   * * At the low level, there is no actual traversal around faces.  It is only necessary to verify that the mask matches for each HalfEdge and its faceSuccessor.\r\n   * @returns Return true if mask is \"all or nothing around all faces\"\r\n   *\r\n   */\r\n  public static isMaskConsistentAroundAllFaces(graph: HalfEdgeGraph, mask: HalfEdgeMask): boolean {\r\n    for (const he of graph.allHalfEdges) {\r\n      if (he.faceSuccessor.getMask(mask) !== he.getMask(mask))\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"HalfEdgeGraphValidation.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphValidation.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAQ/F,oCAAoC;AACpC;;;GAGG;AACH,MAAM,OAAO,wBAAwB;IAArC;QACS,yBAAoB,GAAW,CAAC,CAAC;QACjC,mBAAc,GAAW,CAAC,CAAC;QAC3B,mBAAc,GAAW,CAAC,CAAC;QAC3B,iBAAY,GAAW,CAAC,CAAC;QACzB,qBAAgB,GAAW,CAAC,CAAC;QAC7B,cAAS,GAAW,CAAC,CAAC;QACtB,2BAAsB,GAAW,CAAC,CAAC;IA8E5C,CAAC;IA7EC,wBAAwB;IACjB,WAAW;QAChB,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,sBAAsB,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IACD,4FAA4F;IACrF,eAAe,CAAC,EAAY;QACjC,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,EAAE,CAAC,eAAe,KAAK,SAAS;YAClC,IAAI,CAAC,cAAc,EAAE,CAAC;aACnB,IAAI,EAAE,CAAC,eAAe,CAAC,aAAa,KAAK,EAAE;YAC9C,IAAI,CAAC,YAAY,EAAE,CAAC;QAEtB,IAAI,EAAE,CAAC,aAAa,KAAK,SAAS;YAChC,IAAI,CAAC,cAAc,EAAE,CAAC;aACnB,IAAI,EAAE,CAAC,aAAa,CAAC,eAAe,KAAK,EAAE;YAC9C,IAAI,CAAC,YAAY,EAAE,CAAC;QAEtB,IAAI,EAAE,CAAC,QAAQ,KAAK,SAAS;YAC3B,IAAI,CAAC,oBAAoB,EAAE,CAAC;aACzB,IAAI,EAAE,CAAC,QAAQ,CAAC,QAAQ,KAAK,EAAE;YAClC,IAAI,CAAC,sBAAsB,EAAE,CAAC;;YAE9B,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC5B,CAAC;IACD;;;;;OAKG;IACH,IAAW,0BAA0B;QACnC,OAAO,IAAI,CAAC,sBAAsB,KAAK,IAAI,CAAC,SAAS;eAChD,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,YAAY,KAAK,CAAC;eACvB,IAAI,CAAC,gBAAgB,KAAK,CAAC,CAAC;IACnC,CAAC;IACD;;;;;OAKG;IACH,IAAW,uCAAuC;QAChD,OAAO,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC,oBAAoB,KAAK,IAAI,CAAC,SAAS;eAC5E,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,YAAY,KAAK,CAAC;eACvB,IAAI,CAAC,gBAAgB,KAAK,CAAC,CAAC;IACnC,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,KAAoB;QAC1C,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,YAAY;YACjC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,YAAY,CAAC,KAAoB,EAAE,cAAuB;QACtE,MAAM,SAAS,GAAG,IAAI,wBAAwB,EAAE,CAAC;QACjD,SAAS,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,cAAc;YAChB,OAAO,SAAS,CAAC,0BAA0B,CAAC;QAC9C,OAAO,SAAS,CAAC,uCAAuC,CAAC;IAC3D,CAAC;CACF;AACD,8EAA8E;AAC9E,MAAM,OAAO,sBAAsB;IACjC;;;;;OAKG;IACI,MAAM,CAAC,8BAA8B,CAAC,KAAoB,EAAE,IAAkB;QACnF,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,YAAY,EAAE;YACnC,IAAI,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;gBACrD,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n// cspell:word FSFP\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\n\r\n// Search services for HalfEdgeGraph\r\n/**\r\n * HalfEdgePointerInspector has methods to check HalfEdge objects for pointer errors.\r\n * * For a one-step test of the whole graph.\r\n */\r\nexport class HalfEdgePointerInspector {\r\n  public numUndefinedEdgeMate: number = 0;\r\n  public numUndefinedFS: number = 0;\r\n  public numUndefinedFP: number = 0;\r\n  public numFSFPError: number = 0;\r\n  public numMatePairError: number = 0;\r\n  public numTested: number = 0;\r\n  public numWithMatchedEdgeMate: number = 0;\r\n  /** Clear all counts. */\r\n  public clearCounts() {\r\n    this.numUndefinedEdgeMate = 0;\r\n    this.numUndefinedFP = 0;\r\n    this.numUndefinedFS = 0;\r\n    this.numFSFPError = 0;\r\n    this.numMatePairError = 0;\r\n    this.numWithMatchedEdgeMate = 0;\r\n    this.numTested = 0;\r\n  }\r\n  /** Inspect a single half edge. Increment counters according to the half edge's pointers. */\r\n  public inspectHalfEdge(he: HalfEdge) {\r\n    this.numTested++;\r\n    if (he.facePredecessor === undefined)\r\n      this.numUndefinedFP++;\r\n    else if (he.facePredecessor.faceSuccessor !== he)\r\n      this.numFSFPError++;\r\n\r\n    if (he.faceSuccessor === undefined)\r\n      this.numUndefinedFS++;\r\n    else if (he.faceSuccessor.facePredecessor !== he)\r\n      this.numFSFPError++;\r\n\r\n    if (he.edgeMate === undefined)\r\n      this.numUndefinedEdgeMate++;\r\n    else if (he.edgeMate.edgeMate === he)\r\n      this.numWithMatchedEdgeMate++;\r\n    else\r\n      this.numMatePairError++;\r\n  }\r\n  /**\r\n   * Return true if all pointer pairings are correct for a closed half edge graph (with no boundary):\r\n   * * For each he:  `he.edgeMate.edgeMate === he`\r\n   * * For each he:  `he.faceSuccessor.facePredecessor === he`\r\n   * * For each he:  `he.facePredecessor.faceSuccessor === he`\r\n   */\r\n  public get isValidClosedHalfEdgeGraph(): boolean {\r\n    return this.numWithMatchedEdgeMate === this.numTested\r\n      && this.numUndefinedFS === 0\r\n      && this.numUndefinedFP === 0\r\n      && this.numFSFPError === 0\r\n      && this.numMatePairError === 0;\r\n  }\r\n  /**\r\n   * Return true if all pointer pairings are correct for a half edge graph with possible boundary:\r\n   * * For each he:  `he.edgeMate.edgeMate === he`\r\n   * * For each he:  `he.faceSuccessor.facePredecessor === he`\r\n   * * For each he:  `he.facePredecessor.faceSuccessor === he`\r\n   */\r\n  public get isValidHalfEdgeGraphAllowRaggedBoundary(): boolean {\r\n    return this.numWithMatchedEdgeMate + this.numUndefinedEdgeMate === this.numTested\r\n      && this.numUndefinedFS === 0\r\n      && this.numUndefinedFP === 0\r\n      && this.numFSFPError === 0\r\n      && this.numMatePairError === 0;\r\n  }\r\n  /**\r\n   * Inspect all half edges of graph.\r\n   * * All pointer counts are left in member vars for later inspection.\r\n   */\r\n  public inspectHalfEdges(graph: HalfEdgeGraph) {\r\n    this.clearCounts();\r\n    for (const he of graph.allHalfEdges)\r\n      this.inspectHalfEdge(he);\r\n  }\r\n  /**\r\n   * Inspect a graph's pointer properties.\r\n   * @param expectAllMates true for \"complete\" graph.\r\n   * @returns true if all pointers are valid.\r\n   */\r\n  public static inspectGraph(graph: HalfEdgeGraph, expectAllMates: boolean): boolean {\r\n    const inspector = new HalfEdgePointerInspector();\r\n    inspector.inspectHalfEdges(graph);\r\n    if (expectAllMates)\r\n      return inspector.isValidClosedHalfEdgeGraph;\r\n    return inspector.isValidHalfEdgeGraphAllowRaggedBoundary;\r\n  }\r\n}\r\n/** Static methods to inspect mask consistency properties in HalfEdgeGraph. */\r\nexport class HalfEdgeMaskValidation {\r\n  /**\r\n   * Test if a mask is used consistently around faces.\r\n   * * At the low level, there is no actual traversal around faces. It is only necessary to verify that the mask\r\n   * matches for each HalfEdge and its faceSuccessor.\r\n   * @returns Return true if mask is \"all or nothing around all faces\"\r\n   */\r\n  public static isMaskConsistentAroundAllFaces(graph: HalfEdgeGraph, mask: HalfEdgeMask): boolean {\r\n    for (const he of graph.allHalfEdges) {\r\n      if (he.faceSuccessor.getMask(mask) !== he.getMask(mask))\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n}\r\n"]}

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

@@ -16,30 +16,37 @@ export declare class NodeXYZUV {
     private _z;
     private _u;
     private _v;
+    /** Constructor */
     private constructor();
-    /** Set all content directly from args.
+    /**
+     * Set all content directly from args.
      * @returns `this` reference
      */
     set(node: HalfEdge, x: number, y: number, z: number, u: number, v: number): NodeXYZUV;
+    /** Set from `other` */
     setFrom(other: NodeXYZUV): void;
-    /** Create a `NodeXYZUV` with
-     * * x,y,z at ray origin
-     * * u,v as dotXY and crossXY for the ray direction with x,y distances from the ray origin.
+    /**
+     * Create a `NodeXYZUV` with:
+     * * node from the given HalfEdge.
+     * * x,y,z as the coordinates of `node`.
+     * * u as the xy dot product of vectorA with `ray.direction`, where vectorA is the vector from ray origin to
+     * `node` coordinates.
+     * * v as the xy cross product of `ray.direction` with vectorA.
      */
     static createNodeAndRayOrigin(node: HalfEdge, ray: Ray3d, result?: NodeXYZUV): NodeXYZUV;
-    /** Create a `NodeXYZUV` with explicit node, xyz, uv */
+    /** Create a `NodeXYZUV` with explicit `node`, xyz, uv. */
     static create(node: HalfEdge, x?: number, y?: number, z?: number, u?: number, v?: number): NodeXYZUV;
     /** Access the node. */
     get node(): HalfEdge;
-    /** Access the x coordinate */
+    /** Access the x coordinate. */
     get x(): number;
-    /** Access the y coordinate */
+    /** Access the y coordinate. */
     get y(): number;
-    /** Access the z coordinate */
+    /** Access the z coordinate. */
     get z(): number;
-    /** Access the u coordinate */
+    /** Access the u coordinate. */
     get u(): number;
-    /** Access the v coordinate */
+    /** Access the v coordinate. */
     get v(): number;
     /** Access the x,y,z coordinates as Point3d with optional caller-supplied result. */
     getXYZAsPoint3d(result?: Point3d): Point3d;

package/lib/esm/topology/HalfEdgeNodeXYZUV.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgeNodeXYZUV.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgeNodeXYZUV.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEnC;;GAEG;AACH;;;GAGG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,KAAK,CAAW;IACxB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IAEnB,OAAO;IAKP;;OAEG;IACI,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS;IAOrF,OAAO,CAAC,KAAK,EAAE,SAAS;IAM/B;;;OAGG;WACW,sBAAsB,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS;IAY/F,uDAAuD;WACzC,MAAM,CAAC,IAAI,EAAE,QAAQ,EACjC,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU;IAI3E,uBAAuB;IACvB,IAAW,IAAI,IAAI,QAAQ,CAAuB;IAClD,8BAA8B;IAC9B,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,oFAAoF;IAC7E,eAAe,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAGjD,iFAAiF;IAC1E,cAAc,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAEhD,sDAAsD;IAC/C,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAOrD,sDAAsD;IAC/C,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;CAOtD"}
+{"version":3,"file":"HalfEdgeNodeXYZUV.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgeNodeXYZUV.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEnC;;GAEG;AACH;;;GAGG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,KAAK,CAAW;IACxB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,kBAAkB;IAClB,OAAO;IAQP;;;OAGG;IACI,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS;IAS5F,uBAAuB;IAChB,OAAO,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI;IAQtC;;;;;;;OAOG;WACW,sBAAsB,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS;IAY/F,0DAA0D;WAC5C,MAAM,CAClB,IAAI,EAAE,QAAQ,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,GACxF,SAAS;IAGZ,uBAAuB;IACvB,IAAW,IAAI,IAAI,QAAQ,CAE1B;IACD,+BAA+B;IAC/B,IAAW,CAAC,IAAI,MAAM,CAErB;IACD,+BAA+B;IAC/B,IAAW,CAAC,IAAI,MAAM,CAErB;IACD,+BAA+B;IAC/B,IAAW,CAAC,IAAI,MAAM,CAErB;IACD,+BAA+B;IAC/B,IAAW,CAAC,IAAI,MAAM,CAErB;IACD,+BAA+B;IAC/B,IAAW,CAAC,IAAI,MAAM,CAErB;IACD,oFAAoF;IAC7E,eAAe,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAGjD,iFAAiF;IAC1E,cAAc,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAGhD,sDAAsD;IAC/C,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAMrD,sDAAsD;IAC/C,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;CAMtD"}

package/lib/esm/topology/HalfEdgeNodeXYZUV.js

@@ -13,6 +13,7 @@ import { Point3d } from "../geometry3d/Point3dVector3d";
  * @internal
  */
 export class NodeXYZUV {
+    /** Constructor */
     constructor(node, x, y, z, u, v) {
         this._x = x;
         this._y = y;
@@ -21,7 +22,8 @@ export class NodeXYZUV {
         this._v = v;
         this._node = node;
     }
-    /** Set all content directly from args.
+    /**
+     * Set all content directly from args.
      * @returns `this` reference
      */
     set(node, x, y, z, u, v) {
@@ -33,6 +35,7 @@ export class NodeXYZUV {
         this._node = node;
         return this;
     }
+    /** Set from `other` */
     setFrom(other) {
         this._x = other.x;
         this._y = other.y;
@@ -41,9 +44,13 @@ export class NodeXYZUV {
         this._v = other.v;
         this._node = other.node;
     }
-    /** Create a `NodeXYZUV` with
-     * * x,y,z at ray origin
-     * * u,v as dotXY and crossXY for the ray direction with x,y distances from the ray origin.
+    /**
+     * Create a `NodeXYZUV` with:
+     * * node from the given HalfEdge.
+     * * x,y,z as the coordinates of `node`.
+     * * u as the xy dot product of vectorA with `ray.direction`, where vectorA is the vector from ray origin to
+     * `node` coordinates.
+     * * v as the xy cross product of `ray.direction` with vectorA.
      */
     static createNodeAndRayOrigin(node, ray, result) {
         const x = node.x;
@@ -57,28 +64,42 @@ export class NodeXYZUV {
             return result.set(node, x, y, z, u, v);
         return new NodeXYZUV(node, x, y, z, u, v);
     }
-    /** Create a `NodeXYZUV` with explicit node, xyz, uv */
+    /** Create a `NodeXYZUV` with explicit `node`, xyz, uv. */
     static create(node, x = 0, y = 0, z = 0, u = 0, v = 0) {
         return new NodeXYZUV(node, x, y, z, u, v);
     }
     /** Access the node. */
-    get node() { return this._node; }
-    /** Access the x coordinate */
-    get x() { return this._x; }
-    /** Access the y coordinate */
-    get y() { return this._y; }
-    /** Access the z coordinate */
-    get z() { return this._z; }
-    /** Access the u coordinate */
-    get u() { return this._u; }
-    /** Access the v coordinate */
-    get v() { return this._v; }
+    get node() {
+        return this._node;
+    }
+    /** Access the x coordinate. */
+    get x() {
+        return this._x;
+    }
+    /** Access the y coordinate. */
+    get y() {
+        return this._y;
+    }
+    /** Access the z coordinate. */
+    get z() {
+        return this._z;
+    }
+    /** Access the u coordinate. */
+    get u() {
+        return this._u;
+    }
+    /** Access the v coordinate. */
+    get v() {
+        return this._v;
+    }
     /** Access the x,y,z coordinates as Point3d with optional caller-supplied result. */
     getXYZAsPoint3d(result) {
         return Point3d.create(this._x, this._y, this._z, result);
     }
     /** Access the uv coordinates as Point2d with optional caller-supplied result. */
-    getUVAsPoint2d(result) { return Point2d.create(this._u, this._v, result); }
+    getUVAsPoint2d(result) {
+        return Point2d.create(this._u, this._v, result);
+    }
     /** Toleranced comparison function for u coordinate */
     classifyU(target, tol) {
         const delta = this.u - target;

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

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgeNodeXYZUV.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeNodeXYZUV.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAIxD;;GAEG;AACH;;;GAGG;AACH,MAAM,OAAO,SAAS;IAQpB,YAAoB,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS;QACvF,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IACD;;OAEG;IACI,GAAG,CAAC,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS;QAC9E,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,OAAO,CAAC,KAAgB;QAC7B,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;IAE1B,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAc,EAAE,GAAU,EAAE,MAAkB;QACjF,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9E,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,uDAAuD;IAChD,MAAM,CAAC,MAAM,CAAC,IAAc,EACjC,IAAY,CAAC,EAAE,IAAY,CAAC,EAAE,IAAY,CAAC,EAAE,IAAY,CAAC,EAAE,IAAY,CAAC;QACzE,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,uBAAuB;IACvB,IAAW,IAAI,KAAe,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAClD,8BAA8B;IAC9B,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,oFAAoF;IAC7E,eAAe,CAAC,MAAgB;QACrC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC;IACD,iFAAiF;IAC1E,cAAc,CAAC,MAAgB,IAAa,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAErG,sDAAsD;IAC/C,SAAS,CAAC,MAAc,EAAE,GAAW;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG;YACxB,OAAO,CAAC,CAAC;QACX,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,sDAAsD;IAC/C,SAAS,CAAC,MAAc,EAAE,GAAW;QAC1C,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG;YACxB,OAAO,CAAC,CAAC;QACX,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,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\nimport { Geometry } from \"../Geometry\";\r\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { HalfEdge } from \"./Graph\";\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n/**\r\n * Reference to a HalfEdge node with extra XYZ and UV data.\r\n * @internal\r\n */\r\nexport class NodeXYZUV {\r\n  private _node: HalfEdge;\r\n  private _x: number;\r\n  private _y: number;\r\n  private _z: number;\r\n  private _u: number;\r\n  private _v: number;\r\n\r\n  private constructor(node: HalfEdge, x: number, y: number, z: number, u: number, v: number) {\r\n    this._x = x; this._y = y; this._z = z;\r\n    this._u = u; this._v = v;\r\n    this._node = node;\r\n  }\r\n  /** Set all content directly from args.\r\n   * @returns `this` reference\r\n   */\r\n  public set(node: HalfEdge, x: number, y: number, z: number, u: number, v: number): NodeXYZUV {\r\n    this._x = x; this._y = y; this._z = z;\r\n    this._u = u; this._v = v;\r\n    this._node = node;\r\n    return this;\r\n  }\r\n\r\n  public setFrom(other: NodeXYZUV) {\r\n    this._x = other.x; this._y = other.y; this._z = other.z;\r\n    this._u = other.u; this._v = other.v;\r\n    this._node = other.node;\r\n\r\n  }\r\n  /** Create a `NodeXYZUV` with\r\n   * * x,y,z at ray origin\r\n   * * u,v as dotXY and crossXY for the ray direction with x,y distances from the ray origin.\r\n   */\r\n  public static createNodeAndRayOrigin(node: HalfEdge, ray: Ray3d, result?: NodeXYZUV): NodeXYZUV {\r\n    const x = node.x;\r\n    const y = node.y;\r\n    const z = node.z;\r\n    const dx = x - ray.origin.x;\r\n    const dy = y - ray.origin.y;\r\n    const u = Geometry.dotProductXYXY(dx, dy, ray.direction.x, ray.direction.y);\r\n    const v = Geometry.crossProductXYXY(ray.direction.x, ray.direction.y, dx, dy);\r\n    if (result)\r\n      return result.set(node, x, y, z, u, v);\r\n    return new NodeXYZUV(node, x, y, z, u, v);\r\n  }\r\n  /** Create a `NodeXYZUV` with explicit node, xyz, uv */\r\n  public static create(node: HalfEdge,\r\n    x: number = 0, y: number = 0, z: number = 0, u: number = 0, v: number = 0){\r\n    return new NodeXYZUV(node, x, y, z, u, v);\r\n  }\r\n\r\n  /** Access the node. */\r\n  public get node(): HalfEdge { return this._node; }\r\n  /** Access the x coordinate */\r\n  public get x(): number { return this._x; }\r\n  /** Access the y coordinate */\r\n  public get y(): number { return this._y; }\r\n  /** Access the z coordinate */\r\n  public get z(): number { return this._z; }\r\n  /** Access the u coordinate */\r\n  public get u(): number { return this._u; }\r\n  /** Access the v coordinate */\r\n  public get v(): number { return this._v; }\r\n  /** Access the x,y,z coordinates as Point3d with optional caller-supplied result. */\r\n  public getXYZAsPoint3d(result?: Point3d): Point3d {\r\n    return Point3d.create(this._x, this._y, this._z, result);\r\n  }\r\n  /** Access the uv coordinates as Point2d with optional caller-supplied result. */\r\n  public getUVAsPoint2d(result?: Point2d): Point2d { return Point2d.create(this._u, this._v, result); }\r\n\r\n  /** Toleranced comparison function for u coordinate */\r\n  public classifyU(target: number, tol: number): number {\r\n    const delta = this.u - target;\r\n    if (Math.abs(delta) <= tol)\r\n      return 0;\r\n    return delta >= 0 ? 1 : -1;\r\n  }\r\n\r\n  /** Toleranced comparison function for v coordinate */\r\n  public classifyV(target: number, tol: number): number {\r\n    const delta = target - this._v;\r\n    if (Math.abs(delta) <= tol)\r\n      return 0;\r\n    return delta >= 0 ? 1 : -1;\r\n  }\r\n\r\n}\r\n"]}
+{"version":3,"file":"HalfEdgeNodeXYZUV.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeNodeXYZUV.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAIxD;;GAEG;AACH;;;GAGG;AACH,MAAM,OAAO,SAAS;IAOpB,kBAAkB;IAClB,YAAoB,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS;QACvF,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IACD;;;OAGG;IACI,GAAG,CAAC,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS;QAC9E,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,uBAAuB;IAChB,OAAO,CAAC,KAAgB;QAC7B,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;IAC1B,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAc,EAAE,GAAU,EAAE,MAAkB;QACjF,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9E,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,0DAA0D;IACnD,MAAM,CAAC,MAAM,CAClB,IAAc,EAAE,IAAY,CAAC,EAAE,IAAY,CAAC,EAAE,IAAY,CAAC,EAAE,IAAY,CAAC,EAAE,IAAY,CAAC;QAEzF,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,uBAAuB;IACvB,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD,+BAA+B;IAC/B,IAAW,CAAC;QACV,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IACD,+BAA+B;IAC/B,IAAW,CAAC;QACV,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IACD,+BAA+B;IAC/B,IAAW,CAAC;QACV,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IACD,+BAA+B;IAC/B,IAAW,CAAC;QACV,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IACD,+BAA+B;IAC/B,IAAW,CAAC;QACV,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IACD,oFAAoF;IAC7E,eAAe,CAAC,MAAgB;QACrC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC;IACD,iFAAiF;IAC1E,cAAc,CAAC,MAAgB;QACpC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IACD,sDAAsD;IAC/C,SAAS,CAAC,MAAc,EAAE,GAAW;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG;YACxB,OAAO,CAAC,CAAC;QACX,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,sDAAsD;IAC/C,SAAS,CAAC,MAAc,EAAE,GAAW;QAC1C,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG;YACxB,OAAO,CAAC,CAAC;QACX,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,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\nimport { Geometry } from \"../Geometry\";\r\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { HalfEdge } from \"./Graph\";\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n/**\r\n * Reference to a HalfEdge node with extra XYZ and UV data.\r\n * @internal\r\n */\r\nexport class NodeXYZUV {\r\n  private _node: HalfEdge;\r\n  private _x: number;\r\n  private _y: number;\r\n  private _z: number;\r\n  private _u: number;\r\n  private _v: number;\r\n  /** Constructor */\r\n  private constructor(node: HalfEdge, x: number, y: number, z: number, u: number, v: number) {\r\n    this._x = x;\r\n    this._y = y;\r\n    this._z = z;\r\n    this._u = u;\r\n    this._v = v;\r\n    this._node = node;\r\n  }\r\n  /**\r\n   * Set all content directly from args.\r\n   * @returns `this` reference\r\n   */\r\n  public set(node: HalfEdge, x: number, y: number, z: number, u: number, v: number): NodeXYZUV {\r\n    this._x = x;\r\n    this._y = y;\r\n    this._z = z;\r\n    this._u = u;\r\n    this._v = v;\r\n    this._node = node;\r\n    return this;\r\n  }\r\n  /** Set from `other` */\r\n  public setFrom(other: NodeXYZUV): void {\r\n    this._x = other.x;\r\n    this._y = other.y;\r\n    this._z = other.z;\r\n    this._u = other.u;\r\n    this._v = other.v;\r\n    this._node = other.node;\r\n  }\r\n  /**\r\n   * Create a `NodeXYZUV` with:\r\n   * * node from the given HalfEdge.\r\n   * * x,y,z as the coordinates of `node`.\r\n   * * u as the xy dot product of vectorA with `ray.direction`, where vectorA is the vector from ray origin to\r\n   * `node` coordinates.\r\n   * * v as the xy cross product of `ray.direction` with vectorA.\r\n   */\r\n  public static createNodeAndRayOrigin(node: HalfEdge, ray: Ray3d, result?: NodeXYZUV): NodeXYZUV {\r\n    const x = node.x;\r\n    const y = node.y;\r\n    const z = node.z;\r\n    const dx = x - ray.origin.x;\r\n    const dy = y - ray.origin.y;\r\n    const u = Geometry.dotProductXYXY(dx, dy, ray.direction.x, ray.direction.y);\r\n    const v = Geometry.crossProductXYXY(ray.direction.x, ray.direction.y, dx, dy);\r\n    if (result)\r\n      return result.set(node, x, y, z, u, v);\r\n    return new NodeXYZUV(node, x, y, z, u, v);\r\n  }\r\n  /** Create a `NodeXYZUV` with explicit `node`, xyz, uv. */\r\n  public static create(\r\n    node: HalfEdge, x: number = 0, y: number = 0, z: number = 0, u: number = 0, v: number = 0,\r\n  ): NodeXYZUV {\r\n    return new NodeXYZUV(node, x, y, z, u, v);\r\n  }\r\n  /** Access the node. */\r\n  public get node(): HalfEdge {\r\n    return this._node;\r\n  }\r\n  /** Access the x coordinate. */\r\n  public get x(): number {\r\n    return this._x;\r\n  }\r\n  /** Access the y coordinate. */\r\n  public get y(): number {\r\n    return this._y;\r\n  }\r\n  /** Access the z coordinate. */\r\n  public get z(): number {\r\n    return this._z;\r\n  }\r\n  /** Access the u coordinate. */\r\n  public get u(): number {\r\n    return this._u;\r\n  }\r\n  /** Access the v coordinate. */\r\n  public get v(): number {\r\n    return this._v;\r\n  }\r\n  /** Access the x,y,z coordinates as Point3d with optional caller-supplied result. */\r\n  public getXYZAsPoint3d(result?: Point3d): Point3d {\r\n    return Point3d.create(this._x, this._y, this._z, result);\r\n  }\r\n  /** Access the uv coordinates as Point2d with optional caller-supplied result. */\r\n  public getUVAsPoint2d(result?: Point2d): Point2d {\r\n    return Point2d.create(this._u, this._v, result);\r\n  }\r\n  /** Toleranced comparison function for u coordinate */\r\n  public classifyU(target: number, tol: number): number {\r\n    const delta = this.u - target;\r\n    if (Math.abs(delta) <= tol)\r\n      return 0;\r\n    return delta >= 0 ? 1 : -1;\r\n  }\r\n  /** Toleranced comparison function for v coordinate */\r\n  public classifyV(target: number, tol: number): number {\r\n    const delta = target - this._v;\r\n    if (Math.abs(delta) <= tol)\r\n      return 0;\r\n    return delta >= 0 ? 1 : -1;\r\n  }\r\n}\r\n"]}

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

@@ -4,34 +4,34 @@
 /**
  * Class to accumulate statistics about a stream of signed numbers with tag items.
  * * All sums, counts, extrema, and item values are initialized to zero in the constructor.
- * * Each call to `announceItem (item, value)` updates the various sums, counts, and extrema.
+ * * Each call to `announceItem(item, value)` updates the various sums, counts, and extrema.
  */
 export declare class SignedDataSummary<T> {
-    /** sum of all positive area items */
+    /** Sum of all positive area items. */
     positiveSum: number;
-    /** number of positive area items */
+    /** Number of positive area items. */
     numPositive: number;
-    /** sum of negative area items */
+    /** Sum of negative area items. */
     negativeSum: number;
-    /** number of negative area items */
+    /** Number of negative area items. */
     numNegative: number;
-    /** number of zero area items */
+    /** Number of zero area items. */
     numZero: number;
-    /** the tag item item with the largest positive data */
+    /** The tag item item with the largest positive data. */
     largestPositiveItem?: T;
-    /** the tag item item with the most negative data */
+    /** The tag item item with the most negative data. */
     largestNegativeItem?: T;
     largestPositiveValue: number;
     largestNegativeValue: number;
-    /** array of all negative area items */
+    /** Array of all negative area items. */
     negativeItemArray?: T[];
-    /** array of zero area items */
+    /** Array of zero area items. */
     zeroItemArray?: T[];
-    /** array of positive area items */
+    /** Array of positive area items. */
     positiveItemArray?: T[];
-    /** setup with zero sums and optional arrays */
+    /** Setup with zero sums and optional arrays. */
     constructor(createArrays: boolean);
-    /** update with an item and its data value. */
+    /** Update with an item and its data value. */
     announceItem(item: T, data: number): void;
 }
 //# sourceMappingURL=SignedDataSummary.d.ts.map

package/lib/esm/topology/SignedDataSummary.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SignedDataSummary.d.ts","sourceRoot":"","sources":["../../../src/topology/SignedDataSummary.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH;;;;GAIG;AACH,qBAAa,iBAAiB,CAAC,CAAC;IAC9B,qCAAqC;IAC9B,WAAW,EAAE,MAAM,CAAC;IAC3B,oCAAoC;IAC7B,WAAW,EAAE,MAAM,CAAC;IAC3B,iCAAiC;IAC1B,WAAW,EAAE,MAAM,CAAC;IAC3B,oCAAoC;IAC7B,WAAW,EAAE,MAAM,CAAC;IAC3B,gCAAgC;IACzB,OAAO,EAAE,MAAM,CAAC;IACvB,uDAAuD;IAChD,mBAAmB,CAAC,EAAE,CAAC,CAAC;IAC/B,oDAAoD;IAC7C,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACxB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,oBAAoB,EAAE,MAAM,CAAC;IACpC,uCAAuC;IAChC,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,+BAA+B;IACxB,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;IAC3B,mCAAmC;IAC5B,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,+CAA+C;gBAC5B,YAAY,EAAE,OAAO;IAUxC,8CAA8C;IACvC,YAAY,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM;CAyB1C"}
+{"version":3,"file":"SignedDataSummary.d.ts","sourceRoot":"","sources":["../../../src/topology/SignedDataSummary.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH;;;;GAIG;AACH,qBAAa,iBAAiB,CAAC,CAAC;IAC9B,sCAAsC;IAC/B,WAAW,EAAE,MAAM,CAAC;IAC3B,qCAAqC;IAC9B,WAAW,EAAE,MAAM,CAAC;IAC3B,kCAAkC;IAC3B,WAAW,EAAE,MAAM,CAAC;IAC3B,qCAAqC;IAC9B,WAAW,EAAE,MAAM,CAAC;IAC3B,iCAAiC;IAC1B,OAAO,EAAE,MAAM,CAAC;IACvB,wDAAwD;IACjD,mBAAmB,CAAC,EAAE,CAAC,CAAC;IAC/B,qDAAqD;IAC9C,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACxB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,oBAAoB,EAAE,MAAM,CAAC;IACpC,wCAAwC;IACjC,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,gCAAgC;IACzB,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;IAC3B,oCAAoC;IAC7B,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,gDAAgD;gBAC7B,YAAY,EAAE,OAAO;IAUxC,8CAA8C;IACvC,YAAY,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM;CAyB1C"}

package/lib/esm/topology/SignedDataSummary.js

@@ -8,10 +8,10 @@
 /**
  * Class to accumulate statistics about a stream of signed numbers with tag items.
  * * All sums, counts, extrema, and item values are initialized to zero in the constructor.
- * * Each call to `announceItem (item, value)` updates the various sums, counts, and extrema.
+ * * Each call to `announceItem(item, value)` updates the various sums, counts, and extrema.
  */
 export class SignedDataSummary {
-    /** setup with zero sums and optional arrays */
+    /** Setup with zero sums and optional arrays. */
     constructor(createArrays) {
         this.positiveSum = this.negativeSum = 0.0;
         this.numPositive = this.numNegative = this.numZero = 0.0;
@@ -22,7 +22,7 @@ export class SignedDataSummary {
             this.zeroItemArray = [];
         }
     }
-    /** update with an item and its data value. */
+    /** Update with an item and its data value. */
     announceItem(item, data) {
         if (data < 0) {
             this.numNegative++;