@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

package/lib/esm/topology/HalfEdgeMarkSet.js

@@ -0,0 +1,369 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+import { HalfEdgeMask } from "./Graph";
+/** @packageDocumentation
+ * @module Topology
+ */
+/**
+ * A class to manage a set of edges as both (a) an array of possible members and (b) mask bits.
+ * * A half edge is "in the MarkSet" if its mask is set.
+ * * The MarkSet array is a superset of the half edges in the set.
+ * * Entry of a HalfEdge into the set is indicated by both
+ *    * adding the HalfEdge to the array
+ *    * setting the mask on the half edge, edge, face, or vertex
+ * * Half edges can "go out of the MarkSet" if the mask is cleared.
+ *   * This clearing can happen independently of the array management.
+ *   * Hence the array can contain half edges that are no longer in the MarkSet
+ *   * the "remove" methods monitor this.
+ * * Derived classes expand this concept for edge, vertex, or face MarkSets.
+ *   * a single representative of an edge, vertex, or face is entered to the array
+ *   * all edges around the edge, vertex, or face are marked with the mask
+ *   * Hence the array contains one or more representatives of the edge, face, or vertex
+ * * This allows quick query for both:
+ *   * Testing the mask gives constant time test of whether a HalfEdge is in the set
+ *   * access through the array gives direct access to the HalfEdge pointers
+ * @internal
+ */
+export class AbstractHalfEdgeGraphMarkSet {
+    constructor(graph, mask) {
+        this._graph = graph;
+        this._candidates = [];
+        this._mask = mask;
+        this._graph.clearMask(mask);
+    }
+    /** remove all nodes from the set.
+     * * This pops from the array, clearing masks as the pop.
+     * * Note that it does NOT walk the entire graph to clear masks.
+     */
+    clear() {
+        for (; undefined !== this.chooseAndRemoveAny();) {
+        }
+    }
+    /**
+     * count the number of active members.
+     * * This is the number of HalfEdges which are (a) in the array and (b) masked.
+     */
+    getLength() {
+        let n = 0;
+        for (const candidate of this._candidates) {
+            if (candidate.isMaskSet(this._mask))
+                n++;
+        }
+        return n;
+    }
+    /**
+     * Return the number of candidates.
+     * * This may be more than `getLength ()`
+     * * This will typically only be called by the iterator.
+     */
+    getNumCandidates() {
+        return this._candidates.length;
+    }
+    /** Read property accessor: return the graph */
+    get graph() { return this._graph; }
+    /** return borrowed assets (the mask!) to the graph. */
+    teardown() {
+        this._graph.dropMask(this._mask);
+        this._candidates.length = 0;
+        // this._graph = undefined;
+    }
+    /** (Read property) return the mask used to mark members of the set. */
+    get mask() { return this._mask; }
+    /** pop and return the last node out of the array, without testing if it is still marked. */
+    popAndReturn() {
+        const n = this._candidates.length;
+        if (n === 0)
+            return undefined;
+        const node = this._candidates[n - 1];
+        this._candidates.pop();
+        return node;
+    }
+    /**
+     * * read at an index in the candidates array.
+     * * if that candidate has the mask, return it.
+     * * otherwise return undefined.
+     * * REMARK: This is only to be called by the iterator.
+     */
+    getAtIndex(index) {
+        if (index >= 0 && index < this._candidates.length) {
+            const candidate = this._candidates[index];
+            if (candidate.isMaskSet(this._mask))
+                return candidate;
+        }
+        return undefined;
+    }
+    /** Add a node to the set.  This means
+     * * Set the mask
+     * * push the node on the array
+     * * (BUT!) If the node already has the mask, do nothing.
+     * * This base class method affects only the single given HalfEdge.
+     * * Derived classes for edge, face, and vertex will override this method and also set the mask around the larger structures.
+     * @returns true if the HalfEdge is a new member of the set, false if it was already in the set.
+     */
+    addToSet(candidate) {
+        if (candidate.isMaskSet(this._mask))
+            return false;
+        this._candidates.push(candidate);
+        this.setMaskInScope(candidate);
+        return true;
+    }
+    /** Test if `candidate` is already in the set.
+     * * This examines only the mask.
+     */
+    isCandidateInSet(candidate) {
+        return candidate.isMaskSet(this._mask);
+    }
+    /**
+     * * If the candidate is not marked as a member of the MarkSet, do nothing.
+     * * If the candidate is marked:
+     *   * clear the mask
+     *   * but do NOT search the array.
+     *   * As the array is searched, the candidate will appear and be ignored because the mask is not set.
+     * @param candidate
+     * @return true if the candidate was a member (an hence removed), false if the candidate was not masked.
+     */
+    removeFromSet(candidate) {
+        if (!candidate.isMaskSet(this._mask))
+            return false;
+        this.clearMaskInScope(candidate);
+        return true;
+    }
+    /**
+     *  * Search the array to find any current set member
+     *  * If found, clear its mask and return it.
+     *  * If unmasked HalfEdges are found in the array, they are removed from the array.
+     */
+    chooseAndRemoveAny() {
+        for (;;) {
+            const candidate = this.popAndReturn();
+            if (!candidate)
+                return undefined;
+            if (this.removeFromSet(candidate))
+                return candidate;
+        }
+    }
+    /** Create an iterator over member HalfEdges */
+    [Symbol.iterator]() { return new IterableHalfEdgeMarkSetIterator(this); }
+    /**
+     * * visit all half edges around face.
+     * * Add each to mark set.
+     */
+    addAroundFace(seed) {
+        let p = seed;
+        do {
+            this.addToSet(p);
+            p = p.faceSuccessor;
+        } while (p !== seed);
+    }
+    /**
+     * * visit all half edges around vertex.
+     * * Add each to mark set.
+     */
+    addAroundVertex(seed) {
+        let p = seed;
+        do {
+            this.addToSet(p);
+            p = p.vertexSuccessor;
+        } while (p !== seed);
+    }
+}
+/**
+ * AbstractHalfEdgeGraphMarkSet specialized to manage the masks on individual half edges
+ * @internal
+ */
+export class MarkedHalfEdgeSt extends AbstractHalfEdgeGraphMarkSet {
+    constructor(graph, mask) {
+        super(graph, mask);
+    }
+    /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.
+     * * Returns undefined if unable to get a mask for the graph.
+     * * Undefined return can only happen if the caller is failing to return grabbed masks.
+     */
+    static create(graph) {
+        const mask = graph.grabMask();
+        if (mask === HalfEdgeMask.NULL_MASK)
+            return undefined;
+        return new MarkedHalfEdgeSt(graph, mask);
+    }
+    /**
+     * * Set mask on candidate's edge.
+     * * This overrides the base class implementation.
+     */
+    setMaskInScope(candidate) {
+        candidate.setMask(this._mask);
+    }
+    /**
+     * * Clear mask on candidate's edge.
+     * * This overrides the base class implementation.
+     */
+    clearMaskInScope(candidate) {
+        candidate.clearMask(this._mask);
+    }
+    /**
+     * Return the number of half edges that would be set/cleared when dealing with this candidate.
+     * * This is always 1 for EdgeMarkSet
+     * * return 0 for undefined candidate
+     * @param candidate
+     */
+    countHalfEdgesAroundCandidate(candidate) {
+        if (!candidate)
+            return 0;
+        return 1;
+    }
+}
+/**
+ * AbstractHalfEdgeGraphMarkSet specialized to manage the mask on both sides of edges.
+ * @internal
+ */
+export class MarkedEdgeSet extends AbstractHalfEdgeGraphMarkSet {
+    constructor(graph, mask) {
+        super(graph, mask);
+    }
+    /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.
+     * * Returns undefined if unable to get a mask for the graph.
+     * * Undefined return can only happen if the caller is failing to return grabbed masks.
+     */
+    static create(graph) {
+        const mask = graph.grabMask();
+        if (mask === HalfEdgeMask.NULL_MASK)
+            return undefined;
+        return new MarkedEdgeSet(graph, mask);
+    }
+    /**
+     * * Set mask on candidate's edge.
+     * * This overrides the base class implementation.
+     */
+    setMaskInScope(candidate) {
+        candidate.setMaskAroundEdge(this._mask);
+    }
+    /**
+     * * Clear mask on candidate's edge.
+     * * This overrides the base class implementation.
+     */
+    clearMaskInScope(candidate) {
+        candidate.clearMaskAroundEdge(this._mask);
+    }
+    /**
+     * Return the number of half edges that would be set/cleared when dealing with this candidate.
+     * * This is always 2 for EdgeMarkSet
+     * @param candidate
+     */
+    countHalfEdgesAroundCandidate(candidate) {
+        if (!candidate)
+            return 0;
+        return 2;
+    }
+}
+/**
+ * AbstractHalfEdgeGraphMarkSet specialized to manage the mask around faces
+ * @internal
+ */
+export class MarkedFaceSet extends AbstractHalfEdgeGraphMarkSet {
+    constructor(graph, mask) {
+        super(graph, mask);
+    }
+    /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.
+     * * Returns undefined if unable to get a mask for the graph.
+     * * Undefined return can only happen if the caller is failing to return grabbed masks.
+     */
+    static create(graph) {
+        const mask = graph.grabMask();
+        if (mask === HalfEdgeMask.NULL_MASK)
+            return undefined;
+        return new MarkedFaceSet(graph, mask);
+    }
+    /**
+     * * Set mask on (all nodes around) candidate's face
+     * * This overrides the base class implementation.
+     */
+    setMaskInScope(candidate) {
+        candidate.setMaskAroundFace(this._mask);
+    }
+    /**
+     * * Clear mask on (all nodes around) candidate's face.
+     * * This overrides the base class implementation.
+     */
+    clearMaskInScope(candidate) {
+        candidate.clearMaskAroundFace(this._mask);
+    }
+    /**
+     * Return the number of half edges that would be set/cleared when dealing with this candidate.
+     * * This is the "aroundFace" count.
+     * @param candidate
+     */
+    countHalfEdgesAroundCandidate(candidate) {
+        if (!candidate)
+            return 0;
+        return candidate.countEdgesAroundFace();
+    }
+}
+/**
+ * AbstractHalfEdgeGraphMarkSet specialized to manage the mask around faces
+ * @internal
+ */
+export class MarkedVertexSet extends AbstractHalfEdgeGraphMarkSet {
+    constructor(graph, mask) {
+        super(graph, mask);
+    }
+    /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.
+     * * Returns undefined if unable to get a mask for the graph.
+     * * Undefined return can only happen if the caller is failing to return grabbed masks.
+     */
+    static create(graph) {
+        const mask = graph.grabMask();
+        if (mask === HalfEdgeMask.NULL_MASK)
+            return undefined;
+        return new MarkedVertexSet(graph, mask);
+    }
+    /**
+     * * Set mask on (all nodes around) candidate's face
+     * * This overrides the base class implementation.
+     */
+    setMaskInScope(candidate) {
+        candidate.setMaskAroundVertex(this._mask);
+    }
+    /**
+     * * Clear mask on (all nodes around) candidate's face.
+     * * This overrides the base class implementation.
+     */
+    clearMaskInScope(candidate) {
+        candidate.clearMaskAroundVertex(this._mask);
+    }
+    /**
+     * Return the number of half edges that would be set/cleared when dealing with this candidate.
+     * * This is the "aroundVertex" count.
+     * @param candidate
+     */
+    countHalfEdgesAroundCandidate(candidate) {
+        if (!candidate)
+            return 0;
+        return candidate.countEdgesAroundVertex();
+    }
+}
+/**
+ * Class to act as an iterator over points in a markSet.
+ * * Internal data is:
+ *   * pointer to the parent markSet
+ *   * index of index of the next point to read.
+ * * the parent markSet class
+ */
+class IterableHalfEdgeMarkSetIterator {
+    constructor(markSet) {
+        this._markSet = markSet;
+        this._nextReadIndex = 0;
+    }
+    next() {
+        const n = this._markSet.getNumCandidates();
+        // Walk over candidates that have been quietly de-masked
+        while (this._nextReadIndex < n) {
+            const p = this._markSet.getAtIndex(this._nextReadIndex++);
+            if (p !== undefined)
+                return { done: false, value: p };
+        }
+        return { done: true, value: undefined };
+    }
+    [Symbol.iterator]() { return this; }
+}
+//# sourceMappingURL=HalfEdgeMarkSet.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"HalfEdgeMarkSet.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeMarkSet.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,OAAO,EAA2B,YAAY,EAAE,MAAM,SAAS,CAAC;AAEhE;;GAEG;AACH;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAgB,4BAA4B;IAKhD,YAAsB,KAAoB,EAAE,IAAkB;QAC5D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IACD;;;OAGG;IACI,KAAK;QACV,OAAO,SAAS,KAAK,IAAI,CAAC,kBAAkB,EAAE,GAAG;SAChD;IACH,CAAC;IAED;;;OAGG;IACI,SAAS;QACd,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,WAAW,EAAE;YACxC,IAAI,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,CAAC,EAAE,CAAC;SAC1C;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;OAIG;IACI,gBAAgB;QACrB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;IACjC,CAAC;IACD,+CAA+C;IAC/C,IAAW,KAAK,KAAoB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAEzD,uDAAuD;IAChD,QAAQ;QACb,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,2BAA2B;IAC7B,CAAC;IACD,uEAAuE;IACvE,IAAW,IAAI,KAAmB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEtD,4FAA4F;IAClF,YAAY;QACpB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACI,UAAU,CAAC,KAAa;QAC7B,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;YACjD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAC1C,IAAI,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;gBACjC,OAAO,SAAS,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,QAAQ,CAAC,SAAmB;QACjC,IAAI,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;YACjC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACjC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACI,gBAAgB,CAAC,SAAmB;QACzC,OAAO,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IACD;;;;;;;;OAQG;IACI,aAAa,CAAC,SAAmB;QACtC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,kBAAkB;QACvB,SAAU;YACR,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,SAAS;gBACZ,OAAO,SAAS,CAAC;YACnB,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC;gBAC/B,OAAO,SAAS,CAAC;SACpB;IACH,CAAC;IAkBD,+CAA+C;IACxC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAiC,OAAO,IAAI,+BAA+B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5G;;;OAGG;IACI,aAAa,CAAC,IAAc;QACjC,IAAI,CAAC,GAAG,IAAI,CAAC;QACb,GAAG;YACD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC;SACrB,QAAQ,CAAC,KAAK,IAAI,EAAE;IACvB,CAAC;IAED;;;OAGG;IACI,eAAe,CAAC,IAAc;QACnC,IAAI,CAAC,GAAG,IAAI,CAAC;QACb,GAAG;YACD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC;SACvB,QAAQ,CAAC,KAAK,IAAI,EAAE;IACvB,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,gBAAiB,SAAQ,4BAA4B;IAChE,YAAY,KAAoB,EAAE,IAAkB;QAClD,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,KAAoB;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,YAAY,CAAC,SAAS;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACO,cAAc,CAAC,SAAmB;QAC1C,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACO,gBAAgB,CAAC,SAAmB;QAC5C,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IACD;;;;;OAKG;IACI,6BAA6B,CAAC,SAA+B;QAClE,IAAI,CAAC,SAAS;YACZ,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,aAAc,SAAQ,4BAA4B;IAC7D,YAAY,KAAoB,EAAE,IAAkB;QAClD,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,KAAoB;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,YAAY,CAAC,SAAS;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACO,cAAc,CAAC,SAAmB;QAC1C,SAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACO,gBAAgB,CAAC,SAAmB;QAC5C,SAAS,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;IACD;;;;OAIG;IACI,6BAA6B,CAAC,SAA+B;QAClE,IAAI,CAAC,SAAS;YACZ,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,aAAc,SAAQ,4BAA4B;IAC7D,YAAY,KAAoB,EAAE,IAAkB;QAClD,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,KAAoB;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,YAAY,CAAC,SAAS;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACO,cAAc,CAAC,SAAmB;QAC1C,SAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACO,gBAAgB,CAAC,SAAmB;QAC5C,SAAS,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;IACD;;;;OAIG;IACI,6BAA6B,CAAC,SAA+B;QAClE,IAAI,CAAC,SAAS;YACZ,OAAO,CAAC,CAAC;QACX,OAAO,SAAS,CAAC,oBAAoB,EAAE,CAAC;IAC1C,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,eAAgB,SAAQ,4BAA4B;IAC/D,YAAY,KAAoB,EAAE,IAAkB;QAClD,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,KAAoB;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,YAAY,CAAC,SAAS;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACO,cAAc,CAAC,SAAmB;QAC1C,SAAS,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACO,gBAAgB,CAAC,SAAmB;QAC5C,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC;IACD;;;;OAIG;IACI,6BAA6B,CAAC,SAA+B;QAClE,IAAI,CAAC,SAAS;YACZ,OAAO,CAAC,CAAC;QACX,OAAO,SAAS,CAAC,sBAAsB,EAAE,CAAC;IAC5C,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,+BAA+B;IAGnC,YAAmB,OAAqC;QACtD,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IAC1B,CAAC;IACM,IAAI;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;QAC3C,wDAAwD;QACxD,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,EAAE;YAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;YAC1D,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;SACpC;QACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAqC,CAAC;IAC7E,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAiC,OAAO,IAAI,CAAC,CAAC,CAAC;CACxE","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 { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n/**\r\n * A class to manage a set of edges as both (a) an array of possible members and (b) mask bits.\r\n * * A half edge is \"in the MarkSet\" if its mask is set.\r\n * * The MarkSet array is a superset of the half edges in the set.\r\n * * Entry of a HalfEdge into the set is indicated by both\r\n *    * adding the HalfEdge to the array\r\n *    * setting the mask on the half edge, edge, face, or vertex\r\n * * Half edges can \"go out of the MarkSet\" if the mask is cleared.\r\n *   * This clearing can happen independently of the array management.\r\n *   * Hence the array can contain half edges that are no longer in the MarkSet\r\n *   * the \"remove\" methods monitor this.\r\n * * Derived classes expand this concept for edge, vertex, or face MarkSets.\r\n *   * a single representative of an edge, vertex, or face is entered to the array\r\n *   * all edges around the edge, vertex, or face are marked with the mask\r\n *   * Hence the array contains one or more representatives of the edge, face, or vertex\r\n * * This allows quick query for both:\r\n *   * Testing the mask gives constant time test of whether a HalfEdge is in the set\r\n *   * access through the array gives direct access to the HalfEdge pointers\r\n * @internal\r\n */\r\nexport abstract class AbstractHalfEdgeGraphMarkSet {\r\n  private _graph: HalfEdgeGraph;\r\n  private _candidates: HalfEdge[];\r\n  protected _mask: HalfEdgeMask;\r\n\r\n  protected constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask) {\r\n    this._graph = graph;\r\n    this._candidates = [];\r\n    this._mask = mask;\r\n    this._graph.clearMask(mask);\r\n  }\r\n  /** remove all nodes from the set.\r\n   * * This pops from the array, clearing masks as the pop.\r\n   * * Note that it does NOT walk the entire graph to clear masks.\r\n   */\r\n  public clear() {\r\n    for (; undefined !== this.chooseAndRemoveAny();) {\r\n    }\r\n  }\r\n\r\n  /**\r\n   * count the number of active members.\r\n   * * This is the number of HalfEdges which are (a) in the array and (b) masked.\r\n   */\r\n  public getLength(): number {\r\n    let n = 0;\r\n    for (const candidate of this._candidates) {\r\n      if (candidate.isMaskSet(this._mask)) n++;\r\n    }\r\n    return n;\r\n  }\r\n  /**\r\n   * Return the number of candidates.\r\n   * * This may be more than `getLength ()`\r\n   * * This will typically only be called by the iterator.\r\n   */\r\n  public getNumCandidates(): number {\r\n    return this._candidates.length;\r\n  }\r\n  /** Read property accessor: return the graph */\r\n  public get graph(): HalfEdgeGraph { return this._graph; }\r\n\r\n  /** return borrowed assets (the mask!) to the graph. */\r\n  public teardown() {\r\n    this._graph.dropMask(this._mask);\r\n    this._candidates.length = 0;\r\n    // this._graph = undefined;\r\n  }\r\n  /** (Read property) return the mask used to mark members of the set. */\r\n  public get mask(): HalfEdgeMask { return this._mask; }\r\n\r\n  /** pop and return the last node out of the array, without testing if it is still marked. */\r\n  protected popAndReturn(): HalfEdge | undefined {\r\n    const n = this._candidates.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    const node = this._candidates[n - 1];\r\n    this._candidates.pop();\r\n    return node;\r\n  }\r\n\r\n  /**\r\n   * * read at an index in the candidates array.\r\n   * * if that candidate has the mask, return it.\r\n   * * otherwise return undefined.\r\n   * * REMARK: This is only to be called by the iterator.\r\n   */\r\n  public getAtIndex(index: number): HalfEdge | undefined {\r\n    if (index >= 0 && index < this._candidates.length) {\r\n      const candidate = this._candidates[index];\r\n      if (candidate.isMaskSet(this._mask))\r\n        return candidate;\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /** Add a node to the set.  This means\r\n   * * Set the mask\r\n   * * push the node on the array\r\n   * * (BUT!) If the node already has the mask, do nothing.\r\n   * * This base class method affects only the single given HalfEdge.\r\n   * * Derived classes for edge, face, and vertex will override this method and also set the mask around the larger structures.\r\n   * @returns true if the HalfEdge is a new member of the set, false if it was already in the set.\r\n   */\r\n  public addToSet(candidate: HalfEdge) {\r\n    if (candidate.isMaskSet(this._mask))\r\n      return false;\r\n    this._candidates.push(candidate);\r\n    this.setMaskInScope(candidate);\r\n    return true;\r\n  }\r\n  /** Test if `candidate` is already in the set.\r\n   * * This examines only the mask.\r\n   */\r\n  public isCandidateInSet(candidate: HalfEdge): boolean {\r\n    return candidate.isMaskSet(this._mask);\r\n  }\r\n  /**\r\n   * * If the candidate is not marked as a member of the MarkSet, do nothing.\r\n   * * If the candidate is marked:\r\n   *   * clear the mask\r\n   *   * but do NOT search the array.\r\n   *   * As the array is searched, the candidate will appear and be ignored because the mask is not set.\r\n   * @param candidate\r\n   * @return true if the candidate was a member (an hence removed), false if the candidate was not masked.\r\n   */\r\n  public removeFromSet(candidate: HalfEdge): boolean {\r\n    if (!candidate.isMaskSet(this._mask))\r\n      return false;\r\n    this.clearMaskInScope(candidate);\r\n    return true;\r\n  }\r\n  /**\r\n   *  * Search the array to find any current set member\r\n   *  * If found, clear its mask and return it.\r\n   *  * If unmasked HalfEdges are found in the array, they are removed from the array.\r\n   */\r\n  public chooseAndRemoveAny(): HalfEdge | undefined {\r\n    for (; ;) {\r\n      const candidate = this.popAndReturn();\r\n      if (!candidate)\r\n        return undefined;\r\n      if (this.removeFromSet(candidate))\r\n        return candidate;\r\n    }\r\n  }\r\n  /** Set mask on candidate -- i.e. edge, face, vertex, or single half edge as required.\r\n   * * Base class only changes the candidate mask.\r\n   * * Derived classes change more masks around edge, face, or vertex.\r\n   */\r\n  protected abstract setMaskInScope(candidate: HalfEdge | undefined): void;\r\n\r\n  /** Clear mask on candidate -- i.e. edge, face, vertex, or single half edge as required.\r\n   * * Base class only changes the candidate mask.\r\n   * * Derived classes change more masks around edge, face, or vertex.\r\n   */\r\n  protected abstract clearMaskInScope(candidate: HalfEdge | undefined): void;\r\n  /**\r\n   * Return the number of half edges that would be set/cleared when dealing with this candidate.\r\n   * * This is always 1 for HalfEdgeMarkSet\r\n   * @param candidate\r\n   */\r\n  public abstract countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number;\r\n  /** Create an iterator over member HalfEdges */\r\n  public [Symbol.iterator](): IterableIterator<HalfEdge> { return new IterableHalfEdgeMarkSetIterator(this); }\r\n  /**\r\n   * * visit all half edges around face.\r\n   * * Add each to mark set.\r\n   */\r\n  public addAroundFace(seed: HalfEdge): void {\r\n    let p = seed;\r\n    do {\r\n      this.addToSet(p);\r\n      p = p.faceSuccessor;\r\n    } while (p !== seed);\r\n  }\r\n\r\n  /**\r\n   * * visit all half edges around vertex.\r\n   * * Add each to mark set.\r\n   */\r\n  public addAroundVertex(seed: HalfEdge): void {\r\n    let p = seed;\r\n    do {\r\n      this.addToSet(p);\r\n      p = p.vertexSuccessor;\r\n    } while (p !== seed);\r\n  }\r\n}\r\n\r\n/**\r\n * AbstractHalfEdgeGraphMarkSet specialized to manage the masks on individual half edges\r\n * @internal\r\n */\r\nexport class MarkedHalfEdgeSt extends AbstractHalfEdgeGraphMarkSet {\r\n  constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask) {\r\n    super(graph, mask);\r\n  }\r\n  /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.\r\n   * * Returns undefined if unable to get a mask for the graph.\r\n   * * Undefined return can only happen if the caller is failing to return grabbed masks.\r\n   */\r\n  public static create(graph: HalfEdgeGraph): MarkedHalfEdgeSt | undefined {\r\n    const mask = graph.grabMask();\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return undefined;\r\n    return new MarkedHalfEdgeSt(graph, mask);\r\n  }\r\n\r\n  /**\r\n   * * Set mask on candidate's edge.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected setMaskInScope(candidate: HalfEdge) {\r\n    candidate.setMask(this._mask);\r\n  }\r\n\r\n  /**\r\n   * * Clear mask on candidate's edge.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected clearMaskInScope(candidate: HalfEdge) {\r\n    candidate.clearMask(this._mask);\r\n  }\r\n  /**\r\n   * Return the number of half edges that would be set/cleared when dealing with this candidate.\r\n   * * This is always 1 for EdgeMarkSet\r\n   * * return 0 for undefined candidate\r\n   * @param candidate\r\n   */\r\n  public countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number {\r\n    if (!candidate)\r\n      return 0;\r\n    return 1;\r\n  }\r\n}\r\n\r\n/**\r\n * AbstractHalfEdgeGraphMarkSet specialized to manage the mask on both sides of edges.\r\n * @internal\r\n */\r\nexport class MarkedEdgeSet extends AbstractHalfEdgeGraphMarkSet {\r\n  constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask) {\r\n    super(graph, mask);\r\n  }\r\n  /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.\r\n   * * Returns undefined if unable to get a mask for the graph.\r\n   * * Undefined return can only happen if the caller is failing to return grabbed masks.\r\n   */\r\n  public static create(graph: HalfEdgeGraph): MarkedEdgeSet | undefined {\r\n    const mask = graph.grabMask();\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return undefined;\r\n    return new MarkedEdgeSet(graph, mask);\r\n  }\r\n\r\n  /**\r\n   * * Set mask on candidate's edge.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected setMaskInScope(candidate: HalfEdge) {\r\n    candidate.setMaskAroundEdge(this._mask);\r\n  }\r\n\r\n  /**\r\n   * * Clear mask on candidate's edge.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected clearMaskInScope(candidate: HalfEdge) {\r\n    candidate.clearMaskAroundEdge(this._mask);\r\n  }\r\n  /**\r\n   * Return the number of half edges that would be set/cleared when dealing with this candidate.\r\n   * * This is always 2 for EdgeMarkSet\r\n   * @param candidate\r\n   */\r\n  public countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number {\r\n    if (!candidate)\r\n      return 0;\r\n    return 2;\r\n  }\r\n}\r\n\r\n/**\r\n * AbstractHalfEdgeGraphMarkSet specialized to manage the mask around faces\r\n * @internal\r\n */\r\nexport class MarkedFaceSet extends AbstractHalfEdgeGraphMarkSet {\r\n  constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask) {\r\n    super(graph, mask);\r\n  }\r\n  /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.\r\n   * * Returns undefined if unable to get a mask for the graph.\r\n   * * Undefined return can only happen if the caller is failing to return grabbed masks.\r\n   */\r\n  public static create(graph: HalfEdgeGraph): MarkedFaceSet | undefined {\r\n    const mask = graph.grabMask();\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return undefined;\r\n    return new MarkedFaceSet(graph, mask);\r\n  }\r\n\r\n  /**\r\n   * * Set mask on (all nodes around) candidate's face\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected setMaskInScope(candidate: HalfEdge) {\r\n    candidate.setMaskAroundFace(this._mask);\r\n  }\r\n\r\n  /**\r\n   * * Clear mask on (all nodes around) candidate's face.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected clearMaskInScope(candidate: HalfEdge) {\r\n    candidate.clearMaskAroundFace(this._mask);\r\n  }\r\n  /**\r\n   * Return the number of half edges that would be set/cleared when dealing with this candidate.\r\n   * * This is the \"aroundFace\" count.\r\n   * @param candidate\r\n   */\r\n  public countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number {\r\n    if (!candidate)\r\n      return 0;\r\n    return candidate.countEdgesAroundFace();\r\n  }\r\n}\r\n/**\r\n * AbstractHalfEdgeGraphMarkSet specialized to manage the mask around faces\r\n * @internal\r\n */\r\nexport class MarkedVertexSet extends AbstractHalfEdgeGraphMarkSet {\r\n  constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask) {\r\n    super(graph, mask);\r\n  }\r\n  /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.\r\n   * * Returns undefined if unable to get a mask for the graph.\r\n   * * Undefined return can only happen if the caller is failing to return grabbed masks.\r\n   */\r\n  public static create(graph: HalfEdgeGraph): MarkedVertexSet | undefined {\r\n    const mask = graph.grabMask();\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return undefined;\r\n    return new MarkedVertexSet(graph, mask);\r\n  }\r\n\r\n  /**\r\n   * * Set mask on (all nodes around) candidate's face\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected setMaskInScope(candidate: HalfEdge) {\r\n    candidate.setMaskAroundVertex(this._mask);\r\n  }\r\n\r\n  /**\r\n   * * Clear mask on (all nodes around) candidate's face.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected clearMaskInScope(candidate: HalfEdge) {\r\n    candidate.clearMaskAroundVertex(this._mask);\r\n  }\r\n  /**\r\n   * Return the number of half edges that would be set/cleared when dealing with this candidate.\r\n   * * This is the \"aroundVertex\" count.\r\n   * @param candidate\r\n   */\r\n  public countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number {\r\n    if (!candidate)\r\n      return 0;\r\n    return candidate.countEdgesAroundVertex();\r\n  }\r\n}\r\n\r\n/**\r\n * Class to act as an iterator over points in a markSet.\r\n * * Internal data is:\r\n *   * pointer to the parent markSet\r\n *   * index of index of the next point to read.\r\n * * the parent markSet class\r\n */\r\nclass IterableHalfEdgeMarkSetIterator implements Iterator<HalfEdge> {\r\n  private _markSet: AbstractHalfEdgeGraphMarkSet;\r\n  private _nextReadIndex: number;\r\n  public constructor(markSet: AbstractHalfEdgeGraphMarkSet) {\r\n    this._markSet = markSet;\r\n    this._nextReadIndex = 0;\r\n  }\r\n  public next(): IteratorResult<HalfEdge> {\r\n    const n = this._markSet.getNumCandidates();\r\n    // Walk over candidates that have been quietly de-masked\r\n    while (this._nextReadIndex < n) {\r\n      const p = this._markSet.getAtIndex(this._nextReadIndex++);\r\n      if (p !== undefined)\r\n        return { done: false, value: p };\r\n    }\r\n    return { done: true, value: undefined } as any as IteratorResult<HalfEdge>;\r\n  }\r\n\r\n  public [Symbol.iterator](): IterableIterator<HalfEdge> { return this; }\r\n}\r\n"]}

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

@@ -0,0 +1,51 @@
+import { Point2d } from "../geometry3d/Point2dVector2d";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+import { Ray3d } from "../geometry3d/Ray3d";
+import { HalfEdge } from "./Graph";
+/** @packageDocumentation
+ * @module Topology
+ */
+/**
+ * Reference to a HalfEdge node with extra XYZ and UV data.
+ * @internal
+ */
+export declare class NodeXYZUV {
+    private _node;
+    private _x;
+    private _y;
+    private _z;
+    private _u;
+    private _v;
+    private constructor();
+    /** Set all content directly from args.
+     * @returns `this` reference
+     */
+    set(node: HalfEdge, x: number, y: number, z: number, u: number, v: number): NodeXYZUV;
+    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.
+     */
+    static createNodeAndRayOrigin(node: HalfEdge, ray: Ray3d, result?: NodeXYZUV): NodeXYZUV;
+    /** Access the node. */
+    get node(): HalfEdge;
+    /** Access the x coordinate */
+    get x(): number;
+    /** Access the y coordinate */
+    get y(): number;
+    /** Access the z coordinate */
+    get z(): number;
+    /** Access the u coordinate */
+    get u(): number;
+    /** Access the v coordinate */
+    get v(): number;
+    /** Access the x,y,z coordinates as Point3d with optional caller-supplied result. */
+    getXYZAsPoint3d(result?: Point3d): Point3d;
+    /** Access the uv coordinates as Point2d with optional caller-supplied result. */
+    getUVAsPoint2d(result?: Point2d): Point2d;
+    /** Toleranced comparison function for u coordinate */
+    classifyU(target: number, tol: number): number;
+    /** Toleranced comparison function for v coordinate */
+    classifyV(target: number, tol: number): number;
+}
+//# sourceMappingURL=HalfEdgeNodeXYZUV.d.ts.map

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

@@ -0,0 +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;IAa/F,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"}

package/lib/esm/topology/HalfEdgeNodeXYZUV.js

@@ -0,0 +1,93 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+import { Geometry } from "../Geometry";
+import { Point2d } from "../geometry3d/Point2dVector2d";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+/** @packageDocumentation
+ * @module Topology
+ */
+/**
+ * Reference to a HalfEdge node with extra XYZ and UV data.
+ * @internal
+ */
+export class NodeXYZUV {
+    constructor(node, x, y, z, u, v) {
+        this._x = x;
+        this._y = y;
+        this._z = z;
+        this._u = u;
+        this._v = v;
+        this._node = node;
+    }
+    /** Set all content directly from args.
+     * @returns `this` reference
+     */
+    set(node, x, y, z, u, v) {
+        this._x = x;
+        this._y = y;
+        this._z = z;
+        this._u = u;
+        this._v = v;
+        this._node = node;
+        return this;
+    }
+    setFrom(other) {
+        this._x = other.x;
+        this._y = other.y;
+        this._z = other.z;
+        this._u = other.u;
+        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.
+     */
+    static createNodeAndRayOrigin(node, ray, result) {
+        const x = node.x;
+        const y = node.y;
+        const z = node.z;
+        const dx = x - ray.origin.x;
+        const dy = y - ray.origin.y;
+        const u = Geometry.dotProductXYXY(dx, dy, ray.direction.x, ray.direction.y);
+        const v = Geometry.crossProductXYXY(ray.direction.x, ray.direction.y, dx, dy);
+        if (result)
+            return result.set(node, x, y, z, u, v);
+        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; }
+    /** 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); }
+    /** Toleranced comparison function for u coordinate */
+    classifyU(target, tol) {
+        const delta = this.u - target;
+        if (Math.abs(delta) <= tol)
+            return 0;
+        return delta >= 0 ? 1 : -1;
+    }
+    /** Toleranced comparison function for v coordinate */
+    classifyV(target, tol) {
+        const delta = target - this._v;
+        if (Math.abs(delta) <= tol)
+            return 0;
+        return delta >= 0 ? 1 : -1;
+    }
+}
+//# sourceMappingURL=HalfEdgeNodeXYZUV.js.map

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

@@ -0,0 +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;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\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"]}

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

@@ -0,0 +1,34 @@
+import { Point3d } from "../geometry3d/Point3dVector3d";
+import { Ray3d } from "../geometry3d/Ray3d";
+import { HalfEdge } from "./Graph";
+import { HalfEdgePositionDetail } from "./HalfEdgePositionDetail";
+export declare enum RayClassification {
+    RC_NoHits = 0,
+    RC_TargetOnVertex = 1,
+    RC_TargetOnEdge = 2,
+    RC_Bracket = 3,
+    RC_TargetBefore = 4,
+    RC_TargetAfter = 5
+}
+export declare class PointSearchContext {
+    private _tol;
+    private constructor();
+    static create(tol?: number): PointSearchContext;
+    private panic;
+    reAimFromEdge(edgeHit: HalfEdgePositionDetail, ray: Ray3d, targetDistance: number): HalfEdgePositionDetail;
+    reAimFromVertex(searchBase: HalfEdgePositionDetail, ray: Ray3d, targetDistance: number): HalfEdgePositionDetail;
+    reAimAroundFace(faceNode: HalfEdge, ray: Ray3d, targetDistance: number, // !< distance to target point
+    lastBefore: HalfEdgePositionDetail, // CALLER CREATED -- reset as first hit on negative side of ray.
+    firstAfter: HalfEdgePositionDetail): RayClassification;
+    /**
+     * Set (replace contents) ray with
+     * * `origin` at start
+     * * `direction` is unit vector from start towards target
+     * * `a` is distance from start to target.
+     * @param start existing position
+     * @param target target xy coordinates
+     * @param ray ray to update
+     */
+    setSearchRay(start: HalfEdgePositionDetail, target: Point3d, ray: Ray3d): boolean;
+}
+//# sourceMappingURL=HalfEdgePointInGraphSearch.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"HalfEdgePointInGraphSearch.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgePointInGraphSearch.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEnC,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAGlE,oBAAY,iBAAiB;IAC3B,SAAS,IAAA;IACT,iBAAiB,IAAA;IACjB,eAAe,IAAA;IACf,UAAU,IAAA;IACV,eAAe,IAAA;IACf,cAAc,IAAA;CACf;AAGD,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO;WAGO,MAAM,CAAC,GAAG,GAAE,MAAqC;IAG/D,OAAO,CAAC,KAAK;IAKN,aAAa,CAClB,OAAO,EAAE,sBAAsB,EAC/B,GAAG,EAAE,KAAK,EACV,cAAc,EAAE,MAAM,GAAG,sBAAsB;IAgE1C,eAAe,CACpB,UAAU,EAAE,sBAAsB,EAClC,GAAG,EAAE,KAAK,EACV,cAAc,EAAE,MAAM,GAAG,sBAAsB;IAyD1C,eAAe,CACpB,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,KAAK,EACV,cAAc,EAAE,MAAM,EAAG,8BAA8B;IACvD,UAAU,EAAE,sBAAsB,EAAI,gEAAgE;IACtG,UAAU,EAAE,sBAAsB,GAAG,iBAAiB;IAoExD;;;;;;;;OAQG;IACI,YAAY,CAAC,KAAK,EAAE,sBAAsB,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,GAAG,OAAO;CASzF"}