@react-x11/components 0.1.0 → 0.2.0

package/dist/charts/data.js

@@ -0,0 +1,616 @@
+// The data layer under `<chartplot>`: column resolution over the three
+// accepted data shapes, the streaming `ChartData` store, and the min/max
+// pyramid that makes paint cost a function of pixels rather than points.
+//
+// Everything here is pure JavaScript over plain values — no react-x11, no
+// ntk — so the whole layer is unit-testable without a display, and the
+// renderers stay the only code that knows what a drawing command is.
+//
+// ## Identity is the cache key, and appends are the one allowed mutation
+//
+// Preparation artifacts (pyramids, x-column indexes) are cached in WeakMaps
+// keyed on a per-column host object, with `{epoch, n}` versioning:
+//
+//  - a plain rows array or a columnar object is treated as immutable except
+//    for *growing* — same identity with a larger length extends the caches
+//    incrementally; a same-length change is invisible, which is the usual
+//    immutable-data contract React apps already live by;
+//  - `ChartData` is the sanctioned mutable store: it versions itself, its
+//    caches ride the per-column state objects (stable across compaction),
+//    and its `epoch` bump is what invalidates them after a window shift.
+//
+// Getting this wrong fails as a stale chart, so the rule is stated here
+// once: **mutate history only through `ChartData`**.
+export function isChartDataLike(data) {
+    return (!Array.isArray(data) &&
+        typeof data.column === 'function' &&
+        typeof data.subscribe === 'function');
+}
+const isColumnar = (d) => typeof d.length === 'number' &&
+    !!d.columns &&
+    !Array.isArray(d);
+/** Extracted columns per rows-array identity. WeakMap, so dropping the data
+ * drops the extraction. */
+const rowsCache = new WeakMap();
+/** Per-host growable Float64 push. Doubling keeps append O(1) amortized. */
+function grow(arr, need) {
+    if (need <= arr.length)
+        return arr;
+    const next = new Float64Array(Math.max(need, arr.length * 2, 64));
+    next.set(arr);
+    return next;
+}
+function extractRows(rows, key) {
+    let perKey = rowsCache.get(rows);
+    if (!perKey)
+        rowsCache.set(rows, (perKey = new Map()));
+    let entry = perKey.get(key);
+    const n = rows.length;
+    if (entry && entry.n === n)
+        return entry;
+    if (!entry) {
+        // sniff the type from the first present value; a column that never
+        // shows the key at all is "not there" rather than all-NaN
+        let numeric = null;
+        for (let i = 0; i < n; i++) {
+            const v = rows[i]?.[key];
+            if (v == null)
+                continue;
+            numeric = typeof v !== 'string';
+            break;
+        }
+        if (numeric === null)
+            return null;
+        entry = {
+            n: 0,
+            numeric,
+            values: numeric ? new Float64Array(Math.max(n, 64)) : [],
+        };
+        perKey.set(key, entry);
+    }
+    if (entry.numeric) {
+        let values = entry.values;
+        values = grow(values, n);
+        for (let i = entry.n; i < n; i++) {
+            const v = rows[i]?.[key];
+            values[i] = typeof v === 'number' ? v : NaN;
+        }
+        entry.values = values;
+    }
+    else {
+        const values = entry.values;
+        for (let i = entry.n; i < n; i++) {
+            const v = rows[i]?.[key];
+            values.push(v == null ? '' : String(v));
+        }
+    }
+    entry.n = n;
+    return entry;
+}
+/**
+ * The column `key` names in `data`, or null when there is none. Cheap to
+ * call every paint: each shape resolves through an identity-keyed cache.
+ */
+export function resolveColumn(data, key) {
+    if (isChartDataLike(data))
+        return data.column(key);
+    if (isColumnar(data)) {
+        const values = data.columns[key];
+        if (!values)
+            return null;
+        const n = Math.min(data.length, values.length);
+        const numeric = typeof values[0] !== 'string';
+        return { values, n, host: values, epoch: 0, numeric };
+    }
+    const rows = data;
+    const entry = extractRows(rows, key);
+    if (!entry)
+        return null;
+    return {
+        values: entry.numeric
+            ? entry.values.subarray(0, entry.n)
+            : entry.values,
+        n: entry.n,
+        host: rows,
+        epoch: 0,
+        numeric: entry.numeric,
+    };
+}
+/** Narrow to numeric, which is what scales and pyramids need. */
+export function numericColumn(col) {
+    return col && col.numeric ? col : null;
+}
+/**
+ * The streaming data store: append-only columns in growable typed arrays.
+ *
+ * This is the "proper data structures and preparations" half of the
+ * performance story. Charts subscribing to a store never rescan history —
+ * an append extends the decimation pyramids incrementally and invalidates
+ * nothing, so a 10Hz feed into a million-point series stays O(appended)
+ * per tick plus one bounded repaint per visible chart.
+ */
+export class ChartData {
+    _cols = new Map();
+    _n = 0;
+    _epoch = 0;
+    _listeners = new Set();
+    _maxLength;
+    _maxAge;
+    constructor(options = {}) {
+        this._maxLength = Math.max(2, options.maxLength ?? Infinity);
+        const age = options.maxAge;
+        this._maxAge =
+            age && age.ms > 0 && age.key ? { key: age.key, ms: age.ms } : null;
+    }
+    get length() {
+        return this._n;
+    }
+    /** Bumps when history shifts; caches keyed on it rebuild then. */
+    get epoch() {
+        return this._epoch;
+    }
+    /** Append one row. Keys never seen before backfill NaN (numeric) or ''
+     * so every column always covers every index. */
+    append(row) {
+        this.appendRows([row]);
+    }
+    /**
+     * Drop every row, keeping the columns and their storage. The reset every
+     * live dashboard eventually wants: a stream resuming after its process
+     * was suspended (a hidden window, a laptop lid) comes back with a time
+     * gap as wide as the sleep, and a windowed store then renders fifty
+     * seconds of data squeezed beside fourteen minutes of nothing until the
+     * gap evicts. Clearing on resume starts the window honestly instead.
+     *
+     * An epoch bump, so every cache keyed on `{epoch, n}` — pyramids, x
+     * indexes, scatter grids — rebuilds, through the same invalidation a
+     * window shift already exercises.
+     */
+    clear() {
+        if (this._n === 0)
+            return;
+        // numeric storage is reused (reads are capped by n); string columns
+        // append with push, so their arrays must actually empty
+        for (const col of this._cols.values()) {
+            if (!col.numeric)
+                col.values.length = 0;
+        }
+        this._n = 0;
+        this._epoch++;
+        this._notify(0);
+    }
+    /** Append many rows in one notification. */
+    appendRows(rows) {
+        if (rows.length === 0)
+            return;
+        for (const row of rows) {
+            for (const key of Object.keys(row))
+                this._ensureColumn(key, row[key]);
+            const at = this._n;
+            for (const col of this._cols.values()) {
+                const v = row[col.key];
+                if (col.numeric) {
+                    let values = col.values;
+                    values = grow(values, at + 1);
+                    values[at] = typeof v === 'number' ? v : NaN;
+                    col.values = values;
+                }
+                else {
+                    col.values.push(v == null ? '' : String(v));
+                }
+            }
+            this._n = at + 1;
+        }
+        const shifted = this._enforceWindow();
+        this._notify(shifted ? 0 : rows.length);
+    }
+    _ensureColumn(key, sample) {
+        if (this._cols.has(key))
+            return;
+        const numeric = typeof sample !== 'string';
+        const col = {
+            key,
+            numeric,
+            values: numeric ? new Float64Array(Math.max(this._n + 1, 64)) : [],
+            host: { key },
+        };
+        if (numeric)
+            col.values.fill(NaN, 0, this._n);
+        else
+            for (let i = 0; i < this._n; i++)
+                col.values.push('');
+        this._cols.set(key, col);
+    }
+    /** Drop the oldest points once a window is exceeded by its slack.
+     * Returns true when history moved. */
+    _enforceWindow() {
+        let drop = 0;
+        const limit = this._maxLength;
+        if (Number.isFinite(limit) && this._n > limit * 1.125) {
+            drop = this._n - limit;
+        }
+        const age = this._maxAge;
+        if (age) {
+            const col = this._cols.get(age.key);
+            if (col?.numeric && this._n > 0) {
+                const values = col.values;
+                const cutoff = values[this._n - 1] - age.ms;
+                // the age key appends in non-decreasing order, so the first row to
+                // keep is a binary search away
+                const first = lowerBound(values, this._n, cutoff);
+                // the same 12.5% slack the count window uses, so a live feed trims
+                // in occasional batches instead of every append — except when the
+                // stale run dwarfs the window (a resumed feed after a throttled
+                // era), where waiting for slack is exactly the squeeze to avoid
+                if (first > drop &&
+                    (first - drop >= this._n * 0.125 || values[0] < cutoff - age.ms)) {
+                    drop = first;
+                }
+            }
+        }
+        if (drop <= 0)
+            return false;
+        for (const col of this._cols.values()) {
+            if (col.numeric) {
+                const values = col.values;
+                values.copyWithin(0, drop, this._n);
+            }
+            else {
+                col.values.splice(0, drop);
+            }
+        }
+        this._n -= drop;
+        this._epoch++;
+        return true;
+    }
+    column(key) {
+        const col = this._cols.get(key);
+        if (!col)
+            return null;
+        return {
+            values: col.numeric
+                ? col.values.subarray(0, this._n)
+                : col.values,
+            n: this._n,
+            host: col.host,
+            epoch: this._epoch,
+            numeric: col.numeric,
+        };
+    }
+    /** Hear about appends and window shifts. Returns the unsubscribe. */
+    subscribe(listener) {
+        this._listeners.add(listener);
+        return () => {
+            this._listeners.delete(listener);
+        };
+    }
+    _notify(appended) {
+        const change = { appended, epoch: this._epoch };
+        for (const listener of [...this._listeners])
+            listener(change);
+    }
+}
+// --- the min/max pyramid ---------------------------------------------------
+/** Base block size. 16 keeps total pyramid memory at ~1/4 of the column
+ * (2 values per block, halving per level) while capping the raw-scan edges
+ * of any query at 15 points a side. */
+const BASE = 16;
+const BASE_SHIFT = 4;
+const pyramids = new WeakMap();
+function growLevel(level, blocks) {
+    if (blocks <= level.mins.length)
+        return;
+    const cap = Math.max(blocks, level.mins.length * 2, 8);
+    const mins = new Float64Array(cap);
+    const maxs = new Float64Array(cap);
+    mins.set(level.mins);
+    maxs.set(level.maxs);
+    level.mins = mins;
+    level.maxs = maxs;
+}
+/**
+ * Recompute the blocks of every level that the growth from `fromN` to `n`
+ * touched. Level 1 reads raw values; every higher level reads the two
+ * blocks below it — a partial lower block is correct for its coverage, so
+ * the parent combining it is correct for *its* coverage too, which is the
+ * invariant that makes incremental extension safe.
+ */
+function extendPyramid(pyr, values, n) {
+    const fromN = pyr.builtN;
+    if (n <= fromN)
+        return;
+    // make sure enough levels exist that the top is a single block
+    let topSize = pyr.levels.length
+        ? pyr.levels[pyr.levels.length - 1].size
+        : BASE >> 1;
+    while (topSize < n) {
+        topSize <<= 1;
+        pyr.levels.push({
+            size: topSize,
+            mins: new Float64Array(0),
+            maxs: new Float64Array(0),
+            blocks: 0,
+        });
+    }
+    for (let k = 0; k < pyr.levels.length; k++) {
+        const level = pyr.levels[k];
+        const size = level.size;
+        const first = Math.floor(fromN / size);
+        const last = Math.floor((n - 1) / size);
+        growLevel(level, last + 1);
+        for (let b = first; b <= last; b++) {
+            let min = Infinity;
+            let max = -Infinity;
+            if (k === 0) {
+                const end = Math.min((b + 1) * size, n);
+                for (let i = b * size; i < end; i++) {
+                    const v = values[i];
+                    // explicit comparisons skip NaN without poisoning the block
+                    if (v < min)
+                        min = v;
+                    if (v > max)
+                        max = v;
+                }
+            }
+            else {
+                const below = pyr.levels[k - 1];
+                const b0 = b * 2;
+                const b1 = b0 + 1;
+                if (b0 < below.blocks) {
+                    if (below.mins[b0] < min)
+                        min = below.mins[b0];
+                    if (below.maxs[b0] > max)
+                        max = below.maxs[b0];
+                }
+                if (b1 < below.blocks) {
+                    if (below.mins[b1] < min)
+                        min = below.mins[b1];
+                    if (below.maxs[b1] > max)
+                        max = below.maxs[b1];
+                }
+            }
+            level.mins[b] = min;
+            level.maxs[b] = max;
+        }
+        level.blocks = last + 1;
+    }
+    pyr.builtN = n;
+}
+/**
+ * The pyramid for a numeric column, built on first use and extended in
+ * place as the column grows. An epoch change rebuilds from scratch —
+ * history moved, and no incremental repair is worth the bug surface.
+ */
+export function pyramidFor(col) {
+    let pyr = pyramids.get(col.host);
+    if (!pyr || pyr.epoch !== col.epoch) {
+        pyr = { builtN: 0, epoch: col.epoch, levels: [] };
+        pyramids.set(col.host, pyr);
+    }
+    extendPyramid(pyr, col.values, col.n);
+    return pyr;
+}
+/**
+ * Exact min/max over `[i0, i1)`, in O(log) block reads plus ≤15 raw points
+ * at each edge: greedy decomposition over the aligned blocks that fit, the
+ * way a sparse segment tree answers range queries. `out.min > out.max`
+ * means the range held no finite value (a gap).
+ */
+export function minMaxRange(pyr, values, i0, i1, out) {
+    let min = Infinity;
+    let max = -Infinity;
+    let i = i0;
+    // raw leading edge up to base-block alignment
+    const firstAligned = Math.min(i1, (i + BASE - 1) & ~(BASE - 1));
+    for (; i < firstAligned; i++) {
+        const v = values[i];
+        if (v < min)
+            min = v;
+        if (v > max)
+            max = v;
+    }
+    // aligned middle: the biggest block that starts here and fits
+    while (i + BASE <= i1) {
+        let k = 0;
+        let size = BASE;
+        while (k + 1 < pyr.levels.length &&
+            i % (size << 1) === 0 &&
+            i + (size << 1) <= i1) {
+            k++;
+            size <<= 1;
+        }
+        const level = pyr.levels[k];
+        const b = i >> (BASE_SHIFT + k);
+        if (level.mins[b] < min)
+            min = level.mins[b];
+        if (level.maxs[b] > max)
+            max = level.maxs[b];
+        i += size;
+    }
+    // raw trailing edge
+    for (; i < i1; i++) {
+        const v = values[i];
+        if (v < min)
+            min = v;
+        if (v > max)
+            max = v;
+    }
+    out.min = min;
+    out.max = max;
+}
+const xIndexes = new WeakMap();
+/** |observed − predicted| tolerated before "uniform" is given up, relative
+ * to the step. Covers float noise in generated timestamps without letting a
+ * genuinely ragged series pretend. */
+const UNIFORM_TOL = 1e-6;
+function extendXIndex(idx, values, n) {
+    let i = idx.builtN;
+    if (n <= i)
+        return;
+    if (i === 0) {
+        idx.x0 = values[0];
+        idx.dx = NaN;
+        idx.min = Infinity;
+        idx.max = -Infinity;
+        i = 0;
+    }
+    let prev = i > 0 ? values[i - 1] : -Infinity;
+    for (; i < n; i++) {
+        const v = values[i];
+        if (Number.isNaN(v)) {
+            // a hole in x breaks both properties at once; there is no honest
+            // position for the points after it
+            idx.sorted = false;
+            idx.uniform = false;
+        }
+        else {
+            if (v < prev)
+                idx.sorted = false;
+            if (idx.uniform && i > 0) {
+                if (Number.isNaN(idx.dx))
+                    idx.dx = v - idx.x0;
+                const predicted = idx.x0 + idx.dx * i;
+                const tol = Math.abs(idx.dx) * UNIFORM_TOL + 1e-12;
+                if (Math.abs(v - predicted) > tol)
+                    idx.uniform = false;
+            }
+            if (v < idx.min)
+                idx.min = v;
+            if (v > idx.max)
+                idx.max = v;
+            prev = v;
+        }
+    }
+    // one point, or every step so far identical-to-zero: still "uniform",
+    // with a degenerate dx the callers guard against
+    idx.builtN = n;
+}
+/** The sortedness/uniformity/extent record for an x column, incremental
+ * like the pyramid. */
+export function xIndexFor(col) {
+    let idx = xIndexes.get(col.host);
+    if (!idx || idx.epoch !== col.epoch) {
+        idx = {
+            builtN: 0,
+            epoch: col.epoch,
+            sorted: true,
+            uniform: true,
+            x0: 0,
+            dx: NaN,
+            min: Infinity,
+            max: -Infinity,
+        };
+        xIndexes.set(col.host, idx);
+    }
+    extendXIndex(idx, col.values, col.n);
+    return idx;
+}
+/** First index whose value is >= x, over a sorted column. */
+export function lowerBound(values, n, x) {
+    let lo = 0;
+    let hi = n;
+    while (lo < hi) {
+        const mid = (lo + hi) >> 1;
+        if (values[mid] < x)
+            lo = mid + 1;
+        else
+            hi = mid;
+    }
+    return lo;
+}
+/** First index whose value is > x, over a sorted column. */
+export function upperBound(values, n, x) {
+    let lo = 0;
+    let hi = n;
+    while (lo < hi) {
+        const mid = (lo + hi) >> 1;
+        if (values[mid] <= x)
+            lo = mid + 1;
+        else
+            hi = mid;
+    }
+    return lo;
+}
+/**
+ * The index range `[i0, i1)` of points whose x falls in `[xMin, xMax]`,
+ * widened by one point each side so a line entering the viewport draws its
+ * crossing segment. Arithmetic for a uniform column, O(log n) for a sorted
+ * one, everything for the rest.
+ */
+export function visibleIndexRange(idx, values, n, xMin, xMax) {
+    if (n === 0)
+        return [0, 0];
+    let i0;
+    let i1;
+    if (idx.uniform && idx.dx > 0) {
+        i0 = Math.floor((xMin - idx.x0) / idx.dx);
+        i1 = Math.ceil((xMax - idx.x0) / idx.dx) + 1;
+    }
+    else if (idx.sorted) {
+        i0 = lowerBound(values, n, xMin);
+        i1 = upperBound(values, n, xMax);
+    }
+    else {
+        return [0, n];
+    }
+    i0 = Math.max(0, i0 - 1);
+    i1 = Math.min(n, i1 + 1);
+    if (i1 < i0)
+        i1 = i0;
+    return [i0, i1];
+}
+/**
+ * The nearest index to x, for tooltip snapping. Sorted columns answer in
+ * O(log n); unsorted in O(n) — scatter tooltips over huge unsorted data can
+ * live with the miss being approximate instead.
+ */
+export function nearestIndex(idx, values, n, x) {
+    if (n === 0)
+        return -1;
+    if (idx.uniform && idx.dx !== 0 && !Number.isNaN(idx.dx)) {
+        const i = Math.round((x - idx.x0) / idx.dx);
+        return Math.max(0, Math.min(n - 1, i));
+    }
+    if (idx.sorted) {
+        const at = lowerBound(values, n, x);
+        if (at <= 0)
+            return 0;
+        if (at >= n)
+            return n - 1;
+        return x - values[at - 1] <= values[at] - x ? at - 1 : at;
+    }
+    let best = 0;
+    let bestD = Infinity;
+    for (let i = 0; i < n; i++) {
+        const d = Math.abs(values[i] - x);
+        if (d < bestD) {
+            bestD = d;
+            best = i;
+        }
+    }
+    return best;
+}
+// --- stacks ----------------------------------------------------------------
+/**
+ * Cumulative tops for a stack: `tops[j][i]` is the sum of layers `0..j` at
+ * index `i`, NaN treated as 0 so one series' gap does not knock a hole in
+ * the layers above it. The arrays are fresh per build; the caller caches by
+ * its own version key and hands each layer's array back through
+ * `pyramidFor`-compatible columns (a fresh array is its own host).
+ */
+export function buildStackTops(layers, n) {
+    const tops = [];
+    let prev = null;
+    for (const layer of layers) {
+        const top = new Float64Array(n);
+        for (let i = 0; i < n; i++) {
+            const v = layer[i];
+            const below = prev ? prev[i] : 0;
+            top[i] = below + (typeof v === 'number' && !Number.isNaN(v) ? v : 0);
+        }
+        tops.push(top);
+        prev = top;
+    }
+    return tops;
+}
+//# sourceMappingURL=data.js.map

package/dist/charts/data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.js","sourceRoot":"","sources":["../../src/charts/data.ts"],"names":[],"mappings":"AAAA,uEAAuE;AACvE,yEAAyE;AACzE,yEAAyE;AACzE,EAAE;AACF,0EAA0E;AAC1E,uEAAuE;AACvE,qEAAqE;AACrE,EAAE;AACF,yEAAyE;AACzE,EAAE;AACF,4EAA4E;AAC5E,mEAAmE;AACnE,EAAE;AACF,4EAA4E;AAC5E,2EAA2E;AAC3E,0EAA0E;AAC1E,yDAAyD;AACzD,0EAA0E;AAC1E,0EAA0E;AAC1E,yEAAyE;AACzE,EAAE;AACF,wEAAwE;AACxE,qDAAqD;AA+BrD,MAAM,UAAU,eAAe,CAAC,IAAqB;IACnD,OAAO,CACL,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QACpB,OAAQ,IAAsB,CAAC,MAAM,KAAK,UAAU;QACpD,OAAQ,IAAsB,CAAC,SAAS,KAAK,UAAU,CACxD,CAAC;AACJ,CAAC;AAoBD,MAAM,UAAU,GAAG,CAAC,CAAkB,EAAqB,EAAE,CAC3D,OAAQ,CAAkB,CAAC,MAAM,KAAK,QAAQ;IAC9C,CAAC,CAAE,CAAkB,CAAC,OAAO;IAC7B,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAWpB;2BAC2B;AAC3B,MAAM,SAAS,GAAG,IAAI,OAAO,EAAuC,CAAC;AAErE,4EAA4E;AAC5E,SAAS,IAAI,CAAC,GAAiB,EAAE,IAAY;IAC3C,IAAI,IAAI,IAAI,GAAG,CAAC,MAAM;QAAE,OAAO,GAAG,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAClE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACd,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAClB,IAAyB,EACzB,GAAW;IAEX,IAAI,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,CAAC,MAAM;QAAE,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;IACvD,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACzC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,mEAAmE;QACnE,0DAA0D;QAC1D,IAAI,OAAO,GAAmB,IAAI,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACzB,IAAI,CAAC,IAAI,IAAI;gBAAE,SAAS;YACxB,OAAO,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC;YAChC,MAAM;QACR,CAAC;QACD,IAAI,OAAO,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAClC,KAAK,GAAG;YACN,CAAC,EAAE,CAAC;YACJ,OAAO;YACP,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;SACzD,CAAC;QACF,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACzB,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAClB,IAAI,MAAM,GAAG,KAAK,CAAC,MAAsB,CAAC;QAC1C,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACzB,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9C,CAAC;QACD,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;IACxB,CAAC;SAAM,CAAC;QACN,MAAM,MAAM,GAAG,KAAK,CAAC,MAAkB,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IACZ,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,IAAqB,EACrB,GAAW;IAEX,IAAI,eAAe,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACnD,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC;QAC9C,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAgB,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;IAClE,CAAC;IACD,MAAM,IAAI,GAAG,IAA2B,CAAC;IACzC,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACrC,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,OAAO;QACL,MAAM,EAAE,KAAK,CAAC,OAAO;YACnB,CAAC,CAAE,KAAK,CAAC,MAAuB,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YACrD,CAAC,CAAC,KAAK,CAAC,MAAM;QAChB,CAAC,EAAE,KAAK,CAAC,CAAC;QACV,IAAI,EAAE,IAAc;QACpB,KAAK,EAAE,CAAC;QACR,OAAO,EAAE,KAAK,CAAC,OAAO;KACvB,CAAC;AACJ,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,aAAa,CAC3B,GAA0B;IAE1B,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,GAAqB,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5D,CAAC;AAuCD;;;;;;;;GAQG;AACH,MAAM,OAAO,SAAS;IACZ,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IACvC,EAAE,GAAG,CAAC,CAAC;IACP,MAAM,GAAG,CAAC,CAAC;IACX,UAAU,GAAG,IAAI,GAAG,EAAqC,CAAC;IACjD,UAAU,CAAS;IACnB,OAAO,CAAqC;IAE7D,YAAY,OAAO,GAAqB,EAAE;QACxC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,IAAI,QAAQ,CAAC,CAAC;QAC7D,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,OAAO;YACV,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACvE,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED,kEAAkE;IAClE,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;oDACgD;IAChD,MAAM,CAAC,GAA8C;QACnD,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK;QACH,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC;YAAE,OAAO;QAC1B,oEAAoE;QACpE,wDAAwD;QACxD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,GAAG,CAAC,OAAO;gBAAG,GAAG,CAAC,MAAmB,CAAC,MAAM,GAAG,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,4CAA4C;IAC5C,UAAU,CAAC,IAA0D;QACnE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;gBAAE,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACtE,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YACnB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACvB,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;oBAChB,IAAI,MAAM,GAAG,GAAG,CAAC,MAAsB,CAAC;oBACxC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;oBAC9B,MAAM,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;oBAC7C,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC;gBACtB,CAAC;qBAAM,CAAC;oBACL,GAAG,CAAC,MAAmB,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5D,CAAC;YACH,CAAC;YACD,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACnB,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACtC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IAEO,aAAa,CAAC,GAAW,EAAE,MAAe;QAChD,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO;QAChC,MAAM,OAAO,GAAG,OAAO,MAAM,KAAK,QAAQ,CAAC;QAC3C,MAAM,GAAG,GAAgB;YACvB,GAAG;YACH,OAAO;YACP,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;YAClE,IAAI,EAAE,EAAE,GAAG,EAAE;SACd,CAAC;QACF,IAAI,OAAO;YAAG,GAAG,CAAC,MAAuB,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;;YAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;gBAAG,GAAG,CAAC,MAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;0CACsC;IAC9B,cAAc;QACpB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;QAC9B,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,CAAC;YACtD,IAAI,GAAG,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC;QACzB,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC;QACzB,IAAI,GAAG,EAAE,CAAC;YACR,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,GAAG,EAAE,OAAO,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;gBAChC,MAAM,MAAM,GAAG,GAAG,CAAC,MAAsB,CAAC;gBAC1C,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;gBAC5C,mEAAmE;gBACnE,+BAA+B;gBAC/B,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;gBAClD,mEAAmE;gBACnE,kEAAkE;gBAClE,gEAAgE;gBAChE,gEAAgE;gBAChE,IACE,KAAK,GAAG,IAAI;oBACZ,CAAC,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,EAChE,CAAC;oBACD,IAAI,GAAG,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,IAAI,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;gBAChB,MAAM,MAAM,GAAG,GAAG,CAAC,MAAsB,CAAC;gBAC1C,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACL,GAAG,CAAC,MAAmB,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC;QAChB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,GAAW;QAChB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QACtB,OAAO;YACL,MAAM,EAAE,GAAG,CAAC,OAAO;gBACjB,CAAC,CAAE,GAAG,CAAC,MAAuB,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;gBACnD,CAAC,CAAE,GAAG,CAAC,MAAmB;YAC5B,CAAC,EAAE,IAAI,CAAC,EAAE;YACV,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,KAAK,EAAE,IAAI,CAAC,MAAM;YAClB,OAAO,EAAE,GAAG,CAAC,OAAO;SACrB,CAAC;IACJ,CAAC;IAED,qEAAqE;IACrE,SAAS,CAAC,QAA2C;QACnD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9B,OAAO,GAAG,EAAE;YACV,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC,CAAC;IACJ,CAAC;IAEO,OAAO,CAAC,QAAgB;QAC9B,MAAM,MAAM,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;QAChD,KAAK,MAAM,QAAQ,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;YAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IAChE,CAAC;CACF;AAED,8EAA8E;AAE9E;;uCAEuC;AACvC,MAAM,IAAI,GAAG,EAAE,CAAC;AAChB,MAAM,UAAU,GAAG,CAAC,CAAC;AAkBrB,MAAM,QAAQ,GAAG,IAAI,OAAO,EAAmB,CAAC;AAEhD,SAAS,SAAS,CAAC,KAAmB,EAAE,MAAc;IACpD,IAAI,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO;IACxC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACrB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACrB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CACpB,GAAY,EACZ,MAAyB,EACzB,CAAS;IAET,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC;IACzB,IAAI,CAAC,IAAI,KAAK;QAAE,OAAO;IAEvB,+DAA+D;IAC/D,IAAI,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM;QAC7B,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI;QACxC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;IACd,OAAO,OAAO,GAAG,CAAC,EAAE,CAAC;QACnB,OAAO,KAAK,CAAC,CAAC;QACd,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;YACd,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;YACzB,IAAI,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;YACzB,MAAM,EAAE,CAAC;SACV,CAAC,CAAC;IACL,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QACxC,SAAS,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC;gBACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBACpC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBACpB,4DAA4D;oBAC5D,IAAI,CAAC,GAAG,GAAG;wBAAE,GAAG,GAAG,CAAC,CAAC;oBACrB,IAAI,CAAC,GAAG,GAAG;wBAAE,GAAG,GAAG,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;gBAClB,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;oBACtB,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG;wBAAE,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC/C,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG;wBAAE,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjD,CAAC;gBACD,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;oBACtB,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG;wBAAE,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC/C,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG;wBAAE,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,CAAC;QACD,KAAK,CAAC,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,GAAkB;IAC3C,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,EAAE,CAAC;QACpC,GAAG,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QAClD,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,OAAO,GAAG,CAAC;AACb,CAAC;AASD;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,GAAY,EACZ,MAAyB,EACzB,EAAU,EACV,EAAU,EACV,GAAW;IAEX,IAAI,GAAG,GAAG,QAAQ,CAAC;IACnB,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;IACpB,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,8CAA8C;IAC9C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IAChE,OAAO,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;IACvB,CAAC;IACD,8DAA8D;IAC9D,OAAO,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,OACE,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM;YACzB,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC;YACrB,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,EACrB,CAAC;YACD,CAAC,EAAE,CAAC;YACJ,IAAI,KAAK,CAAC,CAAC;QACb,CAAC;QACD,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC,IAAI,IAAI,CAAC;IACZ,CAAC;IACD,oBAAoB;IACpB,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACnB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;IACvB,CAAC;IACD,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;IACd,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;AAChB,CAAC;AAiBD,MAAM,QAAQ,GAAG,IAAI,OAAO,EAAkB,CAAC;AAE/C;;sCAEsC;AACtC,MAAM,WAAW,GAAG,IAAI,CAAC;AAEzB,SAAS,YAAY,CAAC,GAAW,EAAE,MAAyB,EAAE,CAAS;IACrE,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACnB,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO;IACnB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;QACb,GAAG,CAAC,GAAG,GAAG,QAAQ,CAAC;QACnB,GAAG,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC;QACpB,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC7C,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAClB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACpB,iEAAiE;YACjE,mCAAmC;YACnC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC;YACnB,GAAG,CAAC,OAAO,GAAG,KAAK,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,IAAI;gBAAE,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC;YACjC,IAAI,GAAG,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;gBAC9C,MAAM,SAAS,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;gBACtC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,GAAG,KAAK,CAAC;gBACnD,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,GAAG;oBAAE,GAAG,CAAC,OAAO,GAAG,KAAK,CAAC;YACzD,CAAC;YACD,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG;gBAAE,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YAC7B,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG;gBAAE,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YAC7B,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,sEAAsE;IACtE,iDAAiD;IACjD,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;AACjB,CAAC;AAED;uBACuB;AACvB,MAAM,UAAU,SAAS,CAAC,GAAkB;IAC1C,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,EAAE,CAAC;QACpC,GAAG,GAAG;YACJ,MAAM,EAAE,CAAC;YACT,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,MAAM,EAAE,IAAI;YACZ,OAAO,EAAE,IAAI;YACb,EAAE,EAAE,CAAC;YACL,EAAE,EAAE,GAAG;YACP,GAAG,EAAE,QAAQ;YACb,GAAG,EAAE,CAAC,QAAQ;SACf,CAAC;QACF,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,UAAU,CACxB,MAAyB,EACzB,CAAS,EACT,CAAS;IAET,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;YAC7B,EAAE,GAAG,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,UAAU,CACxB,MAAyB,EACzB,CAAS,EACT,CAAS;IAET,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;YAC9B,EAAE,GAAG,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,GAAW,EACX,MAAyB,EACzB,CAAS,EACT,IAAY,EACZ,IAAY;IAEZ,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,IAAI,EAAU,CAAC;IACf,IAAI,EAAU,CAAC;IACf,IAAI,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QAC9B,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1C,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC;SAAM,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QACtB,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACjC,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACzB,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACzB,IAAI,EAAE,GAAG,EAAE;QAAE,EAAE,GAAG,EAAE,CAAC;IACrB,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC1B,GAAW,EACX,MAAyB,EACzB,CAAS,EACT,CAAS;IAET,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IACvB,IAAI,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QACzD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QACf,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,IAAI,EAAE,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QACtB,IAAI,EAAE,IAAI,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QAC1B,OAAO,CAAC,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5D,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,KAAK,GAAG,QAAQ,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;YACd,KAAK,GAAG,CAAC,CAAC;YACV,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAoC,EACpC,CAAS;IAET,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,IAAI,IAAI,GAAwB,IAAI,CAAC;IACrC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,KAAK,GAAW,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,IAAI,GAAG,GAAG,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/charts/hx.d.ts

@@ -0,0 +1,21 @@
+import type { Key, ReactElement, ReactNode, Ref } from 'react';
+import type { ReactX11Elements, Theme } from 'react-x11';
+/** The host elements, by name. */
+export type Host = ReactX11Elements;
+/**
+ * What every element takes on top of its own props. `theme` is honoured by
+ * every node at runtime; react-x11's declarations only put it on
+ * `<window>`, so it is re-declared here the way the calendar does.
+ * `data-testname` is the query hook every component forwards
+ * (docs/README.md, "Conventions"); react-x11 passes `data-*` through, the
+ * declarations just do not spell it.
+ */
+interface CommonProps {
+    key?: Key;
+    ref?: Ref<unknown>;
+    theme?: Theme | Record<string, string | number>;
+    'data-testname'?: string;
+}
+export declare function hx<K extends keyof Host>(type: K, props?: (Omit<Host[K], 'theme'> & CommonProps) | null, ...children: ReactNode[]): ReactElement;
+export {};
+//# sourceMappingURL=hx.d.ts.map

package/dist/charts/hx.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hx.d.ts","sourceRoot":"","sources":["../../src/charts/hx.ts"],"names":[],"mappings":"AAWA,OAAO,KAAK,EAAE,GAAG,EAAE,YAAY,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAC/D,OAAO,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAEzD,kCAAkC;AAClC,MAAM,MAAM,IAAI,GAAG,gBAAgB,CAAC;AAEpC;;;;;;;GAOG;AACH,UAAU,WAAW;IACnB,GAAG,CAAC,EAAE,GAAG,CAAC;IACV,GAAG,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IACnB,KAAK,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC;IAChD,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,wBAAgB,EAAE,CAAC,CAAC,SAAS,MAAM,IAAI,EACrC,IAAI,EAAE,CAAC,EACP,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,WAAW,CAAC,GAAG,IAAI,EACrD,GAAG,QAAQ,EAAE,SAAS,EAAE,GACvB,YAAY,CAEd"}