@graphty/algorithms 2.1.1 → 2.2.0

package/dist/src/indexed/delta-pagerank.js

@@ -0,0 +1,428 @@
+/**
+ * The arcs of each row reordered into logical edge order: the legacy adjacency's neighbour order.
+ * @param s - A directed snapshot
+ * @returns Arc indices, grouped by row as `rowPtr` groups them
+ */
+function arcsInEdgeOrder(s) {
+    const order = new Uint32Array(s.arcCount);
+    const next = s.rowPtr.slice(0, s.nodeCount);
+    const { src } = s.edgeList();
+    for (let e = 0; e < s.edgeCount; e++) {
+        order[next[src[e]]++] = s.edgeToArc[e];
+    }
+    return order;
+}
+/**
+ * Sum of the arc weights (1 where there are none) per node, added in `order`.
+ * @param s - The snapshot
+ * @param order - Its arcs in the order to add them
+ * @param weights - Per-arc weights, or null for 1 each
+ * @returns The out-weight per node index
+ */
+function outWeights(s, order, weights) {
+    const out = new Float64Array(s.nodeCount);
+    for (let u = 0; u < s.nodeCount; u++) {
+        let total = 0;
+        for (let k = s.rowPtr[u]; k < s.rowPtr[u + 1]; k++) {
+            total += weights === null ? 1 : weights[order[k]];
+        }
+        out[u] = total;
+    }
+    return out;
+}
+/**
+ * Divide by the sum in place, when the sum is positive.
+ * @param v - The vector to normalise
+ */
+function normalize(v) {
+    let sum = 0;
+    for (let i = 0; i < v.length; i++) {
+        sum += v[i];
+    }
+    if (sum > 0) {
+        for (let i = 0; i < v.length; i++) {
+            v[i] /= sum;
+        }
+    }
+}
+/**
+ * A normalised copy of a per-node vector, or null when absent.
+ * @param v - The caller's vector
+ * @param n - The node count it must match
+ * @param name - The option name, for the error message
+ * @returns The normalised copy, or null
+ */
+function nodeVector(v, n, name) {
+    if (v === undefined) {
+        return null;
+    }
+    if (v.length !== n) {
+        throw new RangeError(`${name} has ${String(v.length)} entries; the graph has ${String(n)} nodes`);
+    }
+    const out = Float64Array.from(v);
+    normalize(out);
+    return out;
+}
+/**
+ * The per-arc weight override, checked against the arc count, or the snapshot's own weights.
+ * @param s - The snapshot
+ * @param w - The caller's override
+ * @returns The weights to use, or null when the snapshot has none and no override is given
+ */
+function arcWeights(s, w) {
+    if (w === undefined) {
+        return s.weights;
+    }
+    if (w.length !== s.arcCount) {
+        throw new RangeError(`weights has ${String(w.length)} entries; the graph has ${String(s.arcCount)} arcs`);
+    }
+    return w;
+}
+function checkDamping(d) {
+    if (d < 0 || d > 1) {
+        throw new Error("Damping factor must be between 0 and 1");
+    }
+}
+/**
+ * PageRank by power iteration with an L-infinity stopping rule: the `useDelta` path of the legacy
+ * `pageRank`, which it takes when `useDelta !== false` and the graph has more than 100 nodes. Its
+ * other path runs the same iteration, so this answers both. A node with no out-arcs is dangling
+ * and its rank is spread over every node (by the personalization when one is given); a node whose
+ * out-weights sum to 0 but has arcs is not dangling and passes nothing on, as in legacy.
+ *
+ * Not in the `indexed` namespace: it propagates no deltas, and it exists only so the legacy
+ * `pageRank` facade can reproduce legacy arithmetic exactly. Snapshot callers use
+ * `indexed.pageRank`.
+ * @param s - A DIRECTED snapshot
+ * @param o - Algorithm options
+ * @returns The scores, the iteration count and the convergence flag
+ * @internal
+ */
+export function deltaPageRank(s, o = {}) {
+    if (!s.directed) {
+        throw new Error("PageRank requires a directed graph");
+    }
+    const d = o.dampingFactor ?? 0.85;
+    checkDamping(d);
+    const n = s.nodeCount;
+    const maxIter = o.maxIterations ?? 100;
+    const tol = o.tolerance ?? 1e-6;
+    if (n === 0) {
+        return { scores: new Float64Array(0), iterations: 0, converged: true };
+    }
+    const personal = nodeVector(o.personalization, n, "personalization");
+    let rank = nodeVector(o.initialRanks, n, "initialRanks") ?? new Float64Array(n).fill(1 / n);
+    const order = arcsInEdgeOrder(s);
+    const weights = o.weighted === true ? arcWeights(s, o.weights) : null;
+    const outW = outWeights(s, order, weights);
+    let next = new Float64Array(n);
+    let iterations = 0;
+    let converged = false;
+    while (iterations < maxIter && !converged) {
+        iterations++;
+        let dangling = 0;
+        for (let u = 0; u < n; u++) {
+            if (s.rowPtr[u] === s.rowPtr[u + 1]) {
+                dangling += rank[u];
+            }
+        }
+        const spread = dangling > 0 ? (d * dangling) / n : 0;
+        for (let v = 0; v < n; v++) {
+            next[v] = personal === null ? (1 - d) / n + spread : (1 - d) * personal[v] + spread * personal[v];
+        }
+        for (let u = 0; u < n; u++) {
+            const ow = outW[u];
+            if (ow > 0) {
+                for (let k = s.rowPtr[u]; k < s.rowPtr[u + 1]; k++) {
+                    const a = order[k];
+                    next[s.colIdx[a]] += d * rank[u] * ((weights === null ? 1 : weights[a]) / ow);
+                }
+            }
+        }
+        let maxDiff = 0;
+        for (let v = 0; v < n; v++) {
+            maxDiff = Math.max(maxDiff, Math.abs(next[v] - rank[v]));
+        }
+        [rank, next] = [next, rank];
+        converged = maxDiff < tol;
+    }
+    return { scores: rank, iterations, converged };
+}
+/**
+ * Delta-propagating PageRank that keeps its state between calls, as the legacy `DeltaPageRank`
+ * does: each round, every active node with a delta of at least `deltaThreshold` adds it to its
+ * score and pushes `dampingFactor * delta` along its out-arcs; the teleport share is added to
+ * every node's next delta each round, and the scores are normalised at the end. The out-weights
+ * that split a delta are the WEIGHTED out-degrees even when `weighted` is false -- legacy's
+ * arithmetic, kept so the two agree.
+ * @public
+ */
+export class DeltaPageRank {
+    /**
+     * Start every node at score 0 with a pending delta of 1 / n, all active.
+     * @param s - A DIRECTED snapshot
+     * @param o - The per-arc weight override
+     */
+    constructor(s, o = {}) {
+        if (!s.directed) {
+            throw new Error("DeltaPageRank requires a directed graph");
+        }
+        this.s = s;
+        this.order = arcsInEdgeOrder(s);
+        this.weights = arcWeights(s, o.weights);
+        this.outW = outWeights(s, this.order, this.weights);
+        this.scores = new Float64Array(s.nodeCount);
+        this.deltas = new Float64Array(s.nodeCount).fill(1 / s.nodeCount);
+        this.active = new Uint8Array(s.nodeCount).fill(1);
+    }
+    /**
+     * Propagate deltas until none is active, every pending delta is below `tolerance`, or
+     * `maxIterations` rounds have run; then normalise the scores.
+     * @param o - Algorithm options
+     * @returns A copy of the scores per node index
+     */
+    compute(o = {}) {
+        return this.run(o, false);
+    }
+    /**
+     * Make only the given nodes and their in- and out-neighbours active, then {@link compute}.
+     * An index outside the graph names nothing and is skipped, but a non-empty `modified` still
+     * starts a round, as legacy does for an id the graph lacks. The snapshot is frozen, so this
+     * re-runs over the same graph; a changed graph is a new snapshot and a new engine.
+     * @param modified - Node indices to reactivate
+     * @param o - Algorithm options
+     * @returns A copy of the scores per node index
+     */
+    update(modified, o = {}) {
+        const { s } = this;
+        const rev = s.reverse();
+        const active = new Uint8Array(s.nodeCount);
+        for (let i = 0; i < modified.length; i++) {
+            const u = modified[i];
+            if (!Number.isInteger(u) || u < 0 || u >= s.nodeCount) {
+                continue;
+            }
+            active[u] = 1;
+            for (let a = rev.rowPtr[u]; a < rev.rowPtr[u + 1]; a++) {
+                active[rev.colIdx[a]] = 1;
+            }
+            for (let a = s.rowPtr[u]; a < s.rowPtr[u + 1]; a++) {
+                active[s.colIdx[a]] = 1;
+            }
+        }
+        this.active = active;
+        return this.run(o, modified.length > 0);
+    }
+    /**
+     * The propagation rounds behind {@link compute} and {@link update}.
+     * @param o - Algorithm options
+     * @param startRound - Run the first round even when no node is active
+     * @returns A copy of the scores per node index
+     */
+    run(o, startRound) {
+        const d = o.dampingFactor ?? 0.85;
+        const tol = o.tolerance ?? 1e-6;
+        const maxIter = o.maxIterations ?? 100;
+        const threshold = o.deltaThreshold ?? tol / 10;
+        checkDamping(d);
+        const { s, order, scores } = this;
+        const n = s.nodeCount;
+        if (n === 0) {
+            return new Float64Array(0);
+        }
+        const personal = nodeVector(o.personalization, n, "personalization");
+        const weights = o.weighted === true ? this.weights : null;
+        const randomJump = (1 - d) / n;
+        let activeCount = this.active.reduce((sum, x) => sum + x, 0);
+        for (let it = 0; (activeCount > 0 || (it === 0 && startRound)) && it < maxIter; it++) {
+            const next = new Float64Array(n);
+            let dangling = 0;
+            for (let u = 0; u < n; u++) {
+                if (s.rowPtr[u] === s.rowPtr[u + 1]) {
+                    dangling += scores[u] + this.deltas[u];
+                }
+            }
+            if (dangling > 0) {
+                const spread = (d * dangling) / n;
+                for (let v = 0; v < n; v++) {
+                    next[v] += personal === null ? spread : spread * personal[v];
+                }
+            }
+            for (let u = 0; u < n; u++) {
+                const delta = this.deltas[u];
+                if (this.active[u] === 0 || Math.abs(delta) < threshold) {
+                    continue;
+                }
+                scores[u] += delta;
+                const ow = this.outW[u];
+                if (ow > 0) {
+                    for (let k = s.rowPtr[u]; k < s.rowPtr[u + 1]; k++) {
+                        const a = order[k];
+                        next[s.colIdx[a]] += d * delta * ((weights === null ? 1 : weights[a]) / ow);
+                    }
+                }
+            }
+            let maxDelta = 0;
+            activeCount = 0;
+            for (let v = 0; v < n; v++) {
+                next[v] += personal === null ? randomJump : (1 - d) * personal[v];
+                const size = Math.abs(next[v]);
+                maxDelta = Math.max(maxDelta, size);
+                this.active[v] = size >= threshold ? 1 : 0;
+                activeCount += this.active[v];
+            }
+            this.deltas = next;
+            if (maxDelta < tol) {
+                break;
+            }
+        }
+        normalize(scores);
+        return scores.slice();
+    }
+}
+/**
+ * A binary max-heap of node indices that allows duplicates and breaks ties exactly as the legacy
+ * `PriorityQueue` with comparator `(a, b) => b - a` does, so both dequeue in the same order.
+ */
+class DuplicateMaxHeap {
+    constructor() {
+        this.node = [];
+        this.key = [];
+    }
+    isEmpty() {
+        return this.node.length === 0;
+    }
+    push(node, key) {
+        this.node.push(node);
+        this.key.push(key);
+        let i = this.node.length - 1;
+        while (i > 0) {
+            const p = (i - 1) >> 1;
+            if (!(this.key[p] - this.key[i] < 0)) {
+                break;
+            }
+            this.swap(i, p);
+            i = p;
+        }
+    }
+    pop() {
+        const top = this.node[0];
+        const lastNode = this.node.pop();
+        const lastKey = this.key.pop();
+        if (this.node.length === 0) {
+            return top;
+        }
+        this.node[0] = lastNode;
+        this.key[0] = lastKey;
+        let i = 0;
+        for (;;) {
+            const l = 2 * i + 1;
+            const r = l + 1;
+            let t = i;
+            if (l < this.node.length && this.key[t] - this.key[l] < 0) {
+                t = l;
+            }
+            if (r < this.node.length && this.key[t] - this.key[r] < 0) {
+                t = r;
+            }
+            if (t === i) {
+                return top;
+            }
+            this.swap(i, t);
+            i = t;
+        }
+    }
+    swap(i, j) {
+        [this.node[i], this.node[j]] = [this.node[j], this.node[i]];
+        [this.key[i], this.key[j]] = [this.key[j], this.key[i]];
+    }
+}
+/**
+ * Delta PageRank processed one node at a time, largest pending delta first, keeping its state
+ * between calls as the legacy `PriorityDeltaPageRank` does. `maxIterations` counts processed
+ * nodes; every 1000 of them the run stops if no pending delta reaches `tolerance`. At the end
+ * each pending delta of at least `deltaThreshold` is added to its score (and stays pending), the
+ * teleport share is added, and the scores are normalised. The out-weights are the WEIGHTED
+ * out-degrees even when `weighted` is false, as in legacy.
+ * @public
+ */
+export class PriorityDeltaPageRank {
+    /**
+     * Start every node at score 0 with a pending delta of 1 / n, queued in index order.
+     * @param s - A DIRECTED snapshot
+     * @param o - The per-arc weight override
+     */
+    constructor(s, o = {}) {
+        this.heap = new DuplicateMaxHeap();
+        if (!s.directed) {
+            throw new Error("PriorityDeltaPageRank requires a directed graph");
+        }
+        this.s = s;
+        this.order = arcsInEdgeOrder(s);
+        this.weights = arcWeights(s, o.weights);
+        this.outW = outWeights(s, this.order, this.weights);
+        this.scores = new Float64Array(s.nodeCount);
+        this.deltas = new Float64Array(s.nodeCount).fill(1 / s.nodeCount);
+        for (let u = 0; u < s.nodeCount; u++) {
+            this.heap.push(u, 1 / s.nodeCount);
+        }
+    }
+    /**
+     * Process queued nodes, largest pending delta first.
+     * @param o - Algorithm options; `personalization` is ignored
+     * @returns A copy of the scores per node index
+     */
+    computeWithPriority(o = {}) {
+        const d = o.dampingFactor ?? 0.85;
+        const tol = o.tolerance ?? 1e-6;
+        const maxIter = o.maxIterations ?? 100;
+        const threshold = o.deltaThreshold ?? tol / 10;
+        const { s, order, scores, deltas, heap } = this;
+        const n = s.nodeCount;
+        const weights = o.weighted === true ? this.weights : null;
+        let iteration = 0;
+        let processed = 0;
+        while (!heap.isEmpty() && iteration < maxIter) {
+            const u = heap.pop();
+            const delta = deltas[u];
+            if (Math.abs(delta) < threshold) {
+                continue;
+            }
+            scores[u] += delta;
+            deltas[u] = 0;
+            const ow = this.outW[u];
+            if (ow > 0) {
+                for (let k = s.rowPtr[u]; k < s.rowPtr[u + 1]; k++) {
+                    const a = order[k];
+                    const v = s.colIdx[a];
+                    const pending = deltas[v] + d * delta * ((weights === null ? 1 : weights[a]) / ow);
+                    deltas[v] = pending;
+                    if (Math.abs(pending) >= threshold) {
+                        heap.push(v, Math.abs(pending));
+                    }
+                }
+            }
+            processed++;
+            if (processed % 1000 === 0) {
+                let maxDelta = 0;
+                for (let v = 0; v < n; v++) {
+                    maxDelta = Math.max(maxDelta, Math.abs(deltas[v]));
+                }
+                if (maxDelta < tol) {
+                    break;
+                }
+            }
+            iteration++;
+        }
+        const teleport = (1 - d) / n;
+        for (let v = 0; v < n; v++) {
+            if (Math.abs(deltas[v]) >= threshold) {
+                scores[v] += deltas[v];
+            }
+            scores[v] += teleport;
+        }
+        normalize(scores);
+        return scores.slice();
+    }
+}
+//# sourceMappingURL=delta-pagerank.js.map

package/dist/src/indexed/delta-pagerank.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"delta-pagerank.js","sourceRoot":"","sources":["../../../src/indexed/delta-pagerank.ts"],"names":[],"mappings":"AAwDA;;;;GAIG;AACH,SAAS,eAAe,CAAC,CAAgB;IACrC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;IAC5C,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,CAAgB,EAAE,KAAU,EAAE,OAA6B;IAC3E,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,KAAK,IAAI,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACnB,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,CAAM;IACrB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;QAChB,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,CAA4B,EAAE,CAAS,EAAE,IAAY;IACrE,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjB,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,QAAQ,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,2BAA2B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACtG,CAAC;IACD,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,SAAS,CAAC,GAAG,CAAC,CAAC;IACf,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,UAAU,CAAC,CAAgB,EAAE,CAA4B;IAC9D,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QAClB,OAAO,CAAC,CAAC,OAAO,CAAC;IACrB,CAAC;IACD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC1B,MAAM,IAAI,UAAU,CAAC,eAAe,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,2BAA2B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC9G,CAAC;IACD,OAAO,CAAC,CAAC;AACb,CAAC;AAED,SAAS,YAAY,CAAC,CAAS;IAC3B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC9D,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,aAAa,CAAC,CAAgB,EAAE,IAA0B,EAAE;IACxE,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC1D,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,aAAa,IAAI,IAAI,CAAC;IAClC,YAAY,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,OAAO,GAAG,CAAC,CAAC,aAAa,IAAI,GAAG,CAAC;IACvC,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC;IAChC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO,EAAE,MAAM,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IAC3E,CAAC;IACD,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IACrE,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,EAAE,cAAc,CAAC,IAAI,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5F,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACtE,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,OAAO,UAAU,GAAG,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;QACxC,UAAU,EAAE,CAAC;QACb,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAClC,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;QACL,CAAC;QACD,MAAM,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtG,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;gBACT,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACjD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACnB,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;gBAClF,CAAC;YACL,CAAC;QACL,CAAC;QACD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,CAAC;QACD,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5B,SAAS,GAAG,OAAO,GAAG,GAAG,CAAC;IAC9B,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;AACnD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,OAAO,aAAa;IAStB;;;;OAIG;IACH,YAAY,CAAgB,EAAE,IAAgC,EAAE;QAC5D,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,IAAI,CAAC,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACpD,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAClE,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,IAAiC,EAAE;QACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,CAAC,QAA2B,EAAE,IAAiC,EAAE;QACnE,MAAM,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;gBACpD,SAAS;YACb,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrD,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9B,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5B,CAAC;QACL,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;OAKG;IACK,GAAG,CAAC,CAA8B,EAAE,UAAmB;QAC3D,MAAM,CAAC,GAAG,CAAC,CAAC,aAAa,IAAI,IAAI,CAAC;QAClC,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC;QAChC,MAAM,OAAO,GAAG,CAAC,CAAC,aAAa,IAAI,GAAG,CAAC;QACvC,MAAM,SAAS,GAAG,CAAC,CAAC,cAAc,IAAI,GAAG,GAAG,EAAE,CAAC;QAC/C,YAAY,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACV,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;QACrE,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;QAC1D,MAAM,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,EAAE,GAAG,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC;YACnF,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBAClC,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC3C,CAAC;YACL,CAAC;YACD,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACf,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzB,IAAI,CAAC,CAAC,CAAC,IAAI,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACjE,CAAC;YACL,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,SAAS,EAAE,CAAC;oBACtD,SAAS;gBACb,CAAC;gBACD,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;gBACnB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;oBACT,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBACnB,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;oBAChF,CAAC;gBACL,CAAC;YACL,CAAC;YACD,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,WAAW,GAAG,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,CAAC,CAAC,IAAI,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAClE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBACpC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;YACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;gBACjB,MAAM;YACV,CAAC;QACL,CAAC;QACD,SAAS,CAAC,MAAM,CAAC,CAAC;QAClB,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;CACJ;AAED;;;GAGG;AACH,MAAM,gBAAgB;IAAtB;QACqB,SAAI,GAAa,EAAE,CAAC;QACpB,QAAG,GAAa,EAAE,CAAC;IAoDxC,CAAC;IAlDG,OAAO;QACH,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,IAAI,CAAC,IAAY,EAAE,GAAW;QAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACX,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACvB,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACnC,MAAM;YACV,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAChB,CAAC,GAAG,CAAC,CAAC;QACV,CAAC;IACL,CAAC;IAED,GAAG;QACC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAY,CAAC;QAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAY,CAAC;QACzC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,GAAG,CAAC;QACf,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,SAAS,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxD,CAAC,GAAG,CAAC,CAAC;YACV,CAAC;YACD,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxD,CAAC,GAAG,CAAC,CAAC;YACV,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACV,OAAO,GAAG,CAAC;YACf,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAChB,CAAC,GAAG,CAAC,CAAC;QACV,CAAC;IACL,CAAC;IAEO,IAAI,CAAC,CAAS,EAAE,CAAS;QAC7B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;CACJ;AAED;;;;;;;;GAQG;AACH,MAAM,OAAO,qBAAqB;IAS9B;;;;OAIG;IACH,YAAY,CAAgB,EAAE,IAAgC,EAAE;QAP/C,SAAI,GAAG,IAAI,gBAAgB,EAAE,CAAC;QAQ3C,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,IAAI,CAAC,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACpD,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QACvC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,mBAAmB,CAAC,IAAiC,EAAE;QACnD,MAAM,CAAC,GAAG,CAAC,CAAC,aAAa,IAAI,IAAI,CAAC;QAClC,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC;QAChC,MAAM,OAAO,GAAG,CAAC,CAAC,aAAa,IAAI,GAAG,CAAC;QACvC,MAAM,SAAS,GAAG,CAAC,CAAC,cAAc,IAAI,GAAG,GAAG,EAAE,CAAC;QAC/C,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QAChD,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;QACtB,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;QAC1D,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,SAAS,GAAG,OAAO,EAAE,CAAC;YAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,SAAS,EAAE,CAAC;gBAC9B,SAAS;YACb,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;YACnB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;gBACT,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACjD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACtB,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;oBACnF,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;oBACpB,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,SAAS,EAAE,CAAC;wBACjC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;oBACpC,CAAC;gBACL,CAAC;YACL,CAAC;YACD,SAAS,EAAE,CAAC;YACZ,IAAI,SAAS,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC;gBACzB,IAAI,QAAQ,GAAG,CAAC,CAAC;gBACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzB,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvD,CAAC;gBACD,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;oBACjB,MAAM;gBACV,CAAC;YACL,CAAC;YACD,SAAS,EAAE,CAAC;QAChB,CAAC;QACD,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBACnC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC;QAC1B,CAAC;QACD,SAAS,CAAC,MAAM,CAAC,CAAC;QAClB,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;CACJ"}

package/dist/src/indexed/dfs.d.ts

@@ -0,0 +1,55 @@
+import { type AdjacencyView, type U32 } from "@graphty/graph-format";
+import { type ArcOrderOption } from "./bfs.js";
+/** Result of the index-based DFS. @public */
+export interface DfsResult {
+    /** The visited nodes in pre-order or post-order (see `DfsOptions.order`); length `visitedCount`. */
+    readonly order: U32;
+    /** DFS-tree parent of every node, INVALID_INDEX for the start node and for unvisited nodes. */
+    readonly parent: U32;
+    /** DFS-tree depth of every node, INVALID_INDEX for unvisited nodes. */
+    readonly depth: U32;
+    /** How many nodes were visited. */
+    readonly visitedCount: number;
+}
+/** Options of the index-based DFS. @public */
+export interface DfsOptions extends ArcOrderOption {
+    /**
+     * Stop the whole walk as soon as this node index is visited. Pre-order only: a post-order walk
+     * always runs to the end, since a node's post-order place is known only once its subtree is done.
+     * @throws RangeError when it is not a node index
+     */
+    readonly target?: number | undefined;
+    /** "pre" (default) lists a node when it is first reached, "post" when its subtree is finished. */
+    readonly order?: "pre" | "post" | undefined;
+}
+/**
+ * Depth-first search over out-neighbours, trying them in row (ascending index) order unless
+ * `options.arcOrder` gives another. Takes any
+ * `AdjacencyView`, so `s.reverse()` walks in-neighbours.
+ * @param g - The adjacency to traverse
+ * @param start - The node index to start from
+ * @param options - Traversal options
+ * @returns The visit order, the DFS tree as a parent array, the tree depths and the visited count
+ * @public
+ */
+export declare function depthFirstSearch(g: AdjacencyView, start: number, options?: DfsOptions): DfsResult;
+/**
+ * Whether the graph has a cycle. Directed: a DFS back arc. Undirected: an edge closing a loop in a
+ * union-find forest. A self-loop is a cycle; a parallel pair is not -- the graph is read as simple,
+ * the adjacent-skip idiom of graph-format design section 3.5.
+ * @param g - The adjacency to test
+ * @returns True when a cycle exists
+ * @public
+ */
+export declare function hasCycle(g: AdjacencyView): boolean;
+/**
+ * Topological order of a directed graph: reverse DFS post-order, roots taken in index order and
+ * neighbours in row order unless `options.arcOrder` gives another.
+ * @param g - A directed adjacency
+ * @param options - The neighbour order
+ * @returns The node indices in topological order, or null when the graph has a cycle
+ * @throws Error when the graph is undirected
+ * @public
+ */
+export declare function topologicalSort(g: AdjacencyView, options?: ArcOrderOption): U32 | null;
+//# sourceMappingURL=dfs.d.ts.map

package/dist/src/indexed/dfs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dfs.d.ts","sourceRoot":"","sources":["../../../src/indexed/dfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,aAAa,EAAiB,KAAK,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAEpF,OAAO,EAAE,KAAK,cAAc,EAA0C,MAAM,UAAU,CAAC;AAGvF,6CAA6C;AAC7C,MAAM,WAAW,SAAS;IACtB,oGAAoG;IACpG,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB,+FAA+F;IAC/F,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;IACrB,uEAAuE;IACvE,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB,mCAAmC;IACnC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CACjC;AAED,8CAA8C;AAC9C,MAAM,WAAW,UAAW,SAAQ,cAAc;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACrC,kGAAkG;IAClG,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,GAAG,MAAM,GAAG,SAAS,CAAC;CAC/C;AAmFD;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,UAAe,GAAG,SAAS,CASrG;AAED;;;;;;;GAOG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,OAAO,CA0BlD;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,GAAE,cAAmB,GAAG,GAAG,GAAG,IAAI,CAY1F"}

package/dist/src/indexed/dfs.js

@@ -0,0 +1,146 @@
+import { INVALID_INDEX } from "@graphty/graph-format";
+import { checkArcOrder, checkStart, checkTarget } from "./bfs.js";
+import { IntUnionFind } from "./structures/union-find.js";
+const NEW = 0;
+const OPEN = 1;
+const DONE = 2;
+function newWalk(nodeCount) {
+    return {
+        state: new Uint8Array(nodeCount),
+        parent: new Uint32Array(nodeCount).fill(INVALID_INDEX),
+        depth: new Uint32Array(nodeCount).fill(INVALID_INDEX),
+        cursor: new Uint32Array(nodeCount),
+        stack: new Uint32Array(nodeCount),
+        pre: new Uint32Array(nodeCount),
+        post: new Uint32Array(nodeCount),
+        preCount: 0,
+        postCount: 0,
+        backArc: false,
+    };
+}
+/**
+ * Iterative DFS from `root` with an explicit arc cursor per node, so the walk tries neighbours in
+ * row order (or `arcOrder`) exactly as a recursive DFS would and never overflows the call stack.
+ * @param g - The adjacency to walk
+ * @param root - An unvisited node index
+ * @param w - The shared walk state
+ * @param target - Stop the walk when this node is reached; INVALID_INDEX for none
+ * @param arcOrder - The order to try each row's arcs in; null for row order
+ */
+function walkFrom(g, root, w, target, arcOrder) {
+    const { rowPtr, colIdx } = g;
+    const { state, parent, depth, cursor, stack, pre, post } = w;
+    let top = 0;
+    state[root] = OPEN;
+    depth[root] = 0;
+    cursor[root] = rowPtr[root];
+    pre[w.preCount++] = root;
+    stack[top++] = root;
+    if (root === target) {
+        return;
+    }
+    while (top > 0) {
+        const u = stack[top - 1];
+        if (cursor[u] < rowPtr[u + 1]) {
+            const a = cursor[u]++;
+            const v = colIdx[arcOrder === null ? a : arcOrder[a]];
+            if (state[v] === NEW) {
+                state[v] = OPEN;
+                parent[v] = u;
+                depth[v] = depth[u] + 1;
+                cursor[v] = rowPtr[v];
+                pre[w.preCount++] = v;
+                stack[top++] = v;
+                if (v === target) {
+                    return;
+                }
+            }
+            else if (state[v] === OPEN) {
+                w.backArc = true;
+            }
+        }
+        else {
+            state[u] = DONE;
+            post[w.postCount++] = u;
+            top--;
+        }
+    }
+}
+/**
+ * Depth-first search over out-neighbours, trying them in row (ascending index) order unless
+ * `options.arcOrder` gives another. Takes any
+ * `AdjacencyView`, so `s.reverse()` walks in-neighbours.
+ * @param g - The adjacency to traverse
+ * @param start - The node index to start from
+ * @param options - Traversal options
+ * @returns The visit order, the DFS tree as a parent array, the tree depths and the visited count
+ * @public
+ */
+export function depthFirstSearch(g, start, options = {}) {
+    checkStart(g, start);
+    const arcOrder = checkArcOrder(g, options.arcOrder);
+    const target = checkTarget(g, options.target);
+    const w = newWalk(g.nodeCount);
+    const postOrder = options.order === "post";
+    walkFrom(g, start, w, postOrder ? INVALID_INDEX : target, arcOrder);
+    const order = postOrder ? w.post.subarray(0, w.postCount) : w.pre.subarray(0, w.preCount);
+    return { order, parent: w.parent, depth: w.depth, visitedCount: w.preCount };
+}
+/**
+ * Whether the graph has a cycle. Directed: a DFS back arc. Undirected: an edge closing a loop in a
+ * union-find forest. A self-loop is a cycle; a parallel pair is not -- the graph is read as simple,
+ * the adjacent-skip idiom of graph-format design section 3.5.
+ * @param g - The adjacency to test
+ * @returns True when a cycle exists
+ * @public
+ */
+export function hasCycle(g) {
+    const { nodeCount, rowPtr, colIdx } = g;
+    if (g.directed) {
+        const w = newWalk(nodeCount);
+        for (let r = 0; r < nodeCount && !w.backArc; r++) {
+            if (w.state[r] === NEW) {
+                walkFrom(g, r, w, INVALID_INDEX, null);
+            }
+        }
+        return w.backArc;
+    }
+    const uf = new IntUnionFind(nodeCount);
+    for (let u = 0; u < nodeCount; u++) {
+        const end = rowPtr[u + 1];
+        for (let a = rowPtr[u]; a < end; a++) {
+            const v = colIdx[a];
+            if (v === u) {
+                return true;
+            }
+            // Each undirected edge once (v > u), each parallel pair once (rows are sorted).
+            if (v > u && (a === rowPtr[u] || colIdx[a - 1] !== v) && !uf.union(u, v)) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Topological order of a directed graph: reverse DFS post-order, roots taken in index order and
+ * neighbours in row order unless `options.arcOrder` gives another.
+ * @param g - A directed adjacency
+ * @param options - The neighbour order
+ * @returns The node indices in topological order, or null when the graph has a cycle
+ * @throws Error when the graph is undirected
+ * @public
+ */
+export function topologicalSort(g, options = {}) {
+    if (!g.directed) {
+        throw new Error("Topological sort requires a directed graph");
+    }
+    const arcOrder = checkArcOrder(g, options.arcOrder);
+    const w = newWalk(g.nodeCount);
+    for (let r = 0; r < g.nodeCount && !w.backArc; r++) {
+        if (w.state[r] === NEW) {
+            walkFrom(g, r, w, INVALID_INDEX, arcOrder);
+        }
+    }
+    return w.backArc ? null : w.post.reverse();
+}
+//# sourceMappingURL=dfs.js.map

package/dist/src/indexed/dfs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dfs.js","sourceRoot":"","sources":["../../../src/indexed/dfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,aAAa,EAAY,MAAM,uBAAuB,CAAC;AAEpF,OAAO,EAAuB,aAAa,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AACvF,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AA0B1D,MAAM,GAAG,GAAG,CAAC,CAAC;AACd,MAAM,IAAI,GAAG,CAAC,CAAC;AACf,MAAM,IAAI,GAAG,CAAC,CAAC;AAiBf,SAAS,OAAO,CAAC,SAAiB;IAC9B,OAAO;QACH,KAAK,EAAE,IAAI,UAAU,CAAC,SAAS,CAAC;QAChC,MAAM,EAAE,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QACtD,KAAK,EAAE,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QACrD,MAAM,EAAE,IAAI,WAAW,CAAC,SAAS,CAAC;QAClC,KAAK,EAAE,IAAI,WAAW,CAAC,SAAS,CAAC;QACjC,GAAG,EAAE,IAAI,WAAW,CAAC,SAAS,CAAC;QAC/B,IAAI,EAAE,IAAI,WAAW,CAAC,SAAS,CAAC;QAChC,QAAQ,EAAE,CAAC;QACX,SAAS,EAAE,CAAC;QACZ,OAAO,EAAE,KAAK;KACjB,CAAC;AACN,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,QAAQ,CAAC,CAAgB,EAAE,IAAY,EAAE,CAAO,EAAE,MAAc,EAAE,QAAoB;IAC3F,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC7D,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACnB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5B,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;IACzB,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;IACpB,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;QAClB,OAAO;IACX,CAAC;IACD,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;QACb,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACzB,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBACnB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBAChB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACd,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACxB,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtB,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;gBACtB,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;gBACjB,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;oBACf,OAAO;gBACX,CAAC;YACL,CAAC;iBAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC3B,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC;YACrB,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YAChB,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC;YACxB,GAAG,EAAE,CAAC;QACV,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAgB,EAAE,KAAa,EAAE,UAAsB,EAAE;IACtF,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrB,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC/B,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,KAAK,MAAM,CAAC;IAC3C,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC1F,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;AACjF,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CAAC,CAAgB;IACrC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACxC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QACb,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBACrB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;YAC3C,CAAC;QACL,CAAC;QACD,OAAO,CAAC,CAAC,OAAO,CAAC;IACrB,CAAC;IACD,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACV,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,gFAAgF;YAChF,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACvE,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAAC,CAAgB,EAAE,UAA0B,EAAE;IAC1E,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAClE,CAAC;IACD,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;IACpD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACrB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;QAC/C,CAAC;IACL,CAAC;IACD,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;AAC/C,CAAC"}