tensorgrad 0.0.14 → 0.0.16

package/dist/runtime.js

@@ -1,375 +0,0 @@
-// WebGPU runtime. Reads a BufferPlan + KernelSpec[] (produced by codegen),
-// allocates real GPU buffers and pipelines, and provides a `step()` method
-// that uploads inputs, dispatches all kernels, and reads back outputs.
-//
-// Browser-only: this module needs `navigator.gpu` at runtime.
-/**
- * Activation readbacks for one `step()`/`run()` call. Keyed by the names
- * passed to `capture(name, t)` during the trace. `get(name)` throws if the
- * name isn't registered or wasn't read back this call (i.e., the call was
- * made without `{ withCaptures: true }`); use `has(name)` if you need to
- * branch. `shapeOf(name)` returns the static-after-compile shape and works
- * regardless of whether captures were read back.
- */
-export class Captures {
-    shapes;
-    data;
-    constructor(shapes, data) {
-        this.shapes = shapes;
-        this.data = data;
-    }
-    get(name) {
-        const d = this.data.get(name);
-        if (!d) {
-            const known = [...this.data.keys()].sort().join(', ');
-            const detail = known ? `Known this call: ${known}` : `(call run/step with { withCaptures: true } to populate)`;
-            throw new Error(`Captures.get: '${name}' not present. ${detail}`);
-        }
-        return d;
-    }
-    shapeOf(name) {
-        const s = this.shapes[name];
-        if (!s) {
-            const known = Object.keys(this.shapes).sort().join(', ') || '(none registered)';
-            throw new Error(`Captures.shapeOf: '${name}' not registered. Known: ${known}`);
-        }
-        return s;
-    }
-    has(name) { return this.data.has(name); }
-    names() { return [...this.data.keys()].sort(); }
-}
-// Inlined numeric values (per WebGPU spec) so this module is importable in Node
-// for codegen-only usage. The browser provides GPUBufferUsage as a global, but
-// referencing it at module scope would crash before any browser code runs.
-const STORAGE_RW = 0x80 /*STORAGE*/ | 0x8 /*COPY_DST*/ | 0x4; /*COPY_SRC*/
-const READBACK = 0x1 /*MAP_READ*/ | 0x8; /*COPY_DST*/
-export async function createRuntime(plan, kernels, lossBufferId, opts = {}) {
-    const device = opts.device ?? await acquireDevice();
-    const queue = device.queue;
-    // ---- Allocate one GPUBuffer per BufferSpec --------------------------------
-    // State buffers also get filled with their initValue at allocation time.
-    // Param buffers may be supplied externally via opts.sharedParams; in that
-    // case we reuse the provided GPUBuffer instead of allocating, and the
-    // sibling compile that owns it is responsible for upload + lifetime.
-    // ownedBufferIds tracks which buffers we allocated ourselves (and so must
-    // destroy on .destroy()) vs which were handed in by a sibling compile.
-    const buffers = new Map();
-    const ownedBufferIds = new Set();
-    const sharedParams = opts.sharedParams;
-    for (const spec of plan.buffers) {
-        const shared = spec.kind === 'param' ? sharedParams?.get(spec.name) : undefined;
-        if (shared) {
-            if (shared.size !== spec.byteSize) {
-                throw new Error(`sharedParams: size mismatch for '${spec.name}' — supplied ${shared.size} bytes, ` +
-                    `compiled graph expects ${spec.byteSize}.`);
-            }
-            buffers.set(spec.id, shared);
-            continue;
-        }
-        const buf = device.createBuffer({
-            size: spec.byteSize,
-            usage: STORAGE_RW,
-            label: spec.name ?? `t${spec.id}-${spec.kind}`,
-        });
-        buffers.set(spec.id, buf);
-        ownedBufferIds.add(spec.id);
-        if (spec.kind === 'state')
-            fillStateBuffer(spec, buf);
-    }
-    // ---- Compile pipelines per kernel; cache by WGSL source -------------------
-    // Push an error scope around each shader+pipeline creation so we can surface
-    // the actual compile error rather than the cryptic "previous error" that
-    // comes from using an invalid pipeline at dispatch time.
-    const moduleCache = new Map();
-    const pipelines = [];
-    const probes = [];
-    for (const k of kernels) {
-        if (!k.wgsl) {
-            pipelines.push(null);
-            continue;
-        }
-        let module = moduleCache.get(k.wgsl);
-        if (!module) {
-            module = device.createShaderModule({ code: k.wgsl, label: k.opKind });
-            moduleCache.set(k.wgsl, module);
-        }
-        device.pushErrorScope('validation');
-        const pipeline = device.createComputePipeline({
-            layout: 'auto',
-            compute: { module, entryPoint: 'main' },
-            label: k.opKind,
-        });
-        pipelines.push(pipeline);
-        probes.push(device.popErrorScope().then(err => err ? { k, module: module, err } : null));
-    }
-    const probeResults = await Promise.all(probes);
-    const failures = probeResults.filter((p) => p != null);
-    if (failures.length > 0) {
-        const reports = [];
-        for (const { k, module, err } of failures) {
-            const info = await module.getCompilationInfo();
-            const messages = info.messages
-                .map(m => `  L${m.lineNum}:${m.linePos} [${m.type}] ${m.message}`)
-                .join('\n');
-            reports.push(`[shader compile error] ${k.opKind} (op #${k.opIndex}): ${err.message}\n` +
-                (messages || '  (no compilation messages)') +
-                `\n--- WGSL ---\n${k.wgsl}\n-----------`);
-        }
-        // eslint-disable-next-line no-console
-        console.error(reports.join('\n\n'));
-        throw new Error(`tensorgrad: ${failures.length} shader(s) failed to compile (see console).`);
-    }
-    // ---- Pre-build bind groups (static — buffer ids don't change per step) ---
-    const bindGroups = kernels.map((k, i) => {
-        const pipeline = pipelines[i];
-        if (!pipeline)
-            return null;
-        return device.createBindGroup({
-            layout: pipeline.getBindGroupLayout(0),
-            entries: k.bindings.map((bufId, idx) => ({
-                binding: idx,
-                resource: { buffer: buffers.get(bufId) },
-            })),
-        });
-    });
-    // ---- Output readback staging buffer ---------------------------------------
-    // `outputBufferId` is the graph's main output (loss for training, the user's
-    // returned tensor for forward-only). step() reads back its first element;
-    // run() reads back the full Float32Array.
-    const outputSpec = plan.buffers[lossBufferId];
-    const outputReadback = device.createBuffer({ size: outputSpec.byteSize, usage: READBACK });
-    let captureStaging = null;
-    function ensureCaptureStaging() {
-        if (captureStaging)
-            return captureStaging;
-        let totalBytes = 0;
-        const slices = [];
-        for (const [name, bufId] of plan.capturesByName) {
-            const spec = plan.buffers[bufId];
-            // copyBufferToBuffer offsets must be 4-aligned. Capture byteSizes are
-            // always shape-product × 4 (f32/i32/bool all 4 bytes), so cumulative
-            // offsets stay aligned.
-            slices.push({ name, bufId, offset: totalBytes, byteSize: spec.byteSize });
-            totalBytes += spec.byteSize;
-        }
-        const buffer = device.createBuffer({ size: totalBytes, usage: READBACK, label: 'captures-staging' });
-        captureStaging = { buffer, slices };
-        return captureStaging;
-    }
-    // ---- dispatch() — shared core for step() and run() -----------------------
-    // Uploads inputs, dispatches all kernels (in order), queues writebacks, copies
-    // the output buffer into its staging, optionally copies captures into theirs,
-    // submits, and reads back. Returns the full output Float32Array; step() takes
-    // [0] for scalar loss, run() returns it whole.
-    //
-    // **Concurrent calls auto-serialize.** Two `step()`/`run()` calls on the same
-    // runtime would otherwise both try to `mapAsync` the shared output staging
-    // buffer at the same time and trip "Buffer already has an outstanding map
-    // pending." We chain each new dispatch onto the prior one's promise so they
-    // run sequentially even when fired from independent async paths (e.g., a
-    // training loop's auxiliary `refreshPrediction()` + `writeDiagnostic()`).
-    let pending = Promise.resolve();
-    async function dispatch(inputs, wantCaptures) {
-        const turn = pending.catch(() => { }).then(() => dispatchUnsynchronized(inputs, wantCaptures));
-        pending = turn;
-        return turn;
-    }
-    async function dispatchUnsynchronized(inputs, wantCaptures) {
-        if (wantCaptures && plan.capturesByName.size === 0) {
-            throw new Error(`withCaptures=true but no capture(...) calls were registered during ` +
-                `the trace. Add capture('name', tensor) inside your forward pass for ` +
-                `the intermediates you want read back.`);
-        }
-        for (const [name, bufId] of plan.inputsByName) {
-            const data = inputs[name];
-            if (!data)
-                throw new Error(`tensorgrad: missing input '${name}'`);
-            const expectedBytes = plan.buffers[bufId].byteSize;
-            if (data.byteLength !== expectedBytes) {
-                throw new Error(`tensorgrad: input '${name}' has ${data.byteLength} bytes, expected ${expectedBytes}`);
-            }
-            // Cast to BufferSource: typed arrays are accepted by writeBuffer at runtime
-            // but TS may infer ArrayBufferLike (vs ArrayBuffer) under strict configs.
-            queue.writeBuffer(buffers.get(bufId), 0, data);
-        }
-        const encoder = device.createCommandEncoder({ label: 'tensorgrad-step' });
-        for (let i = 0; i < kernels.length; i++) {
-            const k = kernels[i];
-            if (!k.wgsl || k.threads === 0)
-                continue;
-            const pipeline = pipelines[i];
-            const bindGroup = bindGroups[i];
-            const pass = encoder.beginComputePass({ label: k.opKind });
-            pass.setPipeline(pipeline);
-            pass.setBindGroup(0, bindGroup);
-            // WebGPU caps each dispatch dimension at 65535 workgroups. Split into 2D
-            // when a kernel needs more than that on the X axis. Kernels compute their
-            // global index as `gid.x + gid.y * (65535 * workgroup_size)`, matching the
-            // stride we set here. For dispatches that fit in one row, gid.y is 0.
-            const wgCount = Math.max(1, Math.ceil(k.threads / k.workgroupSize));
-            const MAX_X = 65535;
-            const wgX = Math.min(wgCount, MAX_X);
-            const wgY = Math.ceil(wgCount / MAX_X);
-            pass.dispatchWorkgroups(wgX, wgY, 1);
-            pass.end();
-        }
-        // After all dispatches: writebacks (Adam state, updated params). Empty for
-        // forward-only compiles.
-        for (const wb of plan.writebacks) {
-            encoder.copyBufferToBuffer(buffers.get(wb.source), 0, buffers.get(wb.dest), 0, wb.bytes);
-        }
-        encoder.copyBufferToBuffer(buffers.get(lossBufferId), 0, outputReadback, 0, outputSpec.byteSize);
-        // Capture readbacks (only when opted in). All captures concatenate into
-        // a single staging buffer so we mapAsync once instead of N times.
-        let layout = null;
-        if (wantCaptures) {
-            layout = ensureCaptureStaging();
-            for (const s of layout.slices) {
-                encoder.copyBufferToBuffer(buffers.get(s.bufId), 0, layout.buffer, s.offset, s.byteSize);
-            }
-        }
-        queue.submit([encoder.finish()]);
-        await outputReadback.mapAsync(GPUMapMode.READ);
-        const output = new Float32Array(outputReadback.getMappedRange().slice(0));
-        outputReadback.unmap();
-        const captures = new Map();
-        if (layout) {
-            await layout.buffer.mapAsync(GPUMapMode.READ);
-            const range = layout.buffer.getMappedRange();
-            for (const s of layout.slices) {
-                // Copy out (slice) before unmap — the underlying ArrayBuffer is
-                // detached when the buffer unmaps.
-                captures.set(s.name, new Float32Array(range, s.offset, s.byteSize / 4).slice());
-            }
-            layout.buffer.unmap();
-        }
-        return { output, captures };
-    }
-    async function step(inputs, opts) {
-        const r = await dispatch(inputs, opts?.withCaptures === true);
-        if (opts?.withCaptures)
-            return { loss: r.output[0], captures: new Captures(captureShapes, r.captures) };
-        return r.output[0];
-    }
-    async function run(inputs, opts) {
-        const r = await dispatch(inputs, opts?.withCaptures === true);
-        if (opts?.withCaptures)
-            return { output: r.output, captures: new Captures(captureShapes, r.captures) };
-        return r.output;
-    }
-    // ---- uploadParams ---------------------------------------------------------
-    function uploadParams(params, opts) {
-        const partial = opts?.partial ?? false;
-        for (const name of Object.keys(params)) {
-            if (!plan.paramsByName.has(name)) {
-                throw new Error(`uploadParams: unknown param '${name}'. ` +
-                    `Known: ${[...plan.paramsByName.keys()].sort().join(', ')}`);
-            }
-        }
-        if (!partial) {
-            for (const name of plan.paramsByName.keys()) {
-                if (!(name in params)) {
-                    throw new Error(`uploadParams: missing param '${name}'. ` +
-                        `Pass { partial: true } if you mean to update only some params.`);
-                }
-            }
-        }
-        for (const [name, bufId] of plan.paramsByName) {
-            const data = params[name];
-            if (!data)
-                continue;
-            const expected = plan.buffers[bufId].byteSize / 4;
-            if (data.length !== expected) {
-                throw new Error(`uploadParams: '${name}' has ${data.length} elements, expected ${expected}`);
-            }
-            queue.writeBuffer(buffers.get(bufId), 0, data);
-        }
-    }
-    // ---- download helpers -----------------------------------------------------
-    async function downloadFromMap(map) {
-        const stagings = [];
-        const encoder = device.createCommandEncoder({ label: 'tensorgrad-download' });
-        for (const [name, bufId] of map) {
-            const spec = plan.buffers[bufId];
-            const staging = device.createBuffer({ size: spec.byteSize, usage: READBACK });
-            encoder.copyBufferToBuffer(buffers.get(bufId), 0, staging, 0, spec.byteSize);
-            stagings.push({ name, buf: staging, bytes: spec.byteSize });
-        }
-        queue.submit([encoder.finish()]);
-        const out = {};
-        for (const s of stagings) {
-            await s.buf.mapAsync(GPUMapMode.READ);
-            out[s.name] = new Float32Array(s.buf.getMappedRange().slice(0));
-            s.buf.unmap();
-            s.buf.destroy();
-        }
-        return out;
-    }
-    // Fill a state buffer with its declared initValue (typically 0). Float and
-    // int both serialize to 4 bytes per element. Used at allocation time and on
-    // resetOptimizerState() — same logic, two callers.
-    function fillStateBuffer(spec, target) {
-        const elements = spec.byteSize / 4;
-        const init = spec.dtype === 'f32'
-            ? new Float32Array(elements).fill(spec.initValue ?? 0)
-            : new Int32Array(elements).fill(Math.trunc(spec.initValue ?? 0));
-        queue.writeBuffer(target, 0, init);
-    }
-    function resetOptimizerState() {
-        for (const spec of plan.buffers) {
-            if (spec.kind === 'state')
-                fillStateBuffer(spec, buffers.get(spec.id));
-        }
-    }
-    // Build the params map AFTER buffer allocation so it points at the actual
-    // GPUBuffers (shared or freshly allocated).
-    const params = new Map();
-    for (const [name, bufId] of plan.paramsByName) {
-        params.set(name, buffers.get(bufId));
-    }
-    // Static-after-compile shape metadata so users don't have to recompute
-    // strides to interpret a flat capture readback.
-    const captureShapes = {};
-    for (const [name, bufId] of plan.capturesByName) {
-        captureShapes[name] = [...plan.buffers[bufId].shape];
-    }
-    const outputShape = [...plan.buffers[lossBufferId].shape];
-    const destroy = () => {
-        for (const [id, b] of buffers) {
-            if (ownedBufferIds.has(id))
-                b.destroy();
-        }
-        outputReadback.destroy();
-        if (captureStaging)
-            captureStaging.buffer.destroy();
-    };
-    return {
-        device,
-        params,
-        outputShape,
-        uploadParams,
-        downloadParams: () => downloadFromMap(plan.paramsByName),
-        downloadParamGrads: () => downloadFromMap(plan.paramGradsByName),
-        step,
-        run,
-        resetOptimizerState,
-        destroy,
-    };
-}
-/** Same machinery as `createRuntime`, narrower public type: a forward-only
- *  graph exposes `run()` instead of `step()` (no optimizer state, no scalar-
- *  loss readback). The full runtime object is built once and projected by
- *  `compileForward` to the public shape. */
-export async function createForwardRuntime(plan, kernels, outputBufferId, opts = {}) {
-    return await createRuntime(plan, kernels, outputBufferId, opts);
-}
-async function acquireDevice() {
-    if (typeof navigator === 'undefined' || !navigator.gpu) {
-        throw new Error('tensorgrad: WebGPU not available in this environment');
-    }
-    const adapter = await navigator.gpu.requestAdapter();
-    if (!adapter)
-        throw new Error('tensorgrad: no WebGPU adapter');
-    return await adapter.requestDevice();
-}
-//# sourceMappingURL=runtime.js.map

package/dist/runtime.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"runtime.js","sourceRoot":"","sources":["../src/runtime.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,2EAA2E;AAC3E,uEAAuE;AACvE,EAAE;AACF,8DAA8D;AAgB9D;;;;;;;GAOG;AACH,MAAM,OAAO,QAAQ;IAEA;IACA;IAFnB,YACmB,MAAyC,EACzC,IAA+B;QAD/B,WAAM,GAAN,MAAM,CAAmC;QACzC,SAAI,GAAJ,IAAI,CAA2B;IAC/C,CAAC;IACJ,GAAG,CAAC,IAAY;QACd,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACrD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,oBAAoB,KAAK,EAAE,CAAC,CAAC,CAAC,yDAAyD,CAAA;YAC9G,MAAM,IAAI,KAAK,CAAC,kBAAkB,IAAI,kBAAkB,MAAM,EAAE,CAAC,CAAA;QACnE,CAAC;QACD,OAAO,CAAC,CAAA;IACV,CAAC;IACD,OAAO,CAAC,IAAY;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC3B,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAA;YAC/E,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,4BAA4B,KAAK,EAAE,CAAC,CAAA;QAChF,CAAC;QACD,OAAO,CAAC,CAAA;IACV,CAAC;IACD,GAAG,CAAC,IAAY,IAAa,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA,CAAC,CAAC;IACzD,KAAK,KAAe,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA,CAAC,CAAC;CAC1D;AAyFD,gFAAgF;AAChF,+EAA+E;AAC/E,2EAA2E;AAC3E,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC,YAAY,GAAG,GAAG,CAAA,CAAC,YAAY;AACzE,MAAM,QAAQ,GAAG,GAAG,CAAC,YAAY,GAAG,GAAG,CAAA,CAAC,YAAY;AAEpD,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,IAAgB,EAChB,OAAqB,EACrB,YAAoB,EACpB,OAAoB,EAAE;IAEtB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,aAAa,EAAE,CAAA;IACnD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAA;IAE1B,8EAA8E;IAC9E,yEAAyE;IACzE,0EAA0E;IAC1E,sEAAsE;IACtE,qEAAqE;IACrE,0EAA0E;IAC1E,uEAAuE;IACvE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAA;IAC5C,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAA;IACxC,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAA;IACtC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,EAAE,GAAG,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QAChF,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,MAAM,IAAI,KAAK,CACb,oCAAoC,IAAI,CAAC,IAAI,gBAAgB,MAAM,CAAC,IAAI,UAAU;oBAClF,0BAA0B,IAAI,CAAC,QAAQ,GAAG,CAC3C,CAAA;YACH,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAA;YAC5B,SAAQ;QACV,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC;YAC9B,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,KAAK,EAAE,UAAU;YACjB,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE;SAC/C,CAAC,CAAA;QACF,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QACzB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC3B,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,eAAe,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IACvD,CAAC;IAED,8EAA8E;IAC9E,6EAA6E;IAC7E,yEAAyE;IACzE,yDAAyD;IACzD,MAAM,WAAW,GAAG,IAAI,GAAG,EAA2B,CAAA;IACtD,MAAM,SAAS,GAAkC,EAAE,CAAA;IAEnD,MAAM,MAAM,GAAiB,EAAE,CAAA;IAC/B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAC,SAAQ;QAAC,CAAC;QAC/C,IAAI,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QACpC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,MAAM,CAAC,kBAAkB,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAA;YACrE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;QACjC,CAAC;QACD,MAAM,CAAC,cAAc,CAAC,YAAY,CAAC,CAAA;QACnC,MAAM,QAAQ,GAAG,MAAM,CAAC,qBAAqB,CAAC;YAC5C,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE;YACvC,KAAK,EAAE,CAAC,CAAC,MAAM;SAChB,CAAC,CAAA;QACF,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QACxB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IAC3F,CAAC;IACD,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;IAC9C,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAkE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAA;IACtH,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,KAAK,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,kBAAkB,EAAE,CAAA;YAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ;iBAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;iBACjE,IAAI,CAAC,IAAI,CAAC,CAAA;YACb,OAAO,CAAC,IAAI,CACV,0BAA0B,CAAC,CAAC,MAAM,SAAS,CAAC,CAAC,OAAO,MAAM,GAAG,CAAC,OAAO,IAAI;gBACzE,CAAC,QAAQ,IAAI,6BAA6B,CAAC;gBAC3C,mBAAmB,CAAC,CAAC,IAAI,eAAe,CACzC,CAAA;QACH,CAAC;QACD,sCAAsC;QACtC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAA;QACnC,MAAM,IAAI,KAAK,CAAC,eAAe,QAAQ,CAAC,MAAM,6CAA6C,CAAC,CAAA;IAC9F,CAAC;IAED,6EAA6E;IAC7E,MAAM,UAAU,GAA4B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC/D,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;QAC7B,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAA;QAC1B,OAAO,MAAM,CAAC,eAAe,CAAC;YAC5B,MAAM,EAAE,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC;YACtC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;gBACvC,OAAO,EAAE,GAAG;gBACZ,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,EAAE;aAC1C,CAAC,CAAC;SACJ,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,8EAA8E;IAC9E,6EAA6E;IAC7E,0EAA0E;IAC1E,0CAA0C;IAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAE,CAAA;IAC9C,MAAM,cAAc,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAA;IAa1F,IAAI,cAAc,GAAyB,IAAI,CAAA;IAC/C,SAAS,oBAAoB;QAC3B,IAAI,cAAc;YAAE,OAAO,cAAc,CAAA;QACzC,IAAI,UAAU,GAAG,CAAC,CAAA;QAClB,MAAM,MAAM,GAA4B,EAAE,CAAA;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAE,CAAA;YACjC,sEAAsE;YACtE,qEAAqE;YACrE,wBAAwB;YACxB,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAA;YACzE,UAAU,IAAI,IAAI,CAAC,QAAQ,CAAA;QAC7B,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC,CAAA;QACpG,cAAc,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,CAAA;QACnC,OAAO,cAAc,CAAA;IACvB,CAAC;IAED,6EAA6E;IAC7E,+EAA+E;IAC/E,8EAA8E;IAC9E,8EAA8E;IAC9E,+CAA+C;IAC/C,EAAE;IACF,8EAA8E;IAC9E,2EAA2E;IAC3E,0EAA0E;IAC1E,4EAA4E;IAC5E,yEAAyE;IACzE,0EAA0E;IAC1E,IAAI,OAAO,GAAqB,OAAO,CAAC,OAAO,EAAE,CAAA;IACjD,KAAK,UAAU,QAAQ,CACrB,MAAiD,EACjD,YAAqB;QAErB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,sBAAsB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAA;QAC7F,OAAO,GAAG,IAAI,CAAA;QACd,OAAO,IAAI,CAAA;IACb,CAAC;IACD,KAAK,UAAU,sBAAsB,CACnC,MAAiD,EACjD,YAAqB;QAErB,IAAI,YAAY,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,KAAK,CACb,qEAAqE;gBACrE,sEAAsE;gBACtE,uCAAuC,CACxC,CAAA;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAA;YACzB,IAAI,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,IAAI,GAAG,CAAC,CAAA;YACjE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC,QAAQ,CAAA;YACnD,IAAI,IAAI,CAAC,UAAU,KAAK,aAAa,EAAE,CAAC;gBACtC,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,SAAS,IAAI,CAAC,UAAU,oBAAoB,aAAa,EAAE,CAAC,CAAA;YACxG,CAAC;YACD,4EAA4E;YAC5E,0EAA0E;YAC1E,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,EAAE,CAAC,EAAE,IAA+B,CAAC,CAAA;QAC5E,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,oBAAoB,CAAC,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC,CAAA;QACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;YACrB,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC;gBAAE,SAAQ;YACxC,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAE,CAAA;YAC9B,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAE,CAAA;YAChC,MAAM,IAAI,GAAG,OAAO,CAAC,gBAAgB,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAA;YAC1D,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAA;YAC1B,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;YAC/B,yEAAyE;YACzE,0EAA0E;YAC1E,2EAA2E;YAC3E,sEAAsE;YACtE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAA;YACnE,MAAM,KAAK,GAAG,KAAK,CAAA;YACnB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;YACpC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,CAAA;YACtC,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;YACpC,IAAI,CAAC,GAAG,EAAE,CAAA;QACZ,CAAC;QACD,2EAA2E;QAC3E,yBAAyB;QACzB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACjC,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAE,EAAE,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAE,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAA;QAC5F,CAAC;QACD,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAE,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAA;QACjG,wEAAwE;QACxE,kEAAkE;QAClE,IAAI,MAAM,GAAyB,IAAI,CAAA;QACvC,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,GAAG,oBAAoB,EAAE,CAAA;YAC/B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC9B,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAE,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAA;YAC3F,CAAC;QACH,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;QAEhC,MAAM,cAAc,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QAC9C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,cAAc,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QACzE,cAAc,CAAC,KAAK,EAAE,CAAA;QAEtB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAA;QAChD,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;YAC7C,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,CAAA;YAC5C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC9B,gEAAgE;gBAChE,mCAAmC;gBACnC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAA;YACjF,CAAC;YACD,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAA;QACvB,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAA;IAC7B,CAAC;IAMD,KAAK,UAAU,IAAI,CACjB,MAAiD,EACjD,IAAiB;QAEjB,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,YAAY,KAAK,IAAI,CAAC,CAAA;QAC7D,IAAI,IAAI,EAAE,YAAY;YAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,QAAQ,EAAE,IAAI,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAA;QACxG,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,CAAA;IACrB,CAAC;IAQD,KAAK,UAAU,GAAG,CAChB,MAAiD,EACjD,IAAiB;QAEjB,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,YAAY,KAAK,IAAI,CAAC,CAAA;QAC7D,IAAI,IAAI,EAAE,YAAY;YAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAA;QACtG,OAAO,CAAC,CAAC,MAAM,CAAA;IACjB,CAAC;IAED,8EAA8E;IAC9E,SAAS,YAAY,CAAC,MAAoC,EAAE,IAA0B;QACpF,MAAM,OAAO,GAAG,IAAI,EAAE,OAAO,IAAI,KAAK,CAAA;QACtC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjC,MAAM,IAAI,KAAK,CACb,gCAAgC,IAAI,KAAK;oBACzC,UAAU,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC5D,CAAA;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC5C,IAAI,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC,EAAE,CAAC;oBACtB,MAAM,IAAI,KAAK,CACb,gCAAgC,IAAI,KAAK;wBACzC,gEAAgE,CACjE,CAAA;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAA;YACzB,IAAI,CAAC,IAAI;gBAAE,SAAQ;YACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC,QAAQ,GAAG,CAAC,CAAA;YAClD,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBAC7B,MAAM,IAAI,KAAK,CAAC,kBAAkB,IAAI,SAAS,IAAI,CAAC,MAAM,uBAAuB,QAAQ,EAAE,CAAC,CAAA;YAC9F,CAAC;YACD,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,EAAE,CAAC,EAAE,IAA+B,CAAC,CAAA;QAC5E,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,KAAK,UAAU,eAAe,CAAC,GAAwB;QACrD,MAAM,QAAQ,GAAsD,EAAE,CAAA;QACtE,MAAM,OAAO,GAAG,MAAM,CAAC,oBAAoB,CAAC,EAAE,KAAK,EAAE,qBAAqB,EAAE,CAAC,CAAA;QAC7E,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAE,CAAA;YACjC,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAA;YAC7E,OAAO,CAAC,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;YAC7E,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAA;QAC7D,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;QAChC,MAAM,GAAG,GAAiC,EAAE,CAAA;QAC5C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;YACrC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,cAAc,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YAC/D,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,CAAA;YACb,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAA;QACjB,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,2EAA2E;IAC3E,4EAA4E;IAC5E,mDAAmD;IACnD,SAAS,eAAe,CAAC,IAA6E,EAAE,MAAiB;QACvH,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAA;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,KAAK,KAAK;YAC/B,CAAC,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;YACtD,CAAC,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,CAAA;QAClE,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,IAA+B,CAAC,CAAA;IAC/D,CAAC;IAED,SAAS,mBAAmB;QAC1B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;gBAAE,eAAe,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,CAAA;QACzE,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,4CAA4C;IAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAA;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;QAC9C,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAA;IACvC,CAAC;IACD,uEAAuE;IACvE,gDAAgD;IAChD,MAAM,aAAa,GAA6B,EAAE,CAAA;IAClD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;QAChD,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC,KAAK,CAAC,CAAA;IACvD,CAAC;IACD,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAE,CAAC,KAAK,CAAC,CAAA;IAE1D,MAAM,OAAO,GAAG,GAAG,EAAE;QACnB,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;YAC9B,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,CAAC,CAAC,OAAO,EAAE,CAAA;QACzC,CAAC;QACD,cAAc,CAAC,OAAO,EAAE,CAAA;QACxB,IAAI,cAAc;YAAE,cAAc,CAAC,MAAM,CAAC,OAAO,EAAE,CAAA;IACrD,CAAC,CAAA;IAED,OAAO;QACL,MAAM;QACN,MAAM;QACN,WAAW;QACX,YAAY;QACZ,cAAc,EAAE,GAAG,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC;QACxD,kBAAkB,EAAE,GAAG,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,gBAAgB,CAAC;QAChE,IAAI;QACJ,GAAG;QACH,mBAAmB;QACnB,OAAO;KACR,CAAA;AACH,CAAC;AAED;;;4CAG4C;AAC5C,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,IAAgB,EAChB,OAAqB,EACrB,cAAsB,EACtB,OAAoB,EAAE;IAEtB,OAAO,MAAM,aAAa,CAAC,IAAI,EAAE,OAAO,EAAE,cAAc,EAAE,IAAI,CAAC,CAAA;AACjE,CAAC;AAED,KAAK,UAAU,aAAa;IAC1B,IAAI,OAAO,SAAS,KAAK,WAAW,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC;QACvD,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAA;IACzE,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,GAAG,CAAC,cAAc,EAAE,CAAA;IACpD,IAAI,CAAC,OAAO;QAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAA;IAC9D,OAAO,MAAM,OAAO,CAAC,aAAa,EAAE,CAAA;AACtC,CAAC"}

package/dist/shape.js

@@ -1,259 +0,0 @@
-// Shape inference and validation for each op kind.
-//
-// Every op in src/ops.ts validates its inputs and computes its output shape
-// through helpers here. Errors throw with the captured call-site so the
-// stack trace points at the user's line, not into the library.
-//
-// Broadcasting rules (deliberately limited):
-//   * For element-wise binops (add/sub/mul/div), we support trailing-axis
-//     broadcasting: the smaller operand's shape must be a suffix of the
-//     larger's, with axes of size 1 broadcasting to any size. Examples
-//     ALLOWED:  [B, T, D] op [D]  →  [B, T, D]
-//               [B, T, D] op [1, D]  → [B, T, D]
-//               [B, T, D] op [B, T, D]  → [B, T, D]
-//     Examples REJECTED:  [B, T, D] op [B]   (suffix mismatch)
-//                         [B, T, D] op [T, D] when T != B (legal numpy, banned here)
-//   The restriction makes codegen and autograd much simpler and covers every
-//   broadcast pattern in our transformer (biases, layernorm gain/bias, masks).
-import { formatSite } from './ir.js';
-// ============================================================================
-// Errors
-// ============================================================================
-export class ShapeError extends Error {
-    constructor(message, site) {
-        const formatted = site ? `${message}\n  at ${formatSite(site)}` : message;
-        super(formatted);
-        this.name = 'ShapeError';
-    }
-}
-function fail(message, site) {
-    throw new ShapeError(message, site);
-}
-// ============================================================================
-// Shape utilities
-// ============================================================================
-export function shapesEqual(a, b) {
-    if (a.length !== b.length)
-        return false;
-    for (let i = 0; i < a.length; i++)
-        if (a[i] !== b[i])
-            return false;
-    return true;
-}
-export function shapeSize(shape) {
-    let n = 1;
-    for (const d of shape)
-        n *= d;
-    return n;
-}
-export function showShape(shape) {
-    return `[${shape.join(', ')}]`;
-}
-// Standard right-aligned NumPy-style broadcasting. Pad the shorter shape with
-// leading 1s, then per-axis: equal dims unify, size-1 dims broadcast on either
-// side, otherwise incompatible. Returns the resulting shape or null.
-export function broadcastTrailing(a, b) {
-    const rank = Math.max(a.length, b.length);
-    const out = new Array(rank);
-    for (let i = 0; i < rank; i++) {
-        const ai = i - (rank - a.length);
-        const bi = i - (rank - b.length);
-        const av = ai < 0 ? 1 : a[ai];
-        const bv = bi < 0 ? 1 : b[bi];
-        if (av === bv)
-            out[i] = av;
-        else if (av === 1)
-            out[i] = bv;
-        else if (bv === 1)
-            out[i] = av;
-        else
-            return null;
-    }
-    return out;
-}
-// ============================================================================
-// Per-op shape rules
-// ============================================================================
-//
-// Each rule takes the input shapes and returns the output shape, or throws.
-// All rules accept a `site` for error attribution.
-export function inferElementwiseBinop(opName, aShape, bShape, site) {
-    const result = broadcastTrailing(aShape, bShape);
-    if (!result) {
-        fail(`${opName}: incompatible shapes ${showShape(aShape)} and ${showShape(bShape)}. ` +
-            `Trailing-suffix broadcasting only — the smaller shape must be a suffix of the larger, ` +
-            `with size-1 axes broadcasting to any size.`, site);
-    }
-    return result;
-}
-export function inferUnary(_opName, aShape, _site) {
-    return aShape;
-}
-export function inferMeanLast(opName, aShape, site) {
-    if (aShape.length === 0)
-        fail(`${opName}: cannot reduce a 0-d tensor`, site);
-    // keepdims=true: replace last axis with 1.
-    return [...aShape.slice(0, -1), 1];
-}
-export function inferSumLast(opName, aShape, site) {
-    if (aShape.length === 0)
-        fail(`${opName}: cannot reduce a 0-d tensor`, site);
-    // keepdims=false: drop the last axis.
-    return aShape.slice(0, -1);
-}
-export function inferReshape(opName, aShape, newShape, site) {
-    // Validate -1 placeholder (at most one allowed) and total size match.
-    let inferIdx = -1;
-    let knownSize = 1;
-    for (let i = 0; i < newShape.length; i++) {
-        const d = newShape[i];
-        if (d === -1) {
-            if (inferIdx !== -1)
-                fail(`${opName}: at most one -1 dim allowed in newShape ${showShape(newShape)}`, site);
-            inferIdx = i;
-        }
-        else if (d <= 0) {
-            fail(`${opName}: invalid dim ${d} in newShape ${showShape(newShape)}`, site);
-        }
-        else {
-            knownSize *= d;
-        }
-    }
-    const totalIn = shapeSize(aShape);
-    const out = [...newShape];
-    if (inferIdx !== -1) {
-        if (totalIn % knownSize !== 0) {
-            fail(`${opName}: cannot reshape ${showShape(aShape)} (size ${totalIn}) to ${showShape(newShape)} — known dims multiply to ${knownSize}`, site);
-        }
-        out[inferIdx] = totalIn / knownSize;
-    }
-    else if (knownSize !== totalIn) {
-        fail(`${opName}: size mismatch — input ${showShape(aShape)} has ${totalIn} elements but newShape ${showShape(newShape)} has ${knownSize}`, site);
-    }
-    return out;
-}
-export function inferTranspose(opName, aShape, perm, site) {
-    if (perm.length !== aShape.length) {
-        fail(`${opName}: perm length ${perm.length} must equal input rank ${aShape.length}`, site);
-    }
-    const seen = new Set();
-    for (const p of perm) {
-        if (p < 0 || p >= aShape.length)
-            fail(`${opName}: perm index ${p} out of range for rank ${aShape.length}`, site);
-        if (seen.has(p))
-            fail(`${opName}: perm has duplicate index ${p}`, site);
-        seen.add(p);
-    }
-    return perm.map(p => aShape[p]);
-}
-// matmul: a [..., M, K] · b [K, N]  →  [..., M, N].  b is unbatched.
-export function inferMatmul(opName, aShape, bShape, site) {
-    if (aShape.length < 2)
-        fail(`${opName}: lhs must have rank >= 2, got ${showShape(aShape)}`, site);
-    if (bShape.length !== 2)
-        fail(`${opName}: rhs must have rank 2, got ${showShape(bShape)} — use matmulBatched for batched rhs`, site);
-    const M = aShape[aShape.length - 2];
-    const Ka = aShape[aShape.length - 1];
-    const Kb = bShape[0];
-    const N = bShape[1];
-    if (Ka !== Kb)
-        fail(`${opName}: inner dims don't match — ${showShape(aShape)} · ${showShape(bShape)} (last axis of lhs = ${Ka}, first axis of rhs = ${Kb})`, site);
-    return [...aShape.slice(0, -2), M, N];
-}
-// matmul_batched: a [..., M, K] · b [..., K, N]  →  [..., M, N].  Both have leading batch dims.
-export function inferMatmulBatched(opName, aShape, bShape, site) {
-    if (aShape.length < 2 || bShape.length < 2) {
-        fail(`${opName}: both inputs must have rank >= 2, got ${showShape(aShape)} and ${showShape(bShape)}`, site);
-    }
-    if (aShape.length !== bShape.length) {
-        fail(`${opName}: ranks must match (got ${aShape.length} vs ${bShape.length}). Reshape if you need different batch dims.`, site);
-    }
-    const aBatch = aShape.slice(0, -2);
-    const bBatch = bShape.slice(0, -2);
-    for (let i = 0; i < aBatch.length; i++) {
-        if (aBatch[i] !== bBatch[i]) {
-            fail(`${opName}: batch dims must match — ${showShape(aShape)} vs ${showShape(bShape)}`, site);
-        }
-    }
-    const M = aShape[aShape.length - 2];
-    const Ka = aShape[aShape.length - 1];
-    const Kb = bShape[bShape.length - 2];
-    const N = bShape[bShape.length - 1];
-    if (Ka !== Kb)
-        fail(`${opName}: inner dims don't match — last axis of lhs = ${Ka}, second-to-last of rhs = ${Kb}`, site);
-    return [...aBatch, M, N];
-}
-export function inferOneHot(opName, indicesShape, depth, site) {
-    if (depth <= 0)
-        fail(`${opName}: depth must be positive, got ${depth}`, site);
-    return [...indicesShape, depth];
-}
-// where_causal preserves shape but requires the last two axes to be square.
-export function inferWhereCausal(opName, aShape, site) {
-    if (aShape.length < 2)
-        fail(`${opName}: requires rank >= 2, got ${showShape(aShape)}`, site);
-    const m = aShape[aShape.length - 2];
-    const n = aShape[aShape.length - 1];
-    if (m !== n)
-        fail(`${opName}: last two axes must be equal (square mask), got ${showShape(aShape)}`, site);
-    return aShape;
-}
-export function inferSliceLastRange(opName, aShape, start, end, site) {
-    if (aShape.length === 0)
-        fail(`${opName}: cannot slice 0-d tensor`, site);
-    const last = aShape[aShape.length - 1];
-    if (start < 0 || end > last || start >= end) {
-        fail(`${opName}: invalid range [${start}, ${end}) for last axis of size ${last}`, site);
-    }
-    return [...aShape.slice(0, -1), end - start];
-}
-// broadcast_to: validate that `aShape` can broadcast to `targetShape` under
-// right-aligned NumPy rules. Returns targetShape on success.
-export function inferBroadcastTo(opName, aShape, targetShape, site) {
-    if (aShape.length > targetShape.length) {
-        fail(`${opName}: source rank ${aShape.length} > target rank ${targetShape.length}`, site);
-    }
-    const offset = targetShape.length - aShape.length;
-    for (let i = 0; i < aShape.length; i++) {
-        const av = aShape[i];
-        const tv = targetShape[offset + i];
-        if (av !== tv && av !== 1) {
-            fail(`${opName}: cannot broadcast ${showShape(aShape)} to ${showShape(targetShape)} — axis ${i} (size ${av}) doesn't match target axis ${offset + i} (size ${tv}) and isn't 1`, site);
-        }
-    }
-    return targetShape;
-}
-// sum_to_shape: validate that `targetShape` is a valid right-aligned reduction
-// of `aShape` (i.e., aShape can have been produced by broadcasting targetShape).
-export function inferSumToShape(opName, aShape, targetShape, site) {
-    if (targetShape.length > aShape.length) {
-        fail(`${opName}: target rank ${targetShape.length} > source rank ${aShape.length}`, site);
-    }
-    const offset = aShape.length - targetShape.length;
-    for (let i = 0; i < targetShape.length; i++) {
-        const av = aShape[offset + i];
-        const tv = targetShape[i];
-        if (av !== tv && tv !== 1) {
-            fail(`${opName}: cannot sum-reduce ${showShape(aShape)} to ${showShape(targetShape)} — target axis ${i} (size ${tv}) must be 1 or match source`, site);
-        }
-    }
-    return targetShape;
-}
-// Three-way broadcast for `where(cond, a, b)`. All three shapes must broadcast
-// to a common shape under standard NumPy rules.
-export function inferWhere(opName, condShape, aShape, bShape, site) {
-    const ab = broadcastTrailing(aShape, bShape);
-    if (!ab)
-        fail(`${opName}: a/b incompatible: ${showShape(aShape)} vs ${showShape(bShape)}`, site);
-    const result = broadcastTrailing(condShape, ab);
-    if (!result)
-        fail(`${opName}: cond ${showShape(condShape)} incompatible with broadcast(a, b) ${showShape(ab)}`, site);
-    return result;
-}
-export function inferReluGrad(opName, xShape, dyShape, site) {
-    if (!shapesEqual(xShape, dyShape)) {
-        fail(`${opName}: x and dy must have matching shapes, got ${showShape(xShape)} and ${showShape(dyShape)}`, site);
-    }
-    return xShape;
-}
-//# sourceMappingURL=shape.js.map