cursedbelt 2.8.0 → 3.0.1

package/dist/core/analytics/range.js

@@ -1,272 +0,0 @@
-/**
- * The time-range vocabulary every analytics surface shares — the presets, the
- * bucket size each one implies, and the bucketing itself.
- *
- * ── Why this is a shared primitive and not per-dashboard code ────────────────
- * Every dashboard needs "today / this week / this month", and every one that
- * hand-rolls it gets the same three things subtly wrong:
- *
- * 1. **"Today" is not "the last 24 hours."** The owner asking *"has the
- *    orchestrator done well today?"* means since midnight in THEIR timezone,
- *    against comparable earlier days. A rolling 24h window silently mixes last
- *    night into this morning and makes every day look average.
- * 2. **The bucket must follow the range.** Hourly buckets over 90 days is 2,160
- *    points nobody can read; daily buckets over one day is a single bar. The
- *    preset owns both, so a range change cannot leave a mismatched bucket
- *    behind.
- * 3. **A comparison needs a baseline of the same shape.** "42 tasks" answers
- *    nothing. "42, against a 7-day median of 26" answers the question that was
- *    actually asked — and the baseline has to be the same length as the range
- *    or the comparison is meaningless.
- *
- * Framework-free and DOM-free on purpose: the ENGINE computes with it and the
- * BROWSER renders with it, and they must bucket identically or a chart's x-axis
- * disagrees with its own tooltip.
- *
- * ── Local days, not UTC days ────────────────────────────────────────────────
- * Day boundaries come from the host's own calendar (`new Date(y, m, d)`), so a
- * day is the day the reader lived through. UTC bucketing would move "today" by
- * 5–6 hours in America/Chicago and put a normal evening's work on tomorrow.
- * 🔴 It follows that the ENGINE must be the one to bucket (it shares the
- * owner's timezone) — a prod box on UTC bucketing for a Chicago reader
- * reintroduces exactly this bug.
- */
-export const RANGE_PRESETS = [
-    {
-        key: 'today',
-        label: 'Today',
-        description: 'Since midnight, by hour',
-        unit: 'hour',
-        days: 1,
-    },
-    { key: 'week', label: '7 days', description: 'The last 7 days, by day', unit: 'day', days: 7 },
-    {
-        key: 'month',
-        label: '30 days',
-        description: 'The last 30 days, by day',
-        unit: 'day',
-        days: 30,
-    },
-    {
-        key: 'quarter',
-        label: '90 days',
-        description: 'The last 90 days, by day',
-        unit: 'day',
-        days: 90,
-    },
-    {
-        key: 'year',
-        label: '1 year',
-        description: 'The last 365 days, by day',
-        unit: 'day',
-        days: 365,
-    },
-    { key: 'all', label: 'All', description: 'Everything on record, by day', unit: 'day', days: null },
-    {
-        key: 'custom',
-        label: 'Custom',
-        description: 'A range you pick',
-        unit: 'day',
-        // Not a width. `custom` is resolved from the caller's own bounds; `days` is
-        // null for the same reason `all`'s is — neither has one until it is asked.
-        days: null,
-    },
-];
-/** The presets with a fixed width, in order — the ordinary switcher's options. */
-export const FIXED_RANGE_KEYS = RANGE_PRESETS.filter((p) => p.key !== 'custom').map((p) => p.key);
-/**
- * Pick the bucket unit for an arbitrary span. Hourly up to two days (a bucket
- * per hour over 48h is 48 points — readable); daily past that, because 90 days
- * of hourly buckets is 2,160 points nobody can read, which is the same argument
- * the fixed presets make.
- */
-export const unitForSpan = (spanMs) => (spanMs <= 2 * DAY_MS ? 'hour' : 'day');
-export const rangePreset = (key) => RANGE_PRESETS.find((p) => p.key === key) ?? RANGE_PRESETS[1];
-export const HOUR_MS = 3_600_000;
-export const DAY_MS = 86_400_000;
-/** Local midnight at the start of `t`'s day. */
-export const startOfDay = (t) => {
-    const d = new Date(t);
-    return new Date(d.getFullYear(), d.getMonth(), d.getDate()).getTime();
-};
-/** Local start of `t`'s hour. */
-export const startOfHour = (t) => {
-    const d = new Date(t);
-    return new Date(d.getFullYear(), d.getMonth(), d.getDate(), d.getHours()).getTime();
-};
-/** Start of the bucket `t` falls in, for either unit. */
-export const startOfBucket = (t, unit) => unit === 'hour' ? startOfHour(t) : startOfDay(t);
-/**
- * Add `n` calendar days, keeping the wall clock. `t + n * DAY_MS` drifts by an
- * hour twice a year and lands on the wrong calendar day, which shows up as a
- * duplicated or missing bar exactly once every spring and autumn — the kind of
- * bug nobody reproduces.
- *
- * The time-of-day is carried through rather than normalised to midnight: every
- * caller here passes an already-aligned value, so normalising would be
- * invisible in this file and a trap for the first caller that does not.
- */
-export const addDays = (t, n) => {
-    const d = new Date(t);
-    return new Date(d.getFullYear(), d.getMonth(), d.getDate() + n, d.getHours(), d.getMinutes(), d.getSeconds(), d.getMilliseconds()).getTime();
-};
-/**
- * Turn a preset into concrete bounds and bucket starts.
- *
- * The third argument is either the `earliest` timestamp (the original,
- * still-supported form — `all` is bounded by the first datum, and absent one it
- * falls back to 90 days so a caller can never ask for a bucket array reaching
- * back to the epoch) or an options object, which is how `custom` receives its
- * bounds.
- *
- * 🔴 `custom` with no bounds is NOT an error and must not throw — a switcher can
- * legitimately be on Custom before the reader has picked two dates. It degrades
- * to the `month` preset, which is a visible, ordinary window rather than an
- * empty chart the reader has to diagnose.
- */
-export function resolveRange(key, now, options) {
-    const opts = typeof options === 'number' ? { earliest: options } : (options ?? {});
-    if (key === 'custom') {
-        const bounds = opts.custom;
-        if (!bounds || !Number.isFinite(bounds.from) || !Number.isFinite(bounds.to) || bounds.to <= bounds.from) {
-            return resolveRange('month', now, { earliest: opts.earliest });
-        }
-        const unit = unitForSpan(bounds.to - bounds.from);
-        const from = startOfBucket(bounds.from, unit);
-        const to = bounds.to;
-        const buckets = bucketStarts(from, to, unit);
-        const span = to - from;
-        return { key, from, to, unit, buckets, previous: { from: from - span, to: from } };
-    }
-    const preset = rangePreset(key);
-    const from = preset.days === null
-        ? startOfDay(opts.earliest ?? addDays(now, -90))
-        : preset.unit === 'hour'
-            ? startOfDay(now)
-            : addDays(startOfDay(now), -(preset.days - 1));
-    const buckets = bucketStarts(from, now, preset.unit);
-    const span = now - from;
-    return {
-        key,
-        from,
-        to: now,
-        unit: preset.unit,
-        buckets,
-        previous: preset.days === null ? null : { from: from - span, to: from },
-    };
-}
-/** Every bucket start in `[from, to]`, oldest → newest. Never empty. */
-function bucketStarts(from, to, unit) {
-    const buckets = [];
-    if (unit === 'hour') {
-        for (let t = from; t <= to; t += HOUR_MS)
-            buckets.push(t);
-    }
-    else {
-        for (let t = from; t <= to; t = addDays(t, 1))
-            buckets.push(t);
-    }
-    // A guard, not a formality: a corrupt clock (or an `earliest` in the future)
-    // could otherwise produce an empty axis with no explanation.
-    if (buckets.length === 0)
-        buckets.push(from);
-    return buckets;
-}
-/**
- * The active window, stated in words — what a panel prints so a reader never has
- * to infer which period a number covers.
- *
- * This exists because of one owner report, 2026-08-13: *"what time period are we
- * showing. For instance 'Spend & tokens by model' doesn't say if its per this
- * month or week"*. A figure whose window is unstated is not a smaller version of
- * the same figure — it is unreadable, because every reasonable guess gives a
- * different answer.
- */
-export function rangeLabel(range) {
-    if (range.key === 'today')
-        return 'Today, since midnight';
-    if (range.key === 'all')
-        return `All time — since ${dayKey(range.from)}`;
-    const first = dayKey(range.from);
-    const last = dayKey(range.to);
-    return first === last ? first : `${first} → ${last}`;
-}
-/**
- * Sum `weight(item)` into buckets by `at(item)`. Items outside the range are
- * dropped — silently, because a caller passing "all events" and asking for
- * today is the normal case, not an error.
- *
- * Returns one number per bucket, index-aligned with `range.buckets`, so a
- * caller can zip it against any other series from the same range without
- * re-deriving the axis.
- */
-export function bucketize(items, range, at, weight = () => 1) {
-    const out = new Array(range.buckets.length).fill(0);
-    const index = new Map(range.buckets.map((t, i) => [t, i]));
-    for (const item of items) {
-        const t = at(item);
-        if (!Number.isFinite(t) || t < range.from || t > range.to)
-            continue;
-        const i = index.get(startOfBucket(t, range.unit));
-        if (i !== undefined)
-            out[i] += weight(item);
-    }
-    return out;
-}
-/**
- * How much of `[from, to)` overlaps `[windowFrom, windowTo)`. The primitive
- * behind every "…excluding the time it was paused" number: a duration is only
- * honest once the intervals it should not be charged for are subtracted.
- */
-export const overlapMs = (from, to, windowFrom, windowTo) => Math.max(0, Math.min(to, windowTo) - Math.max(from, windowFrom));
-/**
- * `[from, to)` minus every interval in `exclude`. Used for pause-adjusted
- * durations and for the denominator of a rate that must not count downtime.
- *
- * `exclude` may overlap itself and need not be sorted — overlapping pause
- * windows (an engine pause inside a usage pause) must not subtract twice, which
- * is the bug a naive sum produces.
- */
-export function durationExcluding(from, to, exclude) {
-    const total = Math.max(0, to - from);
-    if (total === 0 || exclude.length === 0)
-        return total;
-    const clipped = exclude
-        .map((w) => ({ from: Math.max(w.from, from), to: Math.min(w.to, to) }))
-        .filter((w) => w.to > w.from)
-        .sort((a, b) => a.from - b.from);
-    let excluded = 0;
-    let cursor = -Infinity;
-    for (const w of clipped) {
-        const start = Math.max(w.from, cursor);
-        if (w.to > start) {
-            excluded += w.to - start;
-            cursor = w.to;
-        }
-    }
-    return Math.max(0, total - excluded);
-}
-/** Median of a numeric list. `null` for empty — never 0, which is a real value. */
-export function median(values) {
-    if (values.length === 0)
-        return null;
-    const s = [...values].sort((a, b) => a - b);
-    const mid = s.length >> 1;
-    return s.length % 2 === 0 ? (s[mid - 1] + s[mid]) / 2 : s[mid];
-}
-/** The `p`-th percentile (0–1), nearest-rank. `null` for empty. */
-export function percentile(values, p) {
-    if (values.length === 0)
-        return null;
-    const s = [...values].sort((a, b) => a - b);
-    const rank = Math.ceil(Math.min(1, Math.max(0, p)) * s.length);
-    return s[Math.max(0, rank - 1)];
-}
-/** A day key (`2026-08-13`) in LOCAL time — never `toISOString`, which is UTC. */
-export function dayKey(t) {
-    const d = new Date(t);
-    const mm = String(d.getMonth() + 1).padStart(2, '0');
-    const dd = String(d.getDate()).padStart(2, '0');
-    return `${d.getFullYear()}-${mm}-${dd}`;
-}
-//# sourceMappingURL=range.js.map

package/dist/core/analytics/range.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"range.js","sourceRoot":"","sources":["../../../src/core/analytics/range.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAgCH,MAAM,CAAC,MAAM,aAAa,GAA2B;IACnD;QACE,GAAG,EAAE,OAAO;QACZ,KAAK,EAAE,OAAO;QACd,WAAW,EAAE,yBAAyB;QACtC,IAAI,EAAE,MAAM;QACZ,IAAI,EAAE,CAAC;KACR;IACD,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,yBAAyB,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE;IAC9F;QACE,GAAG,EAAE,OAAO;QACZ,KAAK,EAAE,SAAS;QAChB,WAAW,EAAE,0BAA0B;QACvC,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,EAAE;KACT;IACD;QACE,GAAG,EAAE,SAAS;QACd,KAAK,EAAE,SAAS;QAChB,WAAW,EAAE,0BAA0B;QACvC,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,EAAE;KACT;IACD;QACE,GAAG,EAAE,MAAM;QACX,KAAK,EAAE,QAAQ;QACf,WAAW,EAAE,2BAA2B;QACxC,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,GAAG;KACV;IACD,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,8BAA8B,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE;IAClG;QACE,GAAG,EAAE,QAAQ;QACb,KAAK,EAAE,QAAQ;QACf,WAAW,EAAE,kBAAkB;QAC/B,IAAI,EAAE,KAAK;QACX,4EAA4E;QAC5E,2EAA2E;QAC3E,IAAI,EAAE,IAAI;KACX;CACO,CAAC;AAEX,kFAAkF;AAClF,MAAM,CAAC,MAAM,gBAAgB,GAAwB,aAAa,CAAC,MAAM,CACvE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,QAAQ,CAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAepB;;;;;GAKG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAc,EAAc,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAEnG,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,GAAa,EAAe,EAAE,CACxD,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC;AAE/D,MAAM,CAAC,MAAM,OAAO,GAAG,SAAS,CAAC;AACjC,MAAM,CAAC,MAAM,MAAM,GAAG,UAAU,CAAC;AAEjC,gDAAgD;AAChD,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAS,EAAU,EAAE;IAC9C,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;AACxE,CAAC,CAAC;AAEF,iCAAiC;AACjC,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAS,EAAU,EAAE;IAC/C,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;AACtF,CAAC,CAAC;AAEF,yDAAyD;AACzD,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,IAAgB,EAAU,EAAE,CACnE,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAEnD;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IACtD,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,OAAO,IAAI,IAAI,CACb,CAAC,CAAC,WAAW,EAAE,EACf,CAAC,CAAC,QAAQ,EAAE,EACZ,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,EACf,CAAC,CAAC,QAAQ,EAAE,EACZ,CAAC,CAAC,UAAU,EAAE,EACd,CAAC,CAAC,UAAU,EAAE,EACd,CAAC,CAAC,eAAe,EAAE,CACpB,CAAC,OAAO,EAAE,CAAC;AACd,CAAC,CAAC;AAkBF;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,YAAY,CAC1B,GAAa,EACb,GAAW,EACX,OAAsC;IAEtC,MAAM,IAAI,GACR,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IAExE,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;YACxG,OAAO,YAAY,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC9C,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;QACrB,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC;QACvB,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;IACrF,CAAC;IAED,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,IAAI,GACR,MAAM,CAAC,IAAI,KAAK,IAAI;QAClB,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM;YACtB,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;YACjB,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IAErD,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAErD,MAAM,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC;IACxB,OAAO;QACL,GAAG;QACH,IAAI;QACJ,EAAE,EAAE,GAAG;QACP,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,OAAO;QACP,QAAQ,EAAE,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE;KACxE,CAAC;AACJ,CAAC;AAED,wEAAwE;AACxE,SAAS,YAAY,CAAC,IAAY,EAAE,EAAU,EAAE,IAAgB;IAC9D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,OAAO;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,6EAA6E;IAC7E,6DAA6D;IAC7D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,OAAO,OAAO,CAAC;AACjB,CAAC;AAUD;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU,CAAC,KAAkB;IAC3C,IAAI,KAAK,CAAC,GAAG,KAAK,OAAO;QAAE,OAAO,uBAAuB,CAAC;IAC1D,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK;QAAE,OAAO,oBAAoB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;IACzE,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC9B,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,IAAI,EAAE,CAAC;AACvD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,SAAS,CACvB,KAAmB,EACnB,KAAoB,EACpB,EAAuB,EACvB,SAA8B,GAAG,EAAE,CAAC,CAAC;IAErC,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC,EAAE;YAAE,SAAS;QACpE,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAClD,IAAI,CAAC,KAAK,SAAS;YAAE,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,IAAY,EACZ,EAAU,EACV,UAAkB,EAClB,QAAgB,EACR,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;AAE9E;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAAY,EACZ,EAAU,EACV,OAAgD;IAEhD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,CAAC;IACrC,IAAI,KAAK,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEtD,MAAM,OAAO,GAAG,OAAO;SACpB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SACtE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC;SAC5B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IAEnC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC;YACjB,QAAQ,IAAI,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC;YACzB,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;QAChB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAC;AACvC,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,MAAM,CAAC,MAAyB;IAC9C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;IAC1B,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACjE,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,UAAU,CAAC,MAAyB,EAAE,CAAS;IAC7D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/D,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,MAAM,CAAC,CAAS;IAC9B,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAChD,OAAO,GAAG,CAAC,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;AAC1C,CAAC"}

package/dist/core/analytics/schedule.d.ts

@@ -1,302 +0,0 @@
-/**
- * "How long until this queue is empty, and does another worker actually help?"
- *
- * ── The question this exists to answer (owner, 2026-08-23) ───────────────────
- * *"For estimates of how long to empty tasks I would also like to be able to see
- * them based on if I added to the fleet size or reduced it… I want to be able to
- * tell whether there is a point where adding to the fleet slows down more than
- * it speeds up. I also want to see the expected token usage so I know if I run
- * out of tokens earlier and how much earlier."*
- *
- * Three separate claims hide in that, and a `remaining / rate` division answers
- * none of them:
- *
- * 1. **Work does not parallelise freely.** Two tasks that write the same files
- *    may not run together whatever the fleet size — that is the orchestrator's
- *    own scope rule, and it is why a queue of ten tasks all scoped to one app
- *    drains at exactly the same speed with eight workers as with one.
- * 2. **Workers are not free of each other.** This machine's own measurements say
- *    a verify gate takes 2m09s idle and 857s (6.6x) under seventeen concurrent
- *    gates. Past some point another worker makes *everyone* slower, so the
- *    makespan curve turns back UP — the "point where adding to the fleet slows
- *    down more than it speeds up" is real, has a number, and this module finds
- *    it. A scheduler with no contention term can never report one, because pure
- *    list scheduling is monotone: more workers is never worse.
- * 3. **Tokens are spent by work, not by time.** Doubling the fleet does not
- *    double the tokens a queue costs — it spends the same budget roughly twice
- *    as fast, so the wall-clock moment you run dry arrives sooner even though the
- *    total is unchanged. Both numbers matter and they move in opposite
- *    directions.
- *
- * ── Why it lives in cursedbelt and not in the orchestrator ───────────────────
- * Nothing here knows what a "task" is. It schedules ITEMS with durations,
- * exclusion keys and dependencies over WORKERS, which is the same shape as a
- * deploy train, a batch of renders, a backup rotation or a CI matrix. The
- * orchestrator supplies the meaning (a scope string, a serial group, a tier's
- * measured duration) and reads the answer back; any other dashboard in the fleet
- * can do the same without re-deriving a scheduler.
- *
- * Pure, deterministic, and clock-free: the caller passes `now` when it wants
- * absolute times. That is what lets the whole forecast be asserted in a test
- * rather than eyeballed on a chart.
- */
-/** One unit of work to be scheduled. */
-export interface ScheduleItem {
-    id: string;
-    /** Estimated worker time at NOMINAL speed (no contention), in ms. */
-    durationMs: number;
-    /**
-     * Resources this item WRITES. Two items sharing any one of these may never run
-     * at the same time, however many workers are free. This is the orchestrator's
-     * `conflict_scopes.writes`, a deploy's target host, a render's GPU.
-     */
-    exclusive?: readonly string[];
-    /**
-     * A named mutual exclusion — at most one member of the group runs at a time.
-     * Kept separate from {@link exclusive} because it expresses "these take turns"
-     * without anyone having to say what the shared resource IS.
-     */
-    group?: string | null;
-    /** Ids that must have finished before this may start. */
-    dependsOn?: readonly string[];
-    /** What running it is expected to cost, in the caller's unit (tokens, dollars). */
-    cost?: number;
-    /** Higher goes first among items that are simultaneously eligible. Default 0. */
-    priority?: number;
-    /** Already in flight at t=0, with this much work left. Occupies a worker. */
-    runningRemainingMs?: number;
-}
-/**
- * How much slower every worker gets as more of them run at once.
- *
- * The shape is deliberately the simplest one that can bend a makespan curve back
- * upward, because a more elaborate model would imply a precision the inputs do
- * not have. `stretch(c) = 1 + slowdownPerExtraWorker * max(0, c - freeLanes)`,
- * clamped at `maxStretch`: below `freeLanes` the machine absorbs the load, above
- * it every extra worker taxes all of them.
- *
- * 🔴 The default is NOT "no contention". A model with `slowdownPerExtraWorker: 0`
- * always reports that more workers are better, which is the wrong answer on this
- * machine and would make the whole panel a machine for justifying a bigger fleet.
- * Calibrate it from measured runs where you can — {@link estimateContention} —
- * and state on the panel that it is an estimate where you cannot.
- */
-export interface ContentionModel {
-    /** Concurrency up to and including this runs at nominal speed. */
-    freeLanes: number;
-    /** Fractional slowdown added to EVERY worker per extra concurrent worker. */
-    slowdownPerExtraWorker: number;
-    /** Upper bound on the multiplier. Default 8 — beyond that the machine is thrashing. */
-    maxStretch?: number;
-}
-/** No contention at all — the ideal machine. Useful as a comparison line, and as
- *  the honest choice when the work is not CPU-bound on one host. */
-export declare const NO_CONTENTION: ContentionModel;
-export declare function stretchAt(model: ContentionModel, concurrency: number): number;
-export interface SimulateOptions {
-    /** How many items may run at once. */
-    workers: number;
-    contention?: ContentionModel;
-    /** Absolute epoch ms for t=0, so the result carries real timestamps. Default 0. */
-    startAt?: number;
-    /**
-     * Guard against a pathological input (a dependency cycle, a zero-duration
-     * storm). Simulation aborts after this many scheduling events and reports what
-     * it could not place. Default 20,000.
-     */
-    maxEvents?: number;
-}
-export interface ScheduledItem {
-    id: string;
-    /** Epoch ms (or ms from t=0 when `startAt` was omitted). */
-    startAt: number;
-    endAt: number;
-    /** Nominal duration, before contention. */
-    durationMs: number;
-    /** What it actually took at the concurrency it ran under. */
-    effectiveMs: number;
-    /** How long it sat eligible-but-blocked before starting. */
-    waitedMs: number;
-    /** Why it could not start earlier: `worker` (fleet full), `conflict`, `dependency`. */
-    blockedBy: 'worker' | 'conflict' | 'dependency' | null;
-}
-export interface ScheduleResult {
-    workers: number;
-    /** Wall clock from t=0 until the last item finishes. */
-    makespanMs: number;
-    /** Sum of NOMINAL durations — the work itself, independent of fleet size. */
-    workMs: number;
-    /** Sum of EFFECTIVE durations — the work plus what contention added. */
-    spentMs: number;
-    /** Worker-time wasted to contention: `spentMs - workMs`. */
-    contentionMs: number;
-    /** `workMs / (workers * makespanMs)`, 0–1. How much of the fleet was earning. */
-    utilization: number;
-    /** Mean simultaneous items across the makespan. */
-    avgConcurrency: number;
-    peakConcurrency: number;
-    /** Total of every item's `cost`. */
-    cost: number;
-    timeline: ScheduledItem[];
-    /** Ids that could never be placed (a dependency cycle or a missing dependency). */
-    unschedulable: string[];
-}
-/**
- * Event-driven list scheduling with resource exclusion and a contention term.
- *
- * The loop is: admit everything that can start, advance the clock to whichever
- * running item finishes FIRST **at the current concurrency's speed**, retire it,
- * repeat. Progress is tracked as remaining WORK rather than an end timestamp,
- * which is what makes contention correct rather than decorative: a task that
- * started alone and is joined by three others slows down for the rest of its run
- * and not retroactively.
- *
- * Admission order is priority, then longest-first. Longest-first (LPT) is the
- * classic list-scheduling heuristic and matters here: shortest-first leaves a
- * multi-hour task to start last and stretches the makespan by most of its own
- * length, which would make every large fleet look pointless.
- */
-export declare function simulateSchedule(items: readonly ScheduleItem[], options: SimulateOptions): ScheduleResult;
-export interface FleetPoint {
-    workers: number;
-    makespanMs: number;
-    /** `makespan(1) / makespan(n)`. 1 = no gain; n = perfect scaling. */
-    speedup: number;
-    /** `speedup / workers`, 0–1 — how much of each worker is actually earning. */
-    efficiency: number;
-    /** Wall clock saved against ONE FEWER worker. Negative = this worker made it worse. */
-    marginalMs: number;
-    utilization: number;
-    avgConcurrency: number;
-    peakConcurrency: number;
-    /** Worker-time lost to contention at this fleet size. */
-    contentionMs: number;
-    /** Total cost of the run (unchanged by fleet size — see {@link burnPerHour}). */
-    cost: number;
-    /** Cost per hour of wall clock at this fleet size — what empties a budget. */
-    burnPerHour: number;
-    /** Items that never got scheduled. */
-    unschedulable: number;
-}
-export interface FleetSweep {
-    points: FleetPoint[];
-    /**
-     * The recommendation: the SMALLEST fleet that gets within `tolerance` of the
-     * best time this queue can achieve anywhere in the sweep.
-     *
-     * 🔴 Not "the last size with a good marginal gain", which is the obvious
-     * definition and is wrong the moment contention makes the curve non-monotone.
-     * Measured on eight 10-minute tasks at a 0.6 slowdown: seven workers take 50
-     * minutes and eight take 46, so eight shows a HEALTHY +4-minute margin over
-     * seven while being six minutes worse than simply running two. A marginal
-     * reading recommends eight. Comparing against the best achievable makespan
-     * cannot: two workers is the answer, and it says so.
-     */
-    sweetSpot: number;
-    /**
-     * The first fleet size whose makespan is WORSE than the size below it, or null
-     * when contention never wins inside the swept range. This is the literal
-     * answer to "is there a point where adding to the fleet slows it down".
-     */
-    turnsNegativeAt: number | null;
-    /**
-     * The ceiling the WORK imposes, independent of the machine: the highest
-     * concurrency the queue's own conflicts ever allow. Adding workers past this
-     * cannot help at any speed, and no contention model is needed to say so.
-     */
-    parallelismCeiling: number;
-}
-export interface SweepOptions extends Omit<SimulateOptions, 'workers'> {
-    /** Largest fleet size to try. Default 8. */
-    maxWorkers?: number;
-    /** How much slower than the best achievable makespan a fleet size may be and
-     *  still count as "as good as it gets". Default 0.05 (5%). */
-    tolerance?: number;
-}
-export declare function sweepFleetSizes(items: readonly ScheduleItem[], options?: SweepOptions): FleetSweep;
-export interface BudgetProjection {
-    workers: number;
-    /** Ms of wall clock until the budget is gone, null when the queue finishes first. */
-    exhaustedInMs: number | null;
-    /** How much of the queue's cost the budget covers, 0–1. */
-    coverage: number;
-    /** Cost the queue is short by, 0 when the budget covers it. */
-    shortfall: number;
-    burnPerHour: number;
-}
-/**
- * When a spend budget runs out at each fleet size.
- *
- * The counter-intuitive half, and the reason the owner asked for it: **the total
- * is the same and the deadline is not.** A queue that costs 40M tokens costs 40M
- * whether one agent or five works it; five agents simply reach the wall in a
- * fifth of the time. So `coverage` (do I have enough at all?) is flat across the
- * sweep while `exhaustedInMs` shrinks — and the honest reading is "more workers
- * does not cost more, it costs sooner".
- */
-export declare function projectBudget(sweep: FleetSweep, budget: number): BudgetProjection[];
-/** One observed run: how long it took, and how loaded the machine was. */
-export interface ContentionSample {
-    /** Mean simultaneous workers while it ran. */
-    concurrency: number;
-    durationMs: number;
-}
-/**
- * Fit a {@link ContentionModel} to runs that actually happened.
- *
- * Deliberately a two-group comparison rather than a regression: the sample is a
- * few hundred runs of wildly different work, so a least-squares line through
- * duration-versus-concurrency mostly measures which KIND of task tends to run
- * alone. Comparing the median duration of "ran near-alone" against the median of
- * "ran in a crowd" is coarse, robust, and explainable on a caveat line, which is
- * what a number a fleet-size decision rests on has to be.
- *
- * Returns `null` when either group is too thin to speak — the caller must then
- * say the model is assumed, not measured.
- */
-export declare function estimateContention(samples: readonly ContentionSample[], options?: {
-    freeLanes?: number;
-    minGroup?: number;
-}): ContentionModel | null;
-export interface ConcurrencyChange {
-    /** When the count changed. */
-    at: number;
-    /** How many intervals were live from `at` until the next change. */
-    count: number;
-}
-/**
- * Turn a set of intervals into the step function of how many were live.
- *
- * The exact series behind an "average tasks at once" number, so a reader can see
- * the overlaps that produced it instead of taking the mean on faith. Ends before
- * starts at a tie: two runs where one finishes as the next begins were never
- * simultaneous, and counting them as two reports a concurrency the fleet's own
- * limit forbids.
- */
-export declare function concurrencyProfile(intervals: readonly {
-    from: number;
-    to: number;
-}[]): ConcurrencyChange[];
-/**
- * Time-weighted mean concurrency across `[from, to)`, optionally counting only
- * the parts of the window the fleet was actually ELIGIBLE to work.
- *
- * 🔴 The `exclude` argument is the whole point (owner report, 2026-08-23: *"the
- * Tasks at once card says '.2'… if it is using paused time to calculate that
- * there were usually 0 tasks at once let's stop letting it do that"*). Averaging
- * a running fleet over a window it was switched off for 90% of does not describe
- * the fleet, it describes the switch — and it reports a busy afternoon as 0.2.
- * Excluded spans are removed from BOTH the numerator and the denominator, so the
- * answer is "while it was running, this many at once".
- */
-export declare function meanConcurrency(intervals: readonly {
-    from: number;
-    to: number;
-}[], window: {
-    from: number;
-    to: number;
-}, exclude?: readonly {
-    from: number;
-    to: number;
-}[]): number;
-//# sourceMappingURL=schedule.d.ts.map

package/dist/core/analytics/schedule.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"schedule.d.ts","sourceRoot":"","sources":["../../../src/core/analytics/schedule.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AAMH,wCAAwC;AACxC,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,yDAAyD;IACzD,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B,mFAAmF;IACnF,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,iFAAiF;IACjF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,6EAA6E;IAC7E,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,eAAe;IAC9B,kEAAkE;IAClE,SAAS,EAAE,MAAM,CAAC;IAClB,6EAA6E;IAC7E,sBAAsB,EAAE,MAAM,CAAC;IAC/B,uFAAuF;IACvF,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;oEACoE;AACpE,eAAO,MAAM,aAAa,EAAE,eAAoF,CAAC;AAEjH,wBAAgB,SAAS,CAAC,KAAK,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAI7E;AAED,MAAM,WAAW,eAAe;IAC9B,sCAAsC;IACtC,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,eAAe,CAAC;IAC7B,mFAAmF;IACnF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAMD,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,4DAA4D;IAC5D,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,2CAA2C;IAC3C,UAAU,EAAE,MAAM,CAAC;IACnB,6DAA6D;IAC7D,WAAW,EAAE,MAAM,CAAC;IACpB,4DAA4D;IAC5D,QAAQ,EAAE,MAAM,CAAC;IACjB,uFAAuF;IACvF,SAAS,EAAE,QAAQ,GAAG,UAAU,GAAG,YAAY,GAAG,IAAI,CAAC;CACxD;AAED,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,wDAAwD;IACxD,UAAU,EAAE,MAAM,CAAC;IACnB,6EAA6E;IAC7E,MAAM,EAAE,MAAM,CAAC;IACf,wEAAwE;IACxE,OAAO,EAAE,MAAM,CAAC;IAChB,4DAA4D;IAC5D,YAAY,EAAE,MAAM,CAAC;IACrB,iFAAiF;IACjF,WAAW,EAAE,MAAM,CAAC;IACpB,mDAAmD;IACnD,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,oCAAoC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,aAAa,EAAE,CAAC;IAC1B,mFAAmF;IACnF,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAaD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,YAAY,EAAE,EAC9B,OAAO,EAAE,eAAe,GACvB,cAAc,CAwGhB;AAsCD,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,qEAAqE;IACrE,OAAO,EAAE,MAAM,CAAC;IAChB,8EAA8E;IAC9E,UAAU,EAAE,MAAM,CAAC;IACnB,uFAAuF;IACvF,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,yDAAyD;IACzD,YAAY,EAAE,MAAM,CAAC;IACrB,iFAAiF;IACjF,IAAI,EAAE,MAAM,CAAC;IACb,8EAA8E;IAC9E,WAAW,EAAE,MAAM,CAAC;IACpB,sCAAsC;IACtC,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,UAAU,EAAE,CAAC;IACrB;;;;;;;;;;;OAWG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B;;;;OAIG;IACH,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,WAAW,YAAa,SAAQ,IAAI,CAAC,eAAe,EAAE,SAAS,CAAC;IACpE,4CAA4C;IAC5C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;kEAC8D;IAC9D,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,YAAY,EAAE,EAC9B,OAAO,GAAE,YAAiB,GACzB,UAAU,CAoCZ;AAMD,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,MAAM,CAAC;IAChB,qFAAqF;IACrF,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,2DAA2D;IAC3D,QAAQ,EAAE,MAAM,CAAC;IACjB,+DAA+D;IAC/D,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAG,gBAAgB,EAAE,CAYnF;AAMD,0EAA0E;AAC1E,MAAM,WAAW,gBAAgB;IAC/B,8CAA8C;IAC9C,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,SAAS,gBAAgB,EAAE,EACpC,OAAO,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAO,GACtD,eAAe,GAAG,IAAI,CAkBxB;AAMD,MAAM,WAAW,iBAAiB;IAChC,8BAA8B;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,oEAAoE;IACpE,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,SAAS;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,EAAE,GACjD,iBAAiB,EAAE,CAgBrB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAC7B,SAAS,EAAE,SAAS;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,EAAE,EAClD,MAAM,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,EACpC,OAAO,GAAE,SAAS;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,EAAO,GACpD,MAAM,CAWR"}