@datalayer/cells 0.0.0-stage → 0.0.2

package/lib/core/axis.js

@@ -0,0 +1,470 @@
+/*
+ * Copyright (c) 2022-2026 Datalayer, Inc.
+ *
+ * MIT License
+ */
+/**
+ * An axis of a sheet: its rows, or its columns.
+ *
+ * - **Ids.** Every index has a stable id that follows the row through inserts,
+ *   deletes and moves. Ids are materialised only up to the last index ever
+ *   named; beyond, an index has an *implicit* id derived from where the row
+ *   was when the axis was created (`IMPLICIT_BASE + creation index`), so two
+ *   replicas that materialise the same index independently agree on its id.
+ *   Inserted indexes get fresh ids, from `FRESH_BASE` up.
+ * - **Sizes.** Default until the first resize; then a raw `Float64Array` of
+ *   sizes and a Fenwick tree over the effective sizes (0 when hidden), so
+ *   `offsetOf` and `indexAt` are O(log n) and a resize is O(log n). An insert
+ *   or delete rebuilds the tree from the edit point only.
+ * - **Hidden** is a bitset beside the sizes: a hidden index keeps its size for
+ *   unhide and contributes 0 to offsets.
+ *
+ * @module core/axis
+ */
+/** Implicit ids are `IMPLICIT_BASE + creation index`. */
+export const IMPLICIT_BASE = 0;
+/** Fresh ids (inserted indexes) start here, above any creation index. */
+export const FRESH_BASE = 1 << 30;
+export class Axis {
+    count;
+    defaultSize;
+    /** Materialised ids, `[0, #length)`; the buffer grows by doubling. */
+    #ids = new Int32Array(0);
+    #length = 0;
+    /** The creation index of the first implicit index (`#length`). */
+    #implicitStart = 0;
+    #nextFresh = FRESH_BASE;
+    /** `null` until the first non-default size or hidden index. */
+    #sizes = null;
+    #tree = null;
+    #hidden = null;
+    constructor(options) {
+        if (!Number.isInteger(options.count) || options.count < 1 || options.count > FRESH_BASE - 1) {
+            throw new Error(`An axis holds 1 to ${FRESH_BASE - 1} indexes; ${options.count} was asked for.`);
+        }
+        if (!(options.defaultSize > 0)) {
+            throw new Error(`An axis's default size must be positive; ${options.defaultSize} was given.`);
+        }
+        this.count = options.count;
+        this.defaultSize = options.defaultSize;
+    }
+    // ---------------------------------------------------------------- ids
+    /** The id of an index, materialised or implicit. */
+    idAt(index) {
+        this.#check(index);
+        if (index < this.#length)
+            return this.#ids[index];
+        return IMPLICIT_BASE + this.#implicitStart + (index - this.#length);
+    }
+    /**
+     * Materialise ids up to `index` inclusive and return its id. Anything that
+     * names an index (content, a size, a merge corner, a reference) calls this
+     * first, so no implicit id is ever referenced.
+     */
+    materialize(index) {
+        this.#check(index);
+        if (index >= this.#length) {
+            const n = index + 1 - this.#length;
+            this.#reserve(index + 1);
+            for (let k = 0; k < n; k += 1)
+                this.#ids[this.#length + k] = IMPLICIT_BASE + this.#implicitStart + k;
+            this.#implicitStart += n;
+            this.#length = index + 1;
+        }
+        return this.#ids[index];
+    }
+    /** How many ids are materialised. */
+    get materialized() {
+        return this.#length;
+    }
+    /** `n` fresh ids, for the indexes an insert creates. Never reused. */
+    freshIds(n) {
+        const ids = new Int32Array(n);
+        for (let k = 0; k < n; k += 1)
+            ids[k] = this.#nextFresh++;
+        return ids;
+    }
+    /** Whether `tail` is what a delete of `n` would bring at the end by itself. */
+    #isImplicitTail(tail, n) {
+        if (tail.sizes !== null || tail.hidden !== null)
+            return false;
+        // After the delete, `#length` drops by n and index k >= #length holds
+        // IMPLICIT_BASE + #implicitStart + (k - #length).
+        const lengthAfter = this.#length - n;
+        for (let k = 0; k < n; k += 1) {
+            const index = this.count - n + k;
+            if (index < lengthAfter)
+                return false;
+            if (tail.ids[k] !== IMPLICIT_BASE + this.#implicitStart + (index - lengthAfter))
+                return false;
+        }
+        return true;
+    }
+    /** The index of an id, or -1. O(n) over the materialised ids; for the binding, not the hot path. */
+    indexOfId(id) {
+        for (let i = 0; i < this.#length; i += 1)
+            if (this.#ids[i] === id)
+                return i;
+        if (id >= IMPLICIT_BASE + this.#implicitStart && id < FRESH_BASE) {
+            const index = this.#length + (id - IMPLICIT_BASE - this.#implicitStart);
+            return index < this.count ? index : -1;
+        }
+        return -1;
+    }
+    /** A copy of the materialised ids, for snapshots and the file format. */
+    ids() {
+        return this.#ids.slice(0, this.#length);
+    }
+    // ---------------------------------------------------------------- structure
+    /** The state of `n` indexes from `at`: ids, sizes and hidden flags, for patches. */
+    segment(at, n) {
+        this.#checkSpan(at, n, false);
+        return {
+            ids: Int32Array.from({ length: n }, (_, k) => this.idAt(at + k)),
+            sizes: this.#sizes === null ? null : this.#sizes.slice(at, at + n),
+            hidden: this.#hidden === null
+                ? null
+                : Uint8Array.from({ length: n }, (_, k) => (this.isHidden(at + k) ? 1 : 0)),
+        };
+    }
+    /**
+     * Insert `n` indexes before `at`. The count stays: the last `n` indexes fall
+     * off the end (the command checks they are empty), and come back as
+     * `dropped`. With `segment`, the inserted indexes take its ids, sizes and
+     * hidden flags (undo, redo, remote inserts); without, fresh ids and the
+     * default size.
+     */
+    insert(at, n, segment) {
+        this.#checkSpan(at, n, true);
+        if (segment !== undefined && segment.ids.length !== n) {
+            throw new Error(`insert: ${n} indexes but a segment of ${segment.ids.length}.`);
+        }
+        const dropped = this.segment(this.count - n, n);
+        let ids;
+        if (segment !== undefined)
+            ids = segment.ids.slice();
+        else {
+            ids = new Int32Array(n);
+            for (let k = 0; k < n; k += 1)
+                ids[k] = this.#nextFresh++;
+        }
+        if (at > this.#length)
+            this.materialize(at - 1);
+        this.#reserve(Math.min(this.#length + n, this.count));
+        this.#ids.copyWithin(at + n, at, Math.min(this.#length, this.count - n));
+        this.#ids.set(ids, at);
+        this.#length = Math.min(this.#length + n, this.count);
+        const needsSizes = this.#sizes !== null || segment?.sizes != null || segment?.hidden != null;
+        if (needsSizes) {
+            this.#allocate();
+            const sizes = this.#sizes;
+            sizes.copyWithin(at + n, at, this.count - n);
+            if (segment?.sizes)
+                sizes.set(segment.sizes, at);
+            else
+                sizes.fill(this.defaultSize, at, at + n);
+            if (this.#hidden !== null || segment?.hidden) {
+                if (this.#hidden === null)
+                    this.#hidden = new Uint32Array(Math.ceil(this.count / 32));
+                shiftBits(this.#hidden, this.count, at, n);
+                if (segment?.hidden)
+                    for (let k = 0; k < n; k += 1)
+                        if (segment.hidden[k])
+                            this.#setBit(at + k, true);
+            }
+            this.#rebuildFrom(at);
+        }
+        return {
+            inserted: { ids, sizes: segment?.sizes ?? null, hidden: segment?.hidden ?? null },
+            dropped,
+        };
+    }
+    /**
+     * Delete `n` indexes from `at`; returns them. New indexes appear at the end:
+     * implicit ones, or `tail`'s when given (undoing an insert brings back the
+     * indexes it pushed off).
+     */
+    delete(at, n, tail) {
+        this.#checkSpan(at, n, false);
+        if (tail !== undefined && tail.ids.length !== n) {
+            throw new Error(`delete: ${n} indexes but a tail of ${tail.ids.length}.`);
+        }
+        const removed = this.segment(at, n);
+        this.materialize(at + n - 1);
+        // A tail that is what the axis would derive anyway (the common case:
+        // undoing an insert far from the end) needs no materialising.
+        const explicitTail = tail !== undefined && !this.#isImplicitTail(tail, n);
+        if (explicitTail)
+            this.materialize(this.count - 1);
+        this.#ids.copyWithin(at, at + n, this.#length);
+        this.#length -= n;
+        if (explicitTail) {
+            this.#ids.set(tail.ids, this.count - n);
+            this.#length = this.count;
+        }
+        const needsSizes = this.#sizes !== null || tail?.sizes != null || tail?.hidden != null;
+        if (needsSizes) {
+            this.#allocate();
+            const sizes = this.#sizes;
+            sizes.copyWithin(at, at + n, this.count);
+            if (tail?.sizes)
+                sizes.set(tail.sizes, this.count - n);
+            else
+                sizes.fill(this.defaultSize, this.count - n, this.count);
+            if (this.#hidden !== null || tail?.hidden) {
+                if (this.#hidden === null)
+                    this.#hidden = new Uint32Array(Math.ceil(this.count / 32));
+                shiftBits(this.#hidden, this.count, at, -n);
+                if (tail?.hidden)
+                    for (let k = 0; k < n; k += 1)
+                        if (tail.hidden[k])
+                            this.#setBit(this.count - n + k, true);
+            }
+            this.#rebuildFrom(at);
+        }
+        return removed;
+    }
+    /**
+     * Move `n` indexes from `at` to before `to` (an index in the coordinates
+     * before the move, outside `[at, at + n]`). Ids, sizes and hidden flags travel.
+     */
+    move(at, n, to) {
+        this.#checkSpan(at, n, false);
+        if (!Number.isInteger(to) || to < 0 || to > this.count || (to >= at && to <= at + n)) {
+            throw new Error(`Cannot move ${n} index(es) at ${at} to ${to}.`);
+        }
+        const lo = Math.min(at, to);
+        const hi = Math.max(at + n, to);
+        this.materialize(hi - 1);
+        const rotate = (arr) => {
+            const part = arr.slice(at, at + n);
+            if (to < at) {
+                arr.copyWithin(to + n, to, at);
+                arr.set(part, to);
+            }
+            else {
+                arr.copyWithin(at, at + n, to);
+                arr.set(part, to - n);
+            }
+        };
+        rotate(this.#ids);
+        if (this.#sizes !== null) {
+            rotate(this.#sizes);
+            if (this.#hidden !== null) {
+                const flags = Float64Array.from({ length: this.count }, (_, i) => i >= lo && i < hi && this.isHidden(i) ? 1 : 0);
+                rotate(flags);
+                for (let i = lo; i < hi; i += 1)
+                    this.#setBit(i, flags[i] === 1);
+            }
+            this.#rebuildFrom(lo);
+        }
+    }
+    /** Set sizes and hidden flags of `n` indexes from `at` at once (patches). */
+    setSegmentSizes(at, sizes, hidden, n) {
+        this.#checkSpan(at, n, false);
+        if (sizes === null && hidden === null && this.#sizes === null)
+            return;
+        this.#allocate();
+        if (sizes)
+            this.#sizes.set(sizes, at);
+        else
+            this.#sizes.fill(this.defaultSize, at, at + n);
+        if (hidden || this.#hidden !== null) {
+            if (this.#hidden === null)
+                this.#hidden = new Uint32Array(Math.ceil(this.count / 32));
+            for (let k = 0; k < n; k += 1)
+                this.#setBit(at + k, hidden ? hidden[k] === 1 : false);
+        }
+        this.#rebuildFrom(at);
+    }
+    // ---------------------------------------------------------------- sizes
+    /** The size of an index as set, hidden or not. */
+    sizeOf(index) {
+        this.#check(index);
+        return this.#sizes === null ? this.defaultSize : this.#sizes[index];
+    }
+    /** The size an index takes on screen: 0 when hidden. */
+    effectiveSizeOf(index) {
+        return this.isHidden(index) ? 0 : this.sizeOf(index);
+    }
+    /** Set the size of an index. O(log n). */
+    resize(index, size) {
+        this.#check(index);
+        if (!(size > 0) || !Number.isFinite(size))
+            throw new Error(`A size must be positive; ${size} was given.`);
+        this.#allocate();
+        const before = this.effectiveSizeOf(index);
+        this.#sizes[index] = size;
+        const after = this.effectiveSizeOf(index);
+        if (after !== before)
+            this.#add(index, after - before);
+    }
+    /** Whether any size was ever set (else every size is the default and nothing is hidden). */
+    get customized() {
+        return this.#sizes !== null;
+    }
+    /** Whether any index is hidden. */
+    get hasHidden() {
+        return this.#hidden !== null && this.#hidden.some((w) => w !== 0);
+    }
+    isHidden(index) {
+        this.#check(index);
+        const h = this.#hidden;
+        return h !== null && (h[index >>> 5] & (1 << (index & 31))) !== 0;
+    }
+    setHidden(index, hidden) {
+        if (this.isHidden(index) === hidden)
+            return;
+        this.#allocate();
+        if (this.#hidden === null)
+            this.#hidden = new Uint32Array(Math.ceil(this.count / 32));
+        const size = this.#sizes[index];
+        if (hidden)
+            this.#hidden[index >>> 5] |= 1 << (index & 31);
+        else
+            this.#hidden[index >>> 5] &= ~(1 << (index & 31));
+        this.#add(index, hidden ? -size : size);
+    }
+    /** The offset of an index's start: the sum of the effective sizes before it. O(log n). */
+    offsetOf(index) {
+        if (!Number.isInteger(index) || index < 0 || index > this.count) {
+            throw new Error(`No offset at index ${index} of an axis of ${this.count}.`);
+        }
+        if (this.#tree === null)
+            return index * this.defaultSize;
+        let sum = 0;
+        for (let i = index; i > 0; i -= i & -i)
+            sum += this.#tree[i];
+        return sum;
+    }
+    /** The total extent of the axis. */
+    get extent() {
+        return this.offsetOf(this.count);
+    }
+    /** The index under an offset: the last index whose start is at or before it. O(log n). */
+    indexAt(offset) {
+        if (offset <= 0)
+            return this.#firstVisibleFrom(0);
+        if (this.#tree === null)
+            return Math.min(Math.floor(offset / this.defaultSize), this.count - 1);
+        const tree = this.#tree;
+        let pos = 0;
+        let rest = offset;
+        for (let step = highestPowerOfTwo(this.count); step > 0; step >>= 1) {
+            const next = pos + step;
+            if (next <= this.count && tree[next] <= rest) {
+                pos = next;
+                rest -= tree[next];
+            }
+        }
+        // `pos` indexes end at or before the offset; the one under it is `pos`,
+        // or the last index when the offset is past the end.
+        return Math.min(pos, this.count - 1);
+    }
+    // ---------------------------------------------------------------- internals
+    #firstVisibleFrom(index) {
+        let i = index;
+        while (i < this.count - 1 && this.effectiveSizeOf(i) === 0)
+            i += 1;
+        return i;
+    }
+    #allocate() {
+        if (this.#sizes !== null)
+            return;
+        this.#sizes = new Float64Array(this.count).fill(this.defaultSize);
+        this.#tree = new Float64Array(this.count + 1);
+        this.#rebuildFrom(0);
+    }
+    #setBit(index, on) {
+        const h = this.#hidden;
+        if (on)
+            h[index >>> 5] |= 1 << (index & 31);
+        else
+            h[index >>> 5] &= ~(1 << (index & 31));
+    }
+    #add(index, delta) {
+        const tree = this.#tree;
+        for (let i = index + 1; i <= this.count; i += i & -i)
+            tree[i] += delta;
+    }
+    /**
+     * Recompute the Fenwick nodes covering indexes `>= from`, in one pass:
+     * node i holds prefix(i) - prefix(i - lowbit(i)); prefixes below `from`
+     * come from the still-valid lower nodes, those above from a running sum.
+     */
+    #rebuildFrom(from) {
+        const tree = this.#tree;
+        const n = this.count;
+        const start = from + 1;
+        const below = this.#prefixFromTree(from);
+        const running = new Float64Array(n - from + 1);
+        running[0] = below;
+        let sum = below;
+        for (let i = start; i <= n; i += 1) {
+            sum += this.effectiveSizeOf(i - 1);
+            running[i - from] = sum;
+            const lower = i - (i & -i);
+            const lowerPrefix = lower >= from ? running[lower - from] : this.#prefixFromTree(lower);
+            tree[i] = sum - lowerPrefix;
+        }
+    }
+    #prefixFromTree(index) {
+        const tree = this.#tree;
+        let sum = 0;
+        for (let i = index; i > 0; i -= i & -i)
+            sum += tree[i];
+        return sum;
+    }
+    #reserve(length) {
+        if (length <= this.#ids.length)
+            return;
+        let capacity = Math.max(64, this.#ids.length);
+        while (capacity < length)
+            capacity *= 2;
+        const ids = new Int32Array(Math.min(capacity, this.count + 1));
+        ids.set(this.#ids.subarray(0, this.#length));
+        this.#ids = ids;
+    }
+    #check(index) {
+        if (!Number.isInteger(index) || index < 0 || index >= this.count) {
+            throw new Error(`Index ${index} is outside an axis of ${this.count}.`);
+        }
+    }
+    #checkSpan(at, n, inserting) {
+        if (!Number.isInteger(n) || n < 1)
+            throw new Error(`A span needs at least one index; ${n} was given.`);
+        if (!Number.isInteger(at) || at < 0 || at + n > this.count || (inserting && at >= this.count)) {
+            throw new Error(`${n} index(es) at ${at} do not fit an axis of ${this.count}.`);
+        }
+    }
+}
+function highestPowerOfTwo(n) {
+    let p = 1;
+    while (p * 2 <= n)
+        p *= 2;
+    return p;
+}
+/** Shift the bits at and after `at` by `n` (negative: towards `at`, dropping `-n` bits). */
+function shiftBits(bits, count, at, n) {
+    const get = (i) => (bits[i >>> 5] & (1 << (i & 31))) !== 0;
+    const set = (i, v) => {
+        if (v)
+            bits[i >>> 5] |= 1 << (i & 31);
+        else
+            bits[i >>> 5] &= ~(1 << (i & 31));
+    };
+    if (n > 0) {
+        for (let i = count - 1; i >= at + n; i -= 1)
+            set(i, get(i - n));
+        for (let i = at; i < at + n; i += 1)
+            set(i, false);
+    }
+    else {
+        const m = -n;
+        for (let i = at; i < count - m; i += 1)
+            set(i, get(i + m));
+        for (let i = count - m; i < count; i += 1)
+            set(i, false);
+    }
+}
+//# sourceMappingURL=axis.js.map

package/lib/core/axis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"axis.js","sourceRoot":"","sources":["../../src/core/axis.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;;;;;;;;;;;;GAiBG;AAEH,yDAAyD;AACzD,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAC/B,yEAAyE;AACzE,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,CAAC;AAkBlC,MAAM,OAAO,IAAI;IACN,KAAK,CAAS;IACd,WAAW,CAAS;IAE7B,sEAAsE;IACtE,IAAI,GAAe,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,GAAG,CAAC,CAAC;IACZ,kEAAkE;IAClE,cAAc,GAAG,CAAC,CAAC;IACnB,UAAU,GAAG,UAAU,CAAC;IAExB,+DAA+D;IAC/D,MAAM,GAAwB,IAAI,CAAC;IACnC,KAAK,GAAwB,IAAI,CAAC;IAClC,OAAO,GAAuB,IAAI,CAAC;IAEnC,YAAY,OAAoB;QAC9B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,KAAK,GAAG,CAAC,IAAI,OAAO,CAAC,KAAK,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC;YAC5F,MAAM,IAAI,KAAK,CACb,sBAAsB,UAAU,GAAG,CAAC,aAAa,OAAO,CAAC,KAAK,iBAAiB,CAChF,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,4CAA4C,OAAO,CAAC,WAAW,aAAa,CAAC,CAAC;QAChG,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IACzC,CAAC;IAED,uEAAuE;IAEvE,oDAAoD;IACpD,IAAI,CAAC,KAAa;QAChB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,OAAO,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IACtE,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,KAAa;QACvB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnB,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;YACnC,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;YACxE,IAAI,CAAC,cAAc,IAAI,CAAC,CAAC;YACzB,IAAI,CAAC,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,qCAAqC;IACrC,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,sEAAsE;IACtE,QAAQ,CAAC,CAAS;QAChB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1D,OAAO,GAAG,CAAC;IACb,CAAC;IAED,+EAA+E;IAC/E,eAAe,CAAC,IAAiB,EAAE,CAAS;QAC1C,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAC9D,sEAAsE;QACtE,kDAAkD;QAClD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,KAAK,GAAG,WAAW;gBAAE,OAAO,KAAK,CAAC;YACtC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,CAAC,KAAK,GAAG,WAAW,CAAC;gBAAE,OAAO,KAAK,CAAC;QAChG,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oGAAoG;IACpG,SAAS,CAAC,EAAU;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC;YAAE,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE;gBAAE,OAAO,CAAC,CAAC;QAC5E,IAAI,EAAE,IAAI,aAAa,GAAG,IAAI,CAAC,cAAc,IAAI,EAAE,GAAG,UAAU,EAAE,CAAC;YACjE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,GAAG,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;YACxE,OAAO,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,yEAAyE;IACzE,GAAG;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC;IAED,6EAA6E;IAE7E,oFAAoF;IACpF,OAAO,CAAC,EAAU,EAAE,CAAS;QAC3B,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9B,OAAO;YACL,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAChE,KAAK,EAAE,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;YAClE,MAAM,EACJ,IAAI,CAAC,OAAO,KAAK,IAAI;gBACnB,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAChF,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CACJ,EAAU,EACV,CAAS,EACT,OAAqB;QAErB,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC7B,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtD,MAAM,IAAI,KAAK,CAAC,WAAW,CAAC,6BAA6B,OAAO,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QAClF,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,IAAI,GAAe,CAAC;QACpB,IAAI,OAAO,KAAK,SAAS;YAAE,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;aAChD,CAAC;YACJ,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC5D,CAAC;QACD,IAAI,EAAE,GAAG,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QACzE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,OAAO,EAAE,KAAK,IAAI,IAAI,IAAI,OAAO,EAAE,MAAM,IAAI,IAAI,CAAC;QAC7F,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAO,CAAC;YAC3B,KAAK,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC7C,IAAI,OAAO,EAAE,KAAK;gBAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;;gBAC5C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YAC9C,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,IAAI,OAAO,EAAE,MAAM,EAAE,CAAC;gBAC7C,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI;oBAAE,IAAI,CAAC,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;gBACtF,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC3C,IAAI,OAAO,EAAE,MAAM;oBACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;wBAAE,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;4BAAE,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;YACrF,CAAC;YACD,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;QACD,OAAO;YACL,QAAQ,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,IAAI,IAAI,EAAE;YACjF,OAAO;SACR,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,EAAU,EAAE,CAAS,EAAE,IAAkB;QAC9C,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9B,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CAAC,WAAW,CAAC,0BAA0B,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5E,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,qEAAqE;QACrE,8DAA8D;QAC9D,MAAM,YAAY,GAAG,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1E,IAAI,YAAY;YAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/C,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;QAClB,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAK,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,MAAM,IAAI,IAAI,CAAC;QACvF,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAO,CAAC;YAC3B,KAAK,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,IAAI,EAAE,KAAK;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;;gBAClD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9D,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,IAAI,IAAI,EAAE,MAAM,EAAE,CAAC;gBAC1C,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI;oBAAE,IAAI,CAAC,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;gBACtF,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC5C,IAAI,IAAI,EAAE,MAAM;oBACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;wBAAE,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;4BAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;YAC9F,CAAC;YACD,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,EAAU,EAAE,CAAS,EAAE,EAAU;QACpC,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;YACrF,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,iBAAiB,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,CAAsC,GAAM,EAAE,EAAE;YAC7D,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YACnC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;gBACZ,GAAG,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC/B,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC/B,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YACxB,CAAC;QACH,CAAC,CAAC;QACF,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpB,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC/D,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC9C,CAAC;gBACF,MAAM,CAAC,KAAK,CAAC,CAAC;gBACd,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC;oBAAE,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACnE,CAAC;YACD,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,eAAe,CACb,EAAU,EACV,KAA0B,EAC1B,MAAyB,EACzB,CAAS;QAET,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9B,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI;YAAE,OAAO;QACtE,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,KAAK;YAAE,IAAI,CAAC,MAAO,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;;YAClC,IAAI,CAAC,MAAO,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QACrD,IAAI,MAAM,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YACpC,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI;gBAAE,IAAI,CAAC,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;YACtF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACxF,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IAED,yEAAyE;IAEzE,kDAAkD;IAClD,MAAM,CAAC,KAAa;QAClB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACtE,CAAC;IAED,wDAAwD;IACxD,eAAe,CAAC,KAAa;QAC3B,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,0CAA0C;IAC1C,MAAM,CAAC,KAAa,EAAE,IAAY;QAChC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnB,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;YACvC,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,aAAa,CAAC,CAAC;QACjE,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,KAAK,KAAK,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC;IACzD,CAAC;IAED,4FAA4F;IAC5F,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC;IAC9B,CAAC;IAED,mCAAmC;IACnC,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,OAAO,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACpE,CAAC;IAED,QAAQ,CAAC,KAAa;QACpB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QACvB,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACpE,CAAC;IAED,SAAS,CAAC,KAAa,EAAE,MAAe;QACtC,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,MAAM;YAAE,OAAO;QAC5C,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI;YAAE,IAAI,CAAC,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;QACtF,MAAM,IAAI,GAAG,IAAI,CAAC,MAAO,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,MAAM;YAAE,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;;YACtD,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED,0FAA0F;IAC1F,QAAQ,CAAC,KAAa;QACpB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAChE,MAAM,IAAI,KAAK,CAAC,sBAAsB,KAAK,kBAAkB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAC9E,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;YAAE,OAAO,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;QACzD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAAE,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,OAAO,GAAG,CAAC;IACb,CAAC;IAED,oCAAoC;IACpC,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,0FAA0F;IAC1F,OAAO,CAAC,MAAc;QACpB,IAAI,MAAM,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;QAClD,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChG,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,MAAM,CAAC;QAClB,KAAK,IAAI,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC;YACpE,MAAM,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC;YACxB,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;gBAC7C,GAAG,GAAG,IAAI,CAAC;gBACX,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,wEAAwE;QACxE,qDAAqD;QACrD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,6EAA6E;IAE7E,iBAAiB,CAAC,KAAa;QAC7B,IAAI,CAAC,GAAG,KAAK,CAAC;QACd,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,CAAC,IAAI,CAAC,CAAC;QACnE,OAAO,CAAC,CAAC;IACX,CAAC;IAED,SAAS;QACP,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI;YAAE,OAAO;QACjC,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAClE,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,CAAC,KAAa,EAAE,EAAW;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,OAAQ,CAAC;QACxB,IAAI,EAAE;YAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;;YACvC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,CAAC,KAAa,EAAE,KAAa;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAM,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAAE,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;IACzE,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAC,IAAY;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAM,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;QAC/C,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACnB,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,GAAG,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;YACxB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,WAAW,GAAG,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YACxF,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,WAAW,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,eAAe,CAAC,KAAa;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAM,CAAC;QACzB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;QACvD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,QAAQ,CAAC,MAAc;QACrB,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO;QACvC,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,OAAO,QAAQ,GAAG,MAAM;YAAE,QAAQ,IAAI,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IAED,MAAM,CAAC,KAAa;QAClB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACjE,MAAM,IAAI,KAAK,CAAC,SAAS,KAAK,0BAA0B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IAED,UAAU,CAAC,EAAU,EAAE,CAAS,EAAE,SAAkB;QAClD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,aAAa,CAAC,CAAC;QACtE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,IAAI,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9F,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,iBAAiB,EAAE,0BAA0B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAClF,CAAC;IACH,CAAC;CACF;AAED,SAAS,iBAAiB,CAAC,CAAS;IAClC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,CAAC,IAAI,CAAC,CAAC;IAC1B,OAAO,CAAC,CAAC;AACX,CAAC;AAED,4FAA4F;AAC5F,SAAS,SAAS,CAAC,IAAiB,EAAE,KAAa,EAAE,EAAU,EAAE,CAAS;IACxE,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACnE,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAU,EAAE,EAAE;QACpC,IAAI,CAAC;YAAE,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;;YACjC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC;IACF,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChE,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrD,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3D,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC3D,CAAC;AACH,CAAC"}

package/lib/core/cells.d.ts

@@ -0,0 +1,71 @@
+/**
+ * The cells of a sheet, stored by column in chunks of 1,024 rows, each chunk
+ * columnar: a kind byte, a number, a reference (into the string pool or the
+ * formula table) and a style index per row. No object per cell: a numeric
+ * cell costs 15 bytes in a full chunk.
+ *
+ * Positions are the in-memory address. Ids (the axes) are what collaboration
+ * syncs; this store never sees them.
+ *
+ * @module core/cells
+ */
+import type { StringPool } from './strings.js';
+import { type CellValue } from './values.js';
+import type { Zone } from './zone.js';
+export declare const CHUNK = 1024;
+/** What a cell holds, as persisted: a literal value, or a formula with its cached value; and a style. */
+export interface CellContent {
+    /** The literal value, or a formula's cached value (`null` when not yet computed). */
+    readonly value: CellValue;
+    /** The formula as typed, without the `=`. */
+    readonly formula?: string;
+    /** An index into the workbook's style table; 0 is the default. */
+    readonly style: number;
+}
+/** A formula's entry: its source and its last computed value. */
+export interface FormulaEntry {
+    source: string;
+    cached: CellValue;
+}
+/** The formula table: one entry per formula cell, reused through a free list. */
+export declare class FormulaTable {
+    #private;
+    add(entry: FormulaEntry): number;
+    get(i: number): FormulaEntry;
+    remove(i: number): void;
+    get size(): number;
+}
+export interface Pools {
+    readonly strings: StringPool;
+    readonly formulas: FormulaTable;
+}
+export declare class SheetCells {
+    #private;
+    constructor(pools: Pools);
+    /** How many cells hold a value or a style. */
+    get filled(): number;
+    /** How many chunks are allocated, for `stats()`. */
+    get chunkCount(): number;
+    /** The columns holding anything, in no order. */
+    columnIndexes(): IterableIterator<number>;
+    /** The content of a cell, or `null` when it holds neither a value nor a style. */
+    get(row: number, col: number): CellContent | null;
+    /** The number in a cell when it holds a literal number, else `undefined`. The aggregate path. */
+    numberAt(row: number, col: number): number | undefined;
+    /** Write a cell; `null` empties it (value and style). */
+    set(row: number, col: number, content: CellContent | null): void;
+    /** Every populated cell of a zone, column by column, rows ascending. */
+    entries(zone?: Zone): IterableIterator<[row: number, col: number, content: CellContent]>;
+    /** The last row holding anything in a column, or -1. */
+    lastRowIn(col: number): number;
+    /** Whether a zone holds anything. */
+    isEmpty(zone: Zone): boolean;
+    /**
+     * Move rows: `n > 0` inserts `n` empty rows at `at` (rows at the end fall off
+     * `limit`); `n < 0` deletes `-n` rows from `at`. Only columns holding data are touched.
+     */
+    shiftRows(at: number, n: number, limit: number): void;
+    /** Move columns: `n > 0` inserts at `at`, `n < 0` deletes `-n` from `at`. */
+    shiftCols(at: number, n: number, limit: number): void;
+}
+//# sourceMappingURL=cells.d.ts.map

package/lib/core/cells.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cells.d.ts","sourceRoot":"","sources":["../../src/core/cells.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,KAAK,SAAS,EAAuC,MAAM,aAAa,CAAC;AAClF,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEtC,eAAO,MAAM,KAAK,OAAO,CAAC;AAa1B,yGAAyG;AACzG,MAAM,WAAW,WAAW;IAC1B,qFAAqF;IACrF,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC;IAC1B,6CAA6C;IAC7C,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,kEAAkE;IAClE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,iEAAiE;AACjE,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,SAAS,CAAC;CACnB;AAED,iFAAiF;AACjF,qBAAa,YAAY;;IAIvB,GAAG,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM;IAMhC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,YAAY;IAM5B,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAMvB,IAAI,IAAI,IAAI,MAAM,CAEjB;CACF;AAeD,MAAM,WAAW,KAAK;IACpB,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC;CACjC;AAED,qBAAa,UAAU;;gBAKT,KAAK,EAAE,KAAK;IAIxB,8CAA8C;IAC9C,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,oDAAoD;IACpD,IAAI,UAAU,IAAI,MAAM,CAIvB;IAED,iDAAiD;IACjD,aAAa,IAAI,gBAAgB,CAAC,MAAM,CAAC;IAIzC,kFAAkF;IAClF,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI;IAQjD,iGAAiG;IACjG,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAOtD,yDAAyD;IACzD,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,IAAI,GAAG,IAAI;IA2BhE,wEAAwE;IACvE,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,gBAAgB,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;IAoBzF,wDAAwD;IACxD,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAW9B,qCAAqC;IACrC,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO;IAK5B;;;OAGG;IACH,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAqBrD,6EAA6E;IAC7E,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;CAyFtD"}