@graphty/webgpu-graph-algorithms 0.6.3 → 0.6.4

package/dist/src/algorithms/sssp.js

@@ -0,0 +1,585 @@
+/**
+ * Weighted single-source shortest paths on the device (design 8.4, 3.3 line 808, 9.7; P8-T9, the P8 plan's PD-9 /
+ * PD-10 / PD-11 / PD-14 / PD-19 / PD-20 / PD-22 / PD-27 / DEP-P8-E): Davidson's near-far queue over the `Frontier`
+ * of P8-T4 with the `dedupe` of P8-T3, every per-round decision made ON THE DEVICE. `dist` is `array<atomic<u32>>`
+ * holding the f32 bit patterns of the distances (`F32_INF_BITS` = unreached), claimed by `atomicMin`, which is
+ * exact on non-negative floats (PD-9): the settled value is the minimum of a fixed set of f32 sums, so it is
+ * bitwise reproducible, bitwise identical across adapters, and bitwise equal to the f32 Dijkstra oracle.
+ *
+ * A round is eight recorded dispatches: `frontier-finalize` role 2 (the round boundary: a non-empty raw near half
+ * is deduped into `nearIn` for a near round; an empty one with a non-empty far half raises the threshold by the
+ * delta and dedupes the far half into `farIn` for a pass-through; both empty is `done`), `dedupe-claim` and
+ * `dedupe-filter` over each half (direct grid-stride dispatches; role 2 writes the chosen half's raw count into that
+ * dedupe's count word -- `edgeCount` for the near half, `edgeCountUnclamped` for the far one, two words SSSP borrows
+ * -- and 0 into the other's, so the half not chosen is a no-op), role 3 (restarts the raw half), and `sssp-relax`
+ * twice (role 0 over `nearIn`, role 1 over `farIn`; the block's `path` word, 5 a near round and 6 a far one, makes
+ * the other role's dispatch a no-op). The far pile is re-bucketed by the
+ * relax kernel's pass-through, not by `compact` (PD-20): a far entry whose settled distance fell below the previous
+ * threshold was relaxed in the near band already and is dropped, the rest go back to near or far against the raised
+ * threshold. The near pile is ONE pile (no sub-partitions). The host records `MAX_LEVELS_PER_SUBMIT` rounds per
+ * submit and reads four bytes, the `done` word: 1 finished, 2 a raw half above its capacity (E_TOO_LARGE
+ * `sssp.pile`: the far half accumulates one entry per improving relaxation beyond the threshold across a bucket's
+ * near rounds and is deduped only at the split, so the refusal is reachable on a graph whose vertices improve many
+ * times inside one bucket), 3 the f32 threshold absorbed the delta (E_UNSUPPORTED `sssp.thresholdAbsorbed`). The
+ * rounds are at most `n + ceil(sum / delta) + 1` (each near round settles the pile's minimum, one pass-through per
+ * bucket), so more submits than that is E_VALIDATION, never a hang.
+ *
+ * The two routings (PD-22) are decided by the RUN's weight vector: `options.weights` when given (`arcCount` long or
+ * E_INVALID_ARGUMENT; narrowed to `Float32Array` when it is not one -- a `U32` or `I32` value above 2^24, or the
+ * bits of an `F64` value below the f32 ulp, is rounded silently, the package-wide f32 caveat and not a refusal --
+ * uploaded into a lease buffer and bound in the graph group's weights slot with `HAS_WEIGHTS` set even on an
+ * unweighted snapshot), else the snapshot's column, else none. A run whose vector is all ones, or has none, is the
+ * unit-weight BFS of P8-T6 with a depth cap derived from `cutoff` (`dv <= cutoff` on unit weights is
+ * `depth <= floor(cutoff)`), its `predArc` from `sssp-pred` in depth mode writing arc indices, `reachedCount` the
+ * visited count -- not a fallback, a better algorithm for the input. A negative weight is E_UNSUPPORTED
+ * `sssp.negativeWeights` (use bellmanFord), a non-finite one E_UNSUPPORTED `sssp.nonFiniteWeights` (the bit-pattern
+ * order is undefined for NaN); `cutoff: NaN` is E_INVALID_ARGUMENT, because the CPU port's `dv <= NaN` relaxes
+ * nothing while the kernel's `nd > NaN` guard would relax everything (PD-19). All host-side, before any device work.
+ * The delta is `SSSP_DELTA_FACTOR x avgWeight / avgDegree` over the vector in use (1 for an all-zero vector), seeded
+ * into the counters block as `deltaBits` and `thresholdBits`.
+ *
+ * `predArc` is a second pass over the settled distances (PD-11), never packed into the distance atomic: `sssp-pred`
+ * in `MODE 0` follows PD-27's plateau rule -- the smallest TIGHT arc whose source sits one key step below `v`, the
+ * key `(dist, hops)` with `hops` the plateau depth from a root -- through three roles over one buffer (the arcs,
+ * the hop counts, the changed word and the orphan word), so the chain strictly decreases the key, ends at the
+ * source, and is bitwise reproducible. A hop batch of `MAX_LEVELS_PER_SUBMIT` passes that still changed something
+ * is recorded again without the roots pass; a reached node the key never reached is a kernel bug (E_VALIDATION),
+ * never a result. The tuning entry `ssspWithTuning` (PD-26's shape) is what the tests drive; nothing public
+ * exposes it.
+ *
+ * The host-side helpers of the two routings (`resolveWeights`, `normaliseCutoff`, `checkDest`, `assertSource`,
+ * `unitWeightRoute`) and the predecessor pass (`predecessorPass`, both PD-27 keys) are shared with
+ * `bellman-ford.ts` (P8-T10), which is the same seam type over the same `SsspOptions`; they take the algorithm's
+ * name for their messages and are `@internal`.
+ */
+import { INVALID_INDEX } from "@graphty/graph-format";
+import { F32_INF_BITS, MAX_LEVELS_PER_SUBMIT, SSSP_DELTA_FACTOR } from "../constants.js";
+import { WebGpuGraphError } from "../errors.js";
+import { CommandBatch } from "../kernel/batch.js";
+import { plan1d, planGridStride } from "../kernel/dispatch.js";
+import { FILL_PARAMS, FRONTIER_COUNTERS, FRONTIER_PARAMS, graphBindings, graphOverrides, kernelSpec, } from "../kernels.js";
+import { prepareCompact } from "../primitives/compact.js";
+import { assertWholeCore } from "../primitives/core-shape.js";
+import { prepareFrontier, W } from "../primitives/frontier.js";
+import { assertDeviceComputes } from "../primitives/verify.js";
+import { bfsWithTuning } from "./bfs.js";
+import { algorithmScope } from "./scope.js";
+const ALGORITHM = "sssp";
+/** The arc-window alignment of the raw halves: the far half's byte offset is `4 x cap`, a multiple of 256, so `dedupe` can bind it alone. */
+const HALF_ALIGN = 64;
+/**
+ * Params slots of the ring, COUNTED (`UniformRing.reserve` wraps silently): per round `frontier-finalize` twice and
+ * the two dedupe records (4), plus the two relax records shared by every round of a submit (the near and the far
+ * role read the same fields), so `4 x MAX_LEVELS_PER_SUBMIT + 2` for a round submit; the predecessor batch is the
+ * roots pass, `MAX_LEVELS_PER_SUBMIT` hop passes, one `fill` and the predecessor pass (35) and the setup batch two
+ * `fill`s; they flush in their own submits but must fit the same ring.
+ */
+const RING_SLOTS = 4 * MAX_LEVELS_PER_SUBMIT + 40;
+/**
+ * The f32 bit pattern of a number (the form the counters block and `FrontierParams` carry).
+ * @internal
+ * @param value - the number (rounded to f32 first)
+ * @returns the pattern
+ */
+export function bitsOf(value) {
+    return new Uint32Array(Float32Array.of(value).buffer)[0];
+}
+/**
+ * Whole-buffer binding of a scratch buffer over its first `size` bytes.
+ * @internal
+ * @param buffer - the buffer
+ * @param size - the bound byte length
+ * @returns the binding
+ */
+export function bindingOf(buffer, size) {
+    return { buffer, offset: 0, size, window: null };
+}
+/**
+ * The E_ABORTED error of a signal.
+ * @internal
+ * @param algorithm - the algorithm's name (the message prefix)
+ * @param batchId - the last submitted batch, when one exists
+ * @returns the error
+ */
+export function aborted(algorithm, batchId) {
+    return new WebGpuGraphError("E_ABORTED", `${algorithm}: the signal was aborted`, batchId === undefined ? {} : { batchId });
+}
+/**
+ * E_INVALID_ARGUMENT unless `source` is an integer in `[0, n)`.
+ * @internal
+ * @param algorithm - the algorithm's name (the message prefix)
+ * @param source - the caller's source node index
+ * @param n - the node count
+ */
+export function assertSource(algorithm, source, n) {
+    if (!Number.isInteger(source) || source < 0 || source >= n) {
+        throw new WebGpuGraphError("E_INVALID_ARGUMENT", `${algorithm}: source ${source} is outside [0, ${n})`, {
+            argument: "source",
+            value: source,
+            expected: `an integer in [0, ${n})`,
+        });
+    }
+}
+/**
+ * One scalar word of a decoded block (every FrontierCounters field is a u32, so anything else is a decoder bug).
+ * @param block - the decoded block
+ * @param name - the field
+ * @returns the word
+ */
+function wordOf(block, name) {
+    const value = block[name];
+    if (typeof value !== "number") {
+        throw new WebGpuGraphError("E_VALIDATION", `${ALGORITHM}: counters.${name} did not decode to a number`, {
+            label: `${ALGORITHM}/counters`,
+            message: `the field ${name} did not decode to a number`,
+        });
+    }
+    return value;
+}
+/**
+ * Validates `options.dest` for a distance result of `n` elements.
+ * @internal
+ * @param algorithm - the algorithm's name (the message prefix)
+ * @param dest - the caller's destination array, if any
+ * @param n - the node count
+ * @returns the destination as an F32, or null when none was given
+ */
+export function checkDest(algorithm, dest, n) {
+    if (dest === undefined) {
+        return null;
+    }
+    if (dest instanceof Float32Array && dest.length === n && dest.buffer instanceof ArrayBuffer) {
+        return dest;
+    }
+    throw new WebGpuGraphError("E_INVALID_ARGUMENT", `${algorithm}: dest must be a Float32Array of length ${n} over an ArrayBuffer`, {
+        argument: "dest",
+        value: `${dest.constructor.name}(${dest.length})`,
+        expected: `Float32Array(${n}) over an ArrayBuffer`,
+    });
+}
+/**
+ * The CPU port's `cutoff` before any device work: absent is no cap; `NaN` is refused (PD-19: `dv <= NaN` relaxes
+ * nothing on the CPU while the kernel's `nd > NaN` guard would relax everything, a silently inverted option);
+ * anything else is a finite or infinite number.
+ * @internal
+ * @param algorithm - the algorithm's name (the message prefix)
+ * @param cutoff - the caller's option
+ * @returns the cap
+ */
+export function normaliseCutoff(algorithm, cutoff) {
+    if (cutoff === undefined) {
+        return Infinity;
+    }
+    if (Number.isNaN(cutoff)) {
+        throw new WebGpuGraphError("E_INVALID_ARGUMENT", `${algorithm}: cutoff must not be NaN`, {
+            argument: "cutoff",
+            value: cutoff,
+            expected: "a number (the CPU port and the kernel would disagree on NaN)",
+        });
+    }
+    return cutoff;
+}
+/**
+ * The weight vector of the run (PD-22): the override, validated and narrowed, else the snapshot's column, else
+ * null; scanned once on the host for the routing flags and the sum.
+ * @internal
+ * @param algorithm - the algorithm's name (the message prefix)
+ * @param s - the snapshot
+ * @param weights - the caller's override, if any
+ * @returns the vector and its flags, or null when the run has no weights at all
+ */
+export function resolveWeights(algorithm, s, weights) {
+    if (weights === undefined) {
+        if (s.weights === null) {
+            return null;
+        }
+        let sum = 0;
+        for (const w of s.weights) {
+            sum += w;
+        }
+        return {
+            values: s.weights,
+            override: null,
+            allOne: s.flags.allWeightsOne,
+            nonNegative: s.flags.nonNegativeWeights,
+            finite: s.flags.finiteWeights,
+            sum,
+        };
+    }
+    if (weights.length !== s.arcCount) {
+        throw new WebGpuGraphError("E_INVALID_ARGUMENT", `${algorithm}: weights has ${weights.length} entries, the snapshot ${s.arcCount} arcs`, { argument: "weights", value: weights.length, expected: s.arcCount });
+    }
+    // the f32 narrowing: a U32 / I32 value above 2^24 or the bits of an F64 value below the f32 ulp round silently
+    const values = weights instanceof Float32Array ? weights : Float32Array.from(weights);
+    let allOne = true;
+    let nonNegative = true;
+    let finite = true;
+    let sum = 0;
+    for (const w of values) {
+        if (w !== 1) {
+            allOne = false;
+        }
+        if (w < 0) {
+            nonNegative = false;
+        }
+        if (!Number.isFinite(w)) {
+            finite = false;
+        }
+        sum += w;
+    }
+    return { values, override: values, allOne, nonNegative, finite, sum };
+}
+/**
+ * The unit-weight route (PD-22): the BFS with `cutoff` as a depth cap (`dv <= cutoff` on unit weights is
+ * `depth <= floor(cutoff)`; no cap or `+Infinity` is no cap, a negative cutoff the source alone), its `parent` in
+ * arc form, its depths as f32 distances.
+ * @internal
+ * @param ctx - the context
+ * @param s - the snapshot
+ * @param source - the source node index
+ * @param cutoff - the normalised cutoff
+ * @param dest - the caller's destination, if any
+ * @param options - the run options
+ * @returns the result
+ */
+export async function unitWeightRoute(ctx, s, source, cutoff, dest, options) {
+    const maxDepth = cutoff === Infinity ? undefined : Math.floor(cutoff);
+    const bfs = await bfsWithTuning(ctx, s, source, { maxDepth, signal: options?.signal, onProgress: options?.onProgress }, { predKind: 0 });
+    const dist = dest ?? new Float32Array(s.nodeCount);
+    for (let v = 0; v < s.nodeCount; v++) {
+        const d = bfs.depth[v];
+        dist[v] = d === INVALID_INDEX ? Infinity : d;
+    }
+    return { dist, predArc: bfs.parent, reachedCount: bfs.visitedCount };
+}
+/**
+ * The words of PD-27's `pred` buffer for `n` nodes: the arcs at 0, the hop counts at `hb = roundUp(n, 64)`, the
+ * changed word at `2 hb` and the orphan word after it, in a 64-word tail.
+ * @internal
+ * @param n - the node count
+ * @returns the word count (`2 x hb + 64`)
+ */
+export function predBufferWords(n) {
+    return 2 * Math.ceil(n / 64) * 64 + 64;
+}
+/**
+ * The predecessor pass (PD-11, PD-27): the source is the one seeded root and the two flag words are zeroed by
+ * `queue.writeBuffer`; then ONE batch of the roots pass (the plateau rule only), `MAX_LEVELS_PER_SUBMIT` hop passes
+ * with `P.iteration` counting inside the batch, the arcs re-filled with `INVALID_INDEX` and the predecessor pass,
+ * with the readbacks of `dist`, `pred[0, n)` and the two flag words; recorded again without the roots pass while the
+ * last hop pass still changed something (a plateau, or a tight subgraph, `k` hops deep needs `ceil((k + 1) / 32)`
+ * batches). More than `ceil((n + 1) / MAX_LEVELS_PER_SUBMIT) + 1` batches is E_VALIDATION, because a hop count is at
+ * most `n`. The orphan word is returned, not judged: `sssp` treats it as a kernel bug and `bellmanFord` as the rounded
+ * cycle PD-27 names.
+ * @internal
+ * @param input - the driver's buffers, kernels and key rule
+ * @returns the distances, the arcs and the orphan count
+ */
+export async function predecessorPass(input) {
+    const { algorithm, ctx, scope, predKernel, recordFill, graph, dist, pred, n, arcCount, source, mode } = input;
+    const wg = ctx.workgroupSize;
+    const { queue } = ctx.device;
+    const bytes = 4 * n;
+    const hb = Math.ceil(n / 64) * 64;
+    const predArcs = { buffer: pred.buffer, offset: pred.offset, size: bytes, window: null };
+    queue.writeBuffer(pred.buffer, pred.offset + 4 * (hb + source), Uint32Array.of(0));
+    queue.writeBuffer(pred.buffer, pred.offset + 4 * 2 * hb, new Uint32Array(2));
+    const predPlan = planGridStride(n, wg, ctx.caps);
+    const predFields = {
+        wg,
+        n,
+        arcBase: 0,
+        arcEnd: arcCount,
+        predKind: 0,
+        source,
+        stride: predPlan.stride ?? n,
+        mode,
+    };
+    const maxBatches = Math.ceil((n + 1) / MAX_LEVELS_PER_SUBMIT) + 1;
+    let batches = 0;
+    for (;;) {
+        const batch = new CommandBatch(ctx, `${algorithm}/pred`);
+        const pass = batch.pass("pred");
+        const recordRole = (role, iteration) => {
+            const params = scope.params(FRONTIER_PARAMS, { ...predFields, role, iteration });
+            const bound = predKernel.bind({ ...graph, dist, pred, P: params.binding });
+            predKernel.dispatch(pass, bound, predPlan, [params.offset]);
+        };
+        if (batches === 0 && mode === 0) {
+            recordRole(0, 0);
+        }
+        for (let iteration = 0; iteration < MAX_LEVELS_PER_SUBMIT; iteration++) {
+            recordRole(1, iteration);
+        }
+        recordFill(pass, predArcs, n, INVALID_INDEX);
+        recordRole(2, 0);
+        batch.endPass();
+        const distRequest = batch.readback(dist.buffer, dist.offset, bytes);
+        const predRequest = batch.readback(pred.buffer, pred.offset, bytes);
+        const flagsRequest = batch.readback(pred.buffer, pred.offset + 4 * 2 * hb, 8);
+        scope.flush();
+        const back = await batch.submit().readback;
+        ctx.assertReady();
+        batches += 1;
+        const [changed, orphans] = new Uint32Array(back, flagsRequest.offset, 2);
+        if (changed < MAX_LEVELS_PER_SUBMIT) {
+            return {
+                dist: new Float32Array(back, distRequest.offset, n),
+                predArc: new Uint32Array(back, predRequest.offset, n).slice(),
+                orphans,
+            };
+        }
+        if (batches > maxBatches) {
+            throw new WebGpuGraphError("E_VALIDATION", `${algorithm}: the hop passes still changed something after ${batches} batches (a hop count is at most ${n})`, { label: `${algorithm}/pred`, message: `the hop passes did not converge in ${batches} batches` });
+        }
+        queue.writeBuffer(pred.buffer, pred.offset + 4 * 2 * hb, new Uint32Array(2));
+    }
+}
+/**
+ * Single-source shortest paths with the test knobs of PD-26's shape; `sssp` is this with an empty tuning.
+ * @internal
+ * @param ctx - the context whose device runs the kernels
+ * @param s - the snapshot (uploaded through ctx.residency, or found there)
+ * @param source - the source node index
+ * @param options - `cutoff` and `weights`, plus dest / signal / onProgress
+ * @param tuning - the knobs
+ * @returns the distances, the predecessor arcs and the reached count
+ */
+export async function ssspWithTuning(ctx, s, source, options, tuning) {
+    ctx.assertReady();
+    await assertDeviceComputes(ctx);
+    const n = s.nodeCount;
+    assertSource(ALGORITHM, source, n);
+    const roundsPerSubmit = tuning.roundsPerSubmit ?? MAX_LEVELS_PER_SUBMIT;
+    if (!Number.isInteger(roundsPerSubmit) || roundsPerSubmit < 1 || roundsPerSubmit > MAX_LEVELS_PER_SUBMIT) {
+        throw new WebGpuGraphError("E_INVALID_ARGUMENT", `${ALGORITHM}: roundsPerSubmit must be an integer in [1, ${MAX_LEVELS_PER_SUBMIT}]`, {
+            argument: "roundsPerSubmit",
+            value: roundsPerSubmit,
+            expected: `an integer in [1, ${MAX_LEVELS_PER_SUBMIT}]`,
+        });
+    }
+    if (tuning.delta !== undefined && !(Number.isFinite(tuning.delta) && tuning.delta > 0)) {
+        throw new WebGpuGraphError("E_INVALID_ARGUMENT", `${ALGORITHM}: delta must be a finite positive number`, {
+            argument: "delta",
+            value: tuning.delta,
+            expected: "a finite positive number",
+        });
+    }
+    const dest = checkDest(ALGORITHM, options?.dest, n);
+    const vector = resolveWeights(ALGORITHM, s, options?.weights);
+    const cutoff = normaliseCutoff(ALGORITHM, options?.cutoff);
+    if (options?.signal?.aborted) {
+        throw aborted(ALGORITHM);
+    }
+    if (vector === null || vector.allOne) {
+        return unitWeightRoute(ctx, s, source, cutoff, dest, options);
+    }
+    if (!vector.nonNegative) {
+        throw new WebGpuGraphError("E_UNSUPPORTED", `${ALGORITHM}: a negative weight has no shortest path here`, {
+            feature: "sssp.negativeWeights",
+            hint: "use bellmanFord",
+        });
+    }
+    if (!vector.finite) {
+        throw new WebGpuGraphError("E_UNSUPPORTED", `${ALGORITHM}: a NaN or infinite weight has no bit-pattern order`, {
+            feature: "sssp.nonFiniteWeights",
+        });
+    }
+    const { arcCount } = s;
+    const core = ctx.residency.core(s);
+    const limit = ctx.caps.limits.maxStorageBufferBindingSize;
+    assertWholeCore(core, arcCount, limit, ALGORITHM);
+    // the raw halves: cap entries each, the far half at word cap so its byte offset is 256-aligned; one binding
+    // of both halves is what the relax kernel sees, so the whole buffer is held to the binding limit (DEP-P8-E)
+    const cap = Math.ceil(Math.max(1, arcCount) / HALF_ALIGN) * HALF_ALIGN;
+    if (8 * cap > limit) {
+        throw new WebGpuGraphError("E_TOO_LARGE", `${ALGORITHM}: the near-far queue of ${cap} entries per half needs ${8 * cap} bytes, above the ${limit}-byte binding limit (the relax is never windowed)`, { needed: 8 * cap, limit, path: "sssp.queue", algorithm: ALGORITHM });
+    }
+    // PD-22: the delta from the vector in use; an all-zero vector would land every relaxation on the far pile
+    const delta = Math.fround(tuning.delta ?? (vector.sum === 0 ? 1 : (SSSP_DELTA_FACTOR * (vector.sum / arcCount)) / (arcCount / n)));
+    const deltaBits = bitsOf(delta);
+    const maxRounds = n + Math.ceil(vector.sum / delta) + 1;
+    const maxSubmits = Math.ceil((maxRounds + 1) / roundsPerSubmit) + 1;
+    const scope = algorithmScope(ctx, ALGORITHM, RING_SLOTS);
+    try {
+        const wg = ctx.workgroupSize;
+        const bytes = 4 * n;
+        const dist = bindingOf(scope.scratch(bytes, "dist"), bytes);
+        const owner = bindingOf(scope.scratch(bytes, "owner"), bytes);
+        const queueOut = bindingOf(scope.scratch(8 * cap, "queue-out"), 8 * cap);
+        const nearHalf = { buffer: queueOut.buffer, offset: 0, size: 4 * cap, window: null };
+        const farHalf = { buffer: queueOut.buffer, offset: 4 * cap, size: 4 * cap, window: null };
+        // the pred buffer of PD-27: the arcs at 0, the hop counts at hb, the changed word at 2 hb, the orphan word after it
+        const predWords = predBufferWords(n);
+        const pred = bindingOf(scope.scratch(4 * predWords, "pred"), 4 * predWords);
+        const { queue } = ctx.device;
+        let weightsBinding;
+        if (vector.override !== null) {
+            const uploaded = scope.scratch(4 * arcCount, "weights");
+            queue.writeBuffer(uploaded, 0, vector.override);
+            weightsBinding = bindingOf(uploaded, 4 * arcCount);
+        }
+        await ctx.allocator.check();
+        const planner = await prepareFrontier(scope, n, arcCount, cap);
+        const compact = await prepareCompact(scope);
+        const overrides = graphOverrides(core, null, weightsBinding);
+        const relax = await ctx.pipelines.kernel(kernelSpec("sssp-relax", overrides));
+        const predKernel = await ctx.pipelines.kernel(kernelSpec("sssp-pred", { ...overrides, MODE: 0 }));
+        const fill = await ctx.pipelines.kernel(kernelSpec("fill"));
+        const graph = graphBindings(core, null, weightsBinding);
+        const { frontier } = planner;
+        const { counters } = frontier;
+        const nearIn = frontier.vertices[0];
+        const farIn = frontier.vertices[1];
+        const recordFill = (pass, dst, count, value) => {
+            const params = scope.params(FILL_PARAMS, { count, value, mode: 0, pad0: 0 });
+            fill.dispatch(pass, fill.bind({ dst, P: params.binding }), plan1d(count, wg, ctx.caps), [params.offset]);
+        };
+        const submit = (batch) => {
+            scope.flush();
+            return batch.submit();
+        };
+        // setup: dist = +Inf everywhere and the pred buffer INVALID_INDEX; then the source at 0, the seeded block
+        // (the source in the RAW near half so the first boundary dedupes a one-entry pile like every later one)
+        const setup = new CommandBatch(ctx, `${ALGORITHM}/setup`);
+        const setupPass = setup.pass("fill");
+        recordFill(setupPass, dist, n, F32_INF_BITS);
+        recordFill(setupPass, pred, predWords, INVALID_INDEX);
+        setup.endPass();
+        await submit(setup).readback;
+        ctx.assertReady();
+        queue.writeBuffer(dist.buffer, dist.offset + 4 * source, Uint32Array.of(0));
+        frontier.reset(queue, source, { nextFrontierCount: 1, thresholdBits: deltaBits, deltaBits });
+        queue.writeBuffer(queueOut.buffer, queueOut.offset, Uint32Array.of(source));
+        // the rounds: MAX_LEVELS_PER_SUBMIT per submit, four bytes back
+        const nearDedupe = {
+            queue: nearHalf,
+            count: cap,
+            countIndex: W.edgeCount, // role 2 writes the raw near count here when it chooses a near round, 0 otherwise
+            counters,
+            owner,
+            out: nearIn,
+            outCount: counters,
+            outIndex: W.frontierCount,
+        };
+        const farDedupe = {
+            queue: farHalf,
+            count: cap,
+            countIndex: W.edgeCountUnclamped, // and the raw far count here on a far round
+            counters,
+            owner,
+            out: farIn,
+            outCount: counters,
+            outIndex: W.farCount,
+        };
+        const relaxPlan = planGridStride(n, wg, ctx.caps); // a pile holds at most n entries; the kernel loops to the count word
+        const relaxFields = {
+            wg,
+            n,
+            edgeCapacity: cap,
+            arcBase: 0,
+            arcEnd: arcCount,
+            cutoffBits: bitsOf(cutoff),
+            source,
+            stride: relaxPlan.stride ?? wg,
+        };
+        let roundsRecorded = 0;
+        let submits = 0;
+        for (;;) {
+            const batch = new CommandBatch(ctx, `${ALGORITHM}/rounds`);
+            const pass = batch.pass("sssp");
+            const near = scope.params(FRONTIER_PARAMS, { ...relaxFields, role: 0 });
+            const far = scope.params(FRONTIER_PARAMS, { ...relaxFields, role: 1 });
+            const boundNear = relax.bind({ ...graph, dist, counters, queueIn: nearIn, queueOut, P: near.binding });
+            const boundFar = relax.bind({ ...graph, dist, counters, queueIn: farIn, queueOut, P: far.binding });
+            for (let round = 0; round < roundsPerSubmit; round++) {
+                // every dispatch of a round is DIRECT: role 2 writes the chosen half's raw count into the dedupe's count
+                // word (the other's is 0) and the path word the relax roles gate on, so the half not chosen is a no-op
+                planner.recordFinalize(pass, 2, round, {});
+                compact.recordDedupe(pass, nearDedupe);
+                compact.recordDedupe(pass, farDedupe);
+                planner.recordFinalize(pass, 3, round, {});
+                relax.dispatch(pass, boundNear, relaxPlan, [near.offset]);
+                relax.dispatch(pass, boundFar, relaxPlan, [far.offset]);
+            }
+            batch.endPass();
+            const doneRequest = batch.readback(counters.buffer, counters.offset + 4 * W.done, 4);
+            const inspect = tuning.onRound === undefined
+                ? null
+                : batch.readback(counters.buffer, counters.offset, FRONTIER_COUNTERS.byteLength);
+            const submitted = submit(batch);
+            const back = await submitted.readback;
+            roundsRecorded += roundsPerSubmit;
+            submits += 1;
+            ctx.assertReady();
+            if (options?.signal?.aborted) {
+                throw aborted(ALGORITHM, submitted.id);
+            }
+            options?.onProgress?.(Math.min(roundsRecorded, maxRounds), maxRounds);
+            if (inspect !== null && tuning.onRound !== undefined) {
+                tuning.onRound(roundsRecorded - 1, FRONTIER_COUNTERS.read(new DataView(back), inspect.offset));
+            }
+            const done = new Uint32Array(back, doneRequest.offset, 1)[0];
+            if (done === 1) {
+                break;
+            }
+            if (done !== 0) {
+                const block = FRONTIER_COUNTERS.read(new DataView(await ctx.readback.read(counters.buffer, FRONTIER_COUNTERS.byteLength, undefined, counters.offset)));
+                if (done === 2) {
+                    const needed = Math.max(wordOf(block, "nextFrontierCount"), wordOf(block, "nextFarCount"));
+                    throw new WebGpuGraphError("E_TOO_LARGE", `${ALGORITHM}: a raw pile of ${needed} entries overflowed its ${cap}-entry half`, { needed, limit: cap, path: "sssp.pile", algorithm: ALGORITHM });
+                }
+                throw new WebGpuGraphError("E_UNSUPPORTED", `${ALGORITHM}: the f32 threshold ${wordOf(block, "thresholdBits")} absorbed the delta ${deltaBits} (as bit patterns); the far pile can no longer be bucketed`, { feature: "sssp.thresholdAbsorbed", hint: "the distances outgrew the delta's f32 precision" });
+            }
+            if (submits > maxSubmits) {
+                throw new WebGpuGraphError("E_VALIDATION", `${ALGORITHM}: the done flag never rose in ${submits} submits (at most ${maxRounds} rounds)`, { label: `${ALGORITHM}/rounds`, message: `the done flag never rose in ${submits} submits` });
+            }
+        }
+        // the predecessor pass (PD-11, PD-27) under the plateau rule
+        const passed = await predecessorPass({
+            algorithm: ALGORITHM,
+            ctx,
+            scope,
+            predKernel,
+            recordFill,
+            graph,
+            dist,
+            pred,
+            n,
+            arcCount,
+            source,
+            mode: 0,
+        });
+        if (passed.orphans !== 0) {
+            // (2) of PD-27: every reached non-source node has an admitted in-arc under non-negative weights
+            throw new WebGpuGraphError("E_VALIDATION", `${ALGORITHM}: ${passed.orphans} reached node(s) the predecessor key never reached (a kernel bug)`, { label: `${ALGORITHM}/pred`, message: `${passed.orphans} orphan(s) in the predecessor pass` });
+        }
+        const distOut = dest ?? new Float32Array(n);
+        distOut.set(passed.dist);
+        let reachedCount = 0;
+        for (const d of distOut) {
+            if (d !== Infinity) {
+                reachedCount += 1;
+            }
+        }
+        return { dist: distOut, predArc: passed.predArc, reachedCount };
+    }
+    finally {
+        scope.dispose();
+    }
+}
+/**
+ * Single-source shortest paths on the device (spec 3.3 line 808, design 8.4, 9.7): `dist` in f32, bitwise equal to
+ * the f32 Dijkstra (PD-9), `predArc` a tight arc one PD-27 key step below each reached node (the chain always ends
+ * at the source), `reachedCount`; `cutoff` as the CPU port reads it (`dv <= cutoff`), `weights` a per-arc override
+ * of the snapshot's column for this run; a run with unit weights is the BFS (PD-22).
+ * @param ctx - the context whose device runs the kernels
+ * @param s - the snapshot (uploaded through ctx.residency, or found there)
+ * @param source - the source node index (E_INVALID_ARGUMENT outside `[0, n)`)
+ * @param options - `cutoff` and `weights`, plus dest (a Float32Array of length n for `dist`) / signal / onProgress
+ * @returns the distances, the predecessor arcs and the reached count
+ */
+export function sssp(ctx, s, source, options) {
+    return ssspWithTuning(ctx, s, source, options, {});
+}
+//# sourceMappingURL=sssp.js.map

package/dist/src/algorithms/sssp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sssp.js","sourceRoot":"","sources":["../../../src/algorithms/sssp.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqDG;AAEH,OAAO,EAAgC,aAAa,EAAgC,MAAM,uBAAuB,CAAC;AAElH,OAAO,EAAE,YAAY,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAEzF,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAG/D,OAAO,EACH,WAAW,EACX,iBAAiB,EACjB,eAAe,EACf,aAAa,EACb,cAAc,EACd,UAAU,GACb,MAAM,eAAe,CAAC;AACvB,OAAO,EAAqB,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC7E,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,CAAC,EAAE,MAAM,2BAA2B,CAAC;AAC/D,OAAO,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAK/D,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,EAAuB,cAAc,EAAE,MAAM,YAAY,CAAC;AAEjE,MAAM,SAAS,GAAG,MAAM,CAAC;AAEzB,6IAA6I;AAC7I,MAAM,UAAU,GAAG,EAAE,CAAC;AAEtB;;;;;;GAMG;AACH,MAAM,UAAU,GAAG,CAAC,GAAG,qBAAqB,GAAG,EAAE,CAAC;AAgClD;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAC,KAAa;IAChC,OAAO,IAAI,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,MAAiB,EAAE,IAAY;IACrD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AACrD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,SAAiB,EAAE,OAAgB;IACvD,OAAO,IAAI,gBAAgB,CACvB,WAAW,EACX,GAAG,SAAS,0BAA0B,EACtC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAC3C,CAAC;AACN,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,SAAiB,EAAE,MAAc,EAAE,CAAS;IACrE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,GAAG,SAAS,YAAY,MAAM,mBAAmB,CAAC,GAAG,EAAE;YACpG,QAAQ,EAAE,QAAQ;YAClB,KAAK,EAAE,MAAM;YACb,QAAQ,EAAE,qBAAqB,CAAC,GAAG;SACtC,CAAC,CAAC;IACP,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAS,MAAM,CAAC,KAAoB,EAAE,IAAY;IAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IAC1B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC5B,MAAM,IAAI,gBAAgB,CAAC,cAAc,EAAE,GAAG,SAAS,cAAc,IAAI,6BAA6B,EAAE;YACpG,KAAK,EAAE,GAAG,SAAS,WAAW;YAC9B,OAAO,EAAE,aAAa,IAAI,6BAA6B;SAC1D,CAAC,CAAC;IACP,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,SAAiB,EAAE,IAA4C,EAAE,CAAS;IAChG,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACrB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,IAAI,IAAI,YAAY,YAAY,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,YAAY,WAAW,EAAE,CAAC;QAC1F,OAAO,IAAW,CAAC;IACvB,CAAC;IACD,MAAM,IAAI,gBAAgB,CACtB,oBAAoB,EACpB,GAAG,SAAS,2CAA2C,CAAC,sBAAsB,EAC9E;QACI,QAAQ,EAAE,MAAM;QAChB,KAAK,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG;QACjD,QAAQ,EAAE,gBAAgB,CAAC,uBAAuB;KACrD,CACJ,CAAC;AACN,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAAC,SAAiB,EAAE,MAA0B;IACzE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO,QAAQ,CAAC;IACpB,CAAC;IACD,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,GAAG,SAAS,0BAA0B,EAAE;YACrF,QAAQ,EAAE,QAAQ;YAClB,KAAK,EAAE,MAAM;YACb,QAAQ,EAAE,8DAA8D;SAC3E,CAAC,CAAC;IACP,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAC1B,SAAiB,EACjB,CAAgB,EAChB,OAAkC;IAElC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YACxB,GAAG,IAAI,CAAC,CAAC;QACb,CAAC;QACD,OAAO;YACH,MAAM,EAAE,CAAC,CAAC,OAAO;YACjB,QAAQ,EAAE,IAAI;YACd,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,aAAa;YAC7B,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,kBAAkB;YACvC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,aAAa;YAC7B,GAAG;SACN,CAAC;IACN,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QAChC,MAAM,IAAI,gBAAgB,CACtB,oBAAoB,EACpB,GAAG,SAAS,iBAAiB,OAAO,CAAC,MAAM,0BAA0B,CAAC,CAAC,QAAQ,OAAO,EACtF,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CACvE,CAAC;IACN,CAAC;IACD,+GAA+G;IAC/G,MAAM,MAAM,GAAQ,OAAO,YAAY,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3F,IAAI,MAAM,GAAG,IAAI,CAAC;IAClB,IAAI,WAAW,GAAG,IAAI,CAAC;IACvB,IAAI,MAAM,GAAG,IAAI,CAAC;IAClB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACV,MAAM,GAAG,KAAK,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACR,WAAW,GAAG,KAAK,CAAC;QACxB,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,MAAM,GAAG,KAAK,CAAC;QACnB,CAAC;QACD,GAAG,IAAI,CAAC,CAAC;IACb,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;AAC1E,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACjC,GAAe,EACf,CAAgB,EAChB,MAAc,EACd,MAAc,EACd,IAAgB,EAChB,OAAkC;IAElC,MAAM,QAAQ,GAAG,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACtE,MAAM,GAAG,GAAG,MAAM,aAAa,CAC3B,GAAG,EACH,CAAC,EACD,MAAM,EACN,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,EACtE,EAAE,QAAQ,EAAE,CAAC,EAAE,CAClB,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,IAAI,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,CAAC,YAAY,EAAE,CAAC;AACzE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,CAAS;IACrC,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;AAC3C,CAAC;AAyCD;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,KAA2B;IAC7D,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;IAC9G,MAAM,EAAE,GAAG,GAAG,CAAC,aAAa,CAAC;IAC7B,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;IAC7B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IACpB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IAClC,MAAM,QAAQ,GAAY,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IAClG,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnF,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG;QACf,EAAE;QACF,CAAC;QACD,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,QAAQ;QAChB,QAAQ,EAAE,CAAC;QACX,MAAM;QACN,MAAM,EAAE,QAAQ,CAAC,MAAM,IAAI,CAAC;QAC5B,IAAI;KACP,CAAC;IACF,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC;IAClE,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,SAAS,CAAC;QACN,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,GAAG,EAAE,GAAG,SAAS,OAAO,CAAC,CAAC;QACzD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,SAAiB,EAAQ,EAAE;YACzD,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,eAAe,EAAE,EAAE,GAAG,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;YACjF,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;YAC3E,UAAU,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC;QACF,IAAI,OAAO,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YAC9B,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,qBAAqB,EAAE,SAAS,EAAE,EAAE,CAAC;YACrE,UAAU,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC7B,CAAC;QACD,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;QAC7C,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACpE,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACpE,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9E,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC;QAC3C,GAAG,CAAC,WAAW,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,CAAC;QACb,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACzE,IAAI,OAAO,GAAG,qBAAqB,EAAE,CAAC;YAClC,OAAO;gBACH,IAAI,EAAE,IAAI,YAAY,CAAC,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;gBACnD,OAAO,EAAE,IAAI,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;gBAC7D,OAAO;aACV,CAAC;QACN,CAAC;QACD,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;YACvB,MAAM,IAAI,gBAAgB,CACtB,cAAc,EACd,GAAG,SAAS,kDAAkD,OAAO,oCAAoC,CAAC,GAAG,EAC7G,EAAE,KAAK,EAAE,GAAG,SAAS,OAAO,EAAE,OAAO,EAAE,sCAAsC,OAAO,UAAU,EAAE,CACnG,CAAC;QACN,CAAC;QACD,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,CAAC;AACL,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAChC,GAAe,EACf,CAAgB,EAChB,MAAc,EACd,OAAkD,EAClD,MAAkB;IAElB,GAAG,CAAC,WAAW,EAAE,CAAC;IAClB,MAAM,oBAAoB,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IACnC,MAAM,eAAe,GAAG,MAAM,CAAC,eAAe,IAAI,qBAAqB,CAAC;IACxE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,eAAe,CAAC,IAAI,eAAe,GAAG,CAAC,IAAI,eAAe,GAAG,qBAAqB,EAAE,CAAC;QACvG,MAAM,IAAI,gBAAgB,CACtB,oBAAoB,EACpB,GAAG,SAAS,+CAA+C,qBAAqB,GAAG,EACnF;YACI,QAAQ,EAAE,iBAAiB;YAC3B,KAAK,EAAE,eAAe;YACtB,QAAQ,EAAE,qBAAqB,qBAAqB,GAAG;SAC1D,CACJ,CAAC;IACN,CAAC;IACD,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;QACrF,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,GAAG,SAAS,0CAA0C,EAAE;YACrG,QAAQ,EAAE,OAAO;YACjB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,QAAQ,EAAE,0BAA0B;SACvC,CAAC,CAAC;IACP,CAAC;IACD,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,cAAc,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAG,eAAe,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;IAC3D,IAAI,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;QAC3B,MAAM,OAAO,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC;IACD,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QACnC,OAAO,eAAe,CAAC,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAClE,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;QACtB,MAAM,IAAI,gBAAgB,CAAC,eAAe,EAAE,GAAG,SAAS,+CAA+C,EAAE;YACrG,OAAO,EAAE,sBAAsB;YAC/B,IAAI,EAAE,iBAAiB;SAC1B,CAAC,CAAC;IACP,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QACjB,MAAM,IAAI,gBAAgB,CAAC,eAAe,EAAE,GAAG,SAAS,qDAAqD,EAAE;YAC3G,OAAO,EAAE,uBAAuB;SACnC,CAAC,CAAC;IACP,CAAC;IACD,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;IACvB,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,2BAA2B,CAAC;IAC1D,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;IAClD,4GAA4G;IAC5G,4GAA4G;IAC5G,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,UAAU,CAAC,GAAG,UAAU,CAAC;IACvE,IAAI,CAAC,GAAG,GAAG,GAAG,KAAK,EAAE,CAAC;QAClB,MAAM,IAAI,gBAAgB,CACtB,aAAa,EACb,GAAG,SAAS,2BAA2B,GAAG,2BAA2B,CAAC,GAAG,GAAG,qBAAqB,KAAK,mDAAmD,EACzJ,EAAE,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,CACvE,CAAC;IACN,CAAC;IACD,0GAA0G;IAC1G,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CACrB,MAAM,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAC1G,CAAC;IACF,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IACxD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACzD,IAAI,CAAC;QACD,MAAM,EAAE,GAAG,GAAG,CAAC,aAAa,CAAC;QAC7B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;QACpB,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5D,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,EAAE,WAAW,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;QACzE,MAAM,QAAQ,GAAY,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QAC9F,MAAM,OAAO,GAAY,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QACnG,oHAAoH;QACpH,MAAM,SAAS,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;QAC5E,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;QAC7B,IAAI,cAAmC,CAAC;QACxC,IAAI,MAAM,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,QAAQ,EAAE,SAAS,CAAC,CAAC;YACxD,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;YAChD,cAAc,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;QACvD,CAAC;QACD,MAAM,GAAG,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,MAAM,eAAe,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC;QAC9E,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,GAAG,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClG,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5D,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;QACxD,MAAM,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;QAC7B,MAAM,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAAC;QAC9B,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,UAAU,GAAG,CAAC,IAA2B,EAAE,GAAY,EAAE,KAAa,EAAE,KAAa,EAAQ,EAAE;YACjG,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;YAC7E,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7G,CAAC,CAAC;QACF,MAAM,MAAM,GAAG,CAAC,KAAmB,EAAsC,EAAE;YACvE,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QAC1B,CAAC,CAAC;QAEF,0GAA0G;QAC1G,wGAAwG;QACxG,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,GAAG,EAAE,GAAG,SAAS,QAAQ,CAAC,CAAC;QAC1D,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,UAAU,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;QAC7C,UAAU,CAAC,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;QACtD,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,MAAM,MAAM,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC;QAC7B,GAAG,CAAC,WAAW,EAAE,CAAC;QAClB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,iBAAiB,EAAE,CAAC,EAAE,aAAa,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;QAC7F,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QAE5E,gEAAgE;QAChE,MAAM,UAAU,GAAiB;YAC7B,KAAK,EAAE,QAAQ;YACf,KAAK,EAAE,GAAG;YACV,UAAU,EAAE,CAAC,CAAC,SAAS,EAAE,kFAAkF;YAC3G,QAAQ;YACR,KAAK;YACL,GAAG,EAAE,MAAM;YACX,QAAQ,EAAE,QAAQ;YAClB,QAAQ,EAAE,CAAC,CAAC,aAAa;SAC5B,CAAC;QACF,MAAM,SAAS,GAAiB;YAC5B,KAAK,EAAE,OAAO;YACd,KAAK,EAAE,GAAG;YACV,UAAU,EAAE,CAAC,CAAC,kBAAkB,EAAE,4CAA4C;YAC9E,QAAQ;YACR,KAAK;YACL,GAAG,EAAE,KAAK;YACV,QAAQ,EAAE,QAAQ;YAClB,QAAQ,EAAE,CAAC,CAAC,QAAQ;SACvB,CAAC;QACF,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,qEAAqE;QACxH,MAAM,WAAW,GAAG;YAChB,EAAE;YACF,CAAC;YACD,YAAY,EAAE,GAAG;YACjB,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,QAAQ;YAChB,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC;YAC1B,MAAM;YACN,MAAM,EAAE,SAAS,CAAC,MAAM,IAAI,EAAE;SACjC,CAAC;QACF,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,SAAS,CAAC;YACN,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,GAAG,EAAE,GAAG,SAAS,SAAS,CAAC,CAAC;YAC3D,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,eAAe,EAAE,EAAE,GAAG,WAAW,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;YACxE,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,eAAe,EAAE,EAAE,GAAG,WAAW,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;YACvE,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YACvG,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;YACpG,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,eAAe,EAAE,KAAK,EAAE,EAAE,CAAC;gBACnD,yGAAyG;gBACzG,uGAAuG;gBACvG,OAAO,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;gBAC3C,OAAO,CAAC,YAAY,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;gBACvC,OAAO,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBACtC,OAAO,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;gBAC3C,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC1D,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5D,CAAC;YACD,KAAK,CAAC,OAAO,EAAE,CAAC;YAChB,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACrF,MAAM,OAAO,GACT,MAAM,CAAC,OAAO,KAAK,SAAS;gBACxB,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC,UAAU,CAAC,CAAC;YACzF,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC,QAAQ,CAAC;YACtC,cAAc,IAAI,eAAe,CAAC;YAClC,OAAO,IAAI,CAAC,CAAC;YACb,GAAG,CAAC,WAAW,EAAE,CAAC;YAClB,IAAI,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;gBAC3B,MAAM,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;YAC3C,CAAC;YACD,OAAO,EAAE,UAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,SAAS,CAAC,EAAE,SAAS,CAAC,CAAC;YACtE,IAAI,OAAO,KAAK,IAAI,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;gBACnD,MAAM,CAAC,OAAO,CAAC,cAAc,GAAG,CAAC,EAAE,iBAAiB,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;YACnG,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACb,MAAM;YACV,CAAC;YACD,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACb,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAChC,IAAI,QAAQ,CACR,MAAM,GAAG,CAAC,QAAQ,CAAC,IAAI,CACnB,QAAQ,CAAC,MAAM,EACf,iBAAiB,CAAC,UAAU,EAC5B,SAAS,EACT,QAAQ,CAAC,MAAM,CAClB,CACJ,CACJ,CAAC;gBACF,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;oBACb,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,mBAAmB,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC;oBAC3F,MAAM,IAAI,gBAAgB,CACtB,aAAa,EACb,GAAG,SAAS,mBAAmB,MAAM,2BAA2B,GAAG,aAAa,EAChF,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,CAClE,CAAC;gBACN,CAAC;gBACD,MAAM,IAAI,gBAAgB,CACtB,eAAe,EACf,GAAG,SAAS,uBAAuB,MAAM,CAAC,KAAK,EAAE,eAAe,CAAC,uBAAuB,SAAS,4DAA4D,EAC7J,EAAE,OAAO,EAAE,wBAAwB,EAAE,IAAI,EAAE,iDAAiD,EAAE,CACjG,CAAC;YACN,CAAC;YACD,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;gBACvB,MAAM,IAAI,gBAAgB,CACtB,cAAc,EACd,GAAG,SAAS,iCAAiC,OAAO,qBAAqB,SAAS,UAAU,EAC5F,EAAE,KAAK,EAAE,GAAG,SAAS,SAAS,EAAE,OAAO,EAAE,+BAA+B,OAAO,UAAU,EAAE,CAC9F,CAAC;YACN,CAAC;QACL,CAAC;QAED,6DAA6D;QAC7D,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC;YACjC,SAAS,EAAE,SAAS;YACpB,GAAG;YACH,KAAK;YACL,UAAU;YACV,UAAU;YACV,KAAK;YACL,IAAI;YACJ,IAAI;YACJ,CAAC;YACD,QAAQ;YACR,MAAM;YACN,IAAI,EAAE,CAAC;SACV,CAAC,CAAC;QACH,IAAI,MAAM,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;YACvB,gGAAgG;YAChG,MAAM,IAAI,gBAAgB,CACtB,cAAc,EACd,GAAG,SAAS,KAAK,MAAM,CAAC,OAAO,mEAAmE,EAClG,EAAE,KAAK,EAAE,GAAG,SAAS,OAAO,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,OAAO,oCAAoC,EAAE,CACjG,CAAC;QACN,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,IAAI,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5C,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACtB,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;gBACjB,YAAY,IAAI,CAAC,CAAC;YACtB,CAAC;QACL,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,YAAY,EAAE,CAAC;IACpE,CAAC;YAAS,CAAC;QACP,KAAK,CAAC,OAAO,EAAE,CAAC;IACpB,CAAC;AACL,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,IAAI,CAChB,GAAe,EACf,CAAgB,EAChB,MAAc,EACd,OAAqC;IAErC,OAAO,cAAc,CAAC,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;AACvD,CAAC"}

package/dist/src/constants.d.ts

@@ -166,4 +166,16 @@ export declare const GRID_EXTENT_FLOOR = 0.000001;
 export declare const GRID_BBOX_MARGIN = 1.01;
 /** The key width the grid always sorts with (P4 PD-5): three 8-bit passes cover the 19-bit 2D keys at G = 512 and the 22-bit 3D keys at G = 128, and an odd pass count leaves `sortedIdx` in the scratch pair. */
 export declare const GRID_SORT_BITS = 24;
+/** Design 8.4 (P8 PD-7): traversal levels recorded per submit -- one four-byte readback per 32 BFS levels, SSSP rounds or closeness levels. */
+export declare const MAX_LEVELS_PER_SUBMIT = 32;
+/** Design 8.4 and 6 row 8 (P8): a frontier at most this long runs the fused expand-contract kernel (Merrill's "fleeting iterations"); the default of the `fusedMax` uniform, which a test may set to 0 or `U32_MAX`. */
+export declare const FUSED_FRONTIER_MAX = 4096;
+/** P8-T4: the indirect dispatch slots `frontier-finalize` writes per level (expand, contract, fused, fill-bits, bitset-build, bottom-up, fused-retry); the args buffer is `MAX_LEVELS_PER_SUBMIT x FRONTIER_CANDIDATES x 16` bytes. */
+export declare const FRONTIER_CANDIDATES = 7;
+/** Design 8.4 (P8 PD-21): Beamer's beta -- switch back to top-down when `frontierCount * BEAMER_BETA < unvisitedCount` and the frontier is shrinking; alpha is derived from the graph, so it has no constant. */
+export declare const BEAMER_BETA = 24;
+/** Design 8.4 (P8 PD-22): the near-far split `delta = SSSP_DELTA_FACTOR * avgWeight / avgDegree`, computed on the host from the weight vector the run uses. */
+export declare const SSSP_DELTA_FACTOR = 32;
+/** The bit pattern of +Infinity, the unreached sentinel of `dist` (P8 PD-9); interpolated into the prelude as `F32_INF_BITS` so no body types the literal. */
+export declare const F32_INF_BITS = 2139095040;
 //# sourceMappingURL=constants.d.ts.map