@nac3/forge-cli 1.9.3 → 1.12.0

package/dist/sizing/model.js

@@ -0,0 +1,423 @@
+/**
+ * SIZING MODEL -- fixed architecture options with validity envelopes.
+ *
+ * Why this exists (Pablo, 2026-10-11, after the ADIP-KIKAN post mortem).
+ *
+ * docs/doctrine/concurrency-scale.md already said the right thing on its
+ * first line: "Every application Forge designs MUST be sized ... Scale is
+ * a RELEVAMIENTO input, not an afterthought bolted on when the app falls
+ * over." ADIP-KIKAN was built anyway with its whole working set resident
+ * in the Node heap. At its real volumetry (5.000 affiliates x 40 campaigns
+ * per year -> ~3,4M rows/year -> ~8 GB of live heap per year against a
+ * 2-4 GB V8 ceiling) that design hits a wall in months.
+ *
+ * So the lesson is NOT "write more doctrine". The doctrine was there and
+ * it was prose, and prose is advisory. Four concrete holes made the
+ * failure possible, and this module closes the first three:
+ *
+ *  1. The only volumetry Forge asked for was PEAK CONCURRENCY
+ *     (src/commands/triage.ts), used solely to pick a complexity tier.
+ *     Kikan has 100 concurrent users -- a low number -- and died of ROW
+ *     COUNT. Data volume x retention was never a question.
+ *  2. There was no HARDWARE envelope at all: no RAM, no runtime heap
+ *     ceiling, no disk. The architecture was chosen without knowing the
+ *     machine, and the ceiling that kills the process (V8's
+ *     heap_size_limit) is a property of the machine + runtime, not of the
+ *     business.
+ *  3. The architecture choice was FREE-FORM. Forge invented an approach
+ *     and wrote a rationale; there was no fixed option set with validity
+ *     ranges, so there was nothing to violate.
+ *  4. The only gate touching volumetry was SOFT (gates.md GS4), and soft
+ *     gates do not block. That one is closed by the hard gate in
+ *     src/sizing/store.ts + the G9 entry in docs/doctrine/gates.md.
+ *
+ * The shape of the fix, consistent with the project's own rule that rules
+ * are ENFORCEMENT and not prompt: the numbers are DERIVED here from
+ * declared inputs, each architecture option declares the envelope in
+ * which it is admissible, and choosing outside the envelope is a REJECTED
+ * call -- not a judgement the brain can argue its way out of.
+ *
+ * This module is pure: no I/O, no process state. Persistence and the gate
+ * live in ./store.ts.
+ *
+ * ASCII-only.
+ */
+/** Index + row overhead on disk relative to the runtime row size. */
+const DISK_OVERHEAD_FACTOR = 2.5;
+const DAYS_PER_YEAR = 365;
+export function derive(input) {
+    const years = Math.max(1, input.horizon_years || 1);
+    const rowsPerYear = input.entities.reduce((acc, e) => acc + (e.count || 0) * (e.events_per_year || 0) * (e.rows_per_event || 0), 0);
+    const rowsAtHorizon = rowsPerYear * years;
+    const traceShare = clamp01(input.trace_share);
+    const businessShare = 1 - traceShare;
+    /* Years each class survives. Retention 0 = forever = the whole horizon. */
+    const businessYears = input.retention.business_days > 0
+        ? Math.min(years, input.retention.business_days / DAYS_PER_YEAR)
+        : years;
+    const traceYears = input.retention.trace_days > 0
+        ? Math.min(years, input.retention.trace_days / DAYS_PER_YEAR)
+        : years;
+    const liveBusiness = rowsPerYear * businessShare * businessYears;
+    const liveTrace = rowsPerYear * traceShare * traceYears;
+    const liveRows = liveBusiness + liveTrace;
+    const heapMb = (liveRows * (input.bytes_per_row || 0)) / (1024 * 1024);
+    const heapCap = Math.max(1, input.hardware.heap_cap_mb || 1);
+    const diskGb = (liveRows * (input.bytes_per_row || 0) * DISK_OVERHEAD_FACTOR) / (1024 * 1024 * 1024);
+    const diskCap = Math.max(1, input.hardware.disk_gb || 1);
+    const unboundedClasses = [];
+    if (input.retention.business_days <= 0 && businessShare > 0)
+        unboundedClasses.push('business');
+    if (input.retention.trace_days <= 0 && traceShare > 0)
+        unboundedClasses.push('trace');
+    return {
+        rows_per_year: round(rowsPerYear),
+        rows_at_horizon: round(rowsAtHorizon),
+        live_rows: round(liveRows),
+        live_business_rows: round(liveBusiness),
+        live_trace_rows: round(liveTrace),
+        heap_mb_if_resident: round1(heapMb),
+        heap_pct_if_resident: round1((heapMb / heapCap) * 100),
+        disk_gb_at_horizon: round1(diskGb),
+        disk_pct_at_horizon: round1((diskGb / diskCap) * 100),
+        unbounded: unboundedClasses.length > 0,
+        unbounded_classes: unboundedClasses,
+    };
+}
+function clamp01(n) {
+    if (!Number.isFinite(n))
+        return 0;
+    return Math.min(1, Math.max(0, n));
+}
+function round(n) {
+    return Number.isFinite(n) ? Math.round(n) : 0;
+}
+function round1(n) {
+    return Number.isFinite(n) ? Math.round(n * 10) / 10 : 0;
+}
+/* ------------------------------------------------------------------ *
+ * The axes and their fixed options
+ * ------------------------------------------------------------------ */
+export const AXES = ['state_residency', 'pagination', 'retention', 'write_concurrency'];
+export const AXIS_LABEL = {
+    state_residency: 'Where the working set lives',
+    pagination: 'How a list page is produced',
+    retention: 'What bounds each data class',
+    write_concurrency: 'What makes a multi-step mutation atomic',
+};
+/**
+ * The share of the heap ceiling a resident working set may occupy.
+ *
+ * 25% and not 80%: the heap also holds every request in flight, the
+ * declarative catalog, the HTTP buffers and V8's own slack, and
+ * mark-compact pauses grow with the LIVE set long before the ceiling is
+ * reached -- the system gets unusable before it crashes. A quarter is the
+ * line where a resident set is a cache and not a liability.
+ */
+export const RESIDENT_HEAP_PCT_MAX = 25;
+/** Above this many rows an in-memory page slice stops being honest. */
+export const IN_MEMORY_PAGE_ROWS_MAX = 100_000;
+/** Above this share of the disk, "keep everything forever" is a plan to run out. */
+export const RETENTION_NONE_DISK_PCT_MAX = 25;
+const ok = (reason) => ({ ok: true, reason });
+const no = (reason) => ({ ok: false, reason });
+export const OPTIONS = [
+    /* ---------------- state_residency ---------------- */
+    {
+        id: 'memory-only',
+        axis: 'state_residency',
+        label: 'In memory, no durability',
+        what: 'A process-local map. Restarting loses everything.',
+        envelope: ({ input }) => input.peak_concurrency > 0
+            ? no('only valid with zero users (dev / test / a prototype nobody depends on); this sizing declares '
+                + input.peak_concurrency + ' peak concurrent users')
+            : ok('no users declared: a prototype may keep its state in memory'),
+    },
+    {
+        id: 'memory-write-through',
+        axis: 'state_residency',
+        label: 'Resident working set + write-through to the database',
+        what: 'Reads are synchronous off an in-process copy; every write also goes '
+            + 'to the database. Boot rehydrates the whole set.',
+        envelope: ({ derived }) => {
+            if (derived.unbounded) {
+                return no('inadmissible while any data class is kept forever ('
+                    + derived.unbounded_classes.join(', ') + '): a resident set with no bound has no ceiling. '
+                    + 'Declare retention per class first, or choose sql-async');
+            }
+            if (derived.heap_pct_if_resident >= RESIDENT_HEAP_PCT_MAX) {
+                return no('the live set would be ' + derived.heap_mb_if_resident + ' MB = '
+                    + derived.heap_pct_if_resident + '% of the ' + 'declared heap ceiling (max allowed: '
+                    + RESIDENT_HEAP_PCT_MAX + '%)');
+            }
+            return ok('bounded by retention and ' + derived.heap_pct_if_resident
+                + '% of the heap ceiling, under the ' + RESIDENT_HEAP_PCT_MAX + '% limit');
+        },
+    },
+    {
+        id: 'sql-async',
+        axis: 'state_residency',
+        label: 'Database only, asynchronous reads',
+        what: 'No in-process copy. Every read is an indexed query; the database '
+            + 'buffer pool is the cache. The default.',
+        envelope: () => ok('always admissible: growth lands on disk, not on the heap'),
+    },
+    {
+        id: 'sql-plus-narrow-cache',
+        axis: 'state_residency',
+        label: 'Database only, plus ONE narrow cache',
+        what: 'sql-async plus a cache for a single measured hot read, with '
+            + 'explicit invalidation.',
+        envelope: ({ input }) => (input.measured_hotspot || '').trim().length > 0
+            ? ok('justified by a measurement: ' + (input.measured_hotspot || '').trim())
+            : no('inadmissible without a measurement naming the hot read '
+                + '(set measured_hotspot); a cache added on a hunch buys a second source of truth for nothing'),
+    },
+    /* ---------------- pagination ---------------- */
+    {
+        id: 'in-memory-slice',
+        axis: 'pagination',
+        label: 'Slice an already materialised collection',
+        what: 'Load the collection, filter, sort, then slice the page.',
+        envelope: ({ derived }) => {
+            if (derived.unbounded) {
+                return no('inadmissible while a data class is unbounded: the slice protects the wire, not the server');
+            }
+            if (derived.rows_at_horizon > IN_MEMORY_PAGE_ROWS_MAX) {
+                return no(derived.rows_at_horizon + ' rows at the horizon exceeds the '
+                    + IN_MEMORY_PAGE_ROWS_MAX + '-row limit for materialising before slicing');
+            }
+            return ok('the collection stays under ' + IN_MEMORY_PAGE_ROWS_MAX + ' rows');
+        },
+    },
+    {
+        id: 'sql-limit-offset',
+        axis: 'pagination',
+        label: 'LIMIT / OFFSET with COUNT(*)',
+        what: 'The database produces the page and the total.',
+        envelope: () => ok('always admissible'),
+    },
+    {
+        id: 'sql-keyset',
+        axis: 'pagination',
+        label: 'Keyset (seek) pagination',
+        what: 'Page by the last key seen. Constant cost at any depth.',
+        envelope: () => ok('always admissible, and the right default past a few hundred thousand rows'),
+    },
+    /* ---------------- retention ---------------- */
+    {
+        id: 'retention-none',
+        axis: 'retention',
+        label: 'Keep everything, forever',
+        what: 'Nothing is ever deleted.',
+        envelope: ({ derived, choices }) => {
+            const residency = choices.state_residency;
+            if (residency === 'memory-only' || residency === 'memory-write-through') {
+                return no('inadmissible together with a resident working set: forever + in memory is a wall with a date on it');
+            }
+            if (derived.disk_pct_at_horizon > RETENTION_NONE_DISK_PCT_MAX) {
+                return no('would reach ' + derived.disk_gb_at_horizon + ' GB = '
+                    + derived.disk_pct_at_horizon + '% of the declared disk by the horizon (max allowed: '
+                    + RETENTION_NONE_DISK_PCT_MAX + '%)');
+            }
+            return ok('fits the disk with room: ' + derived.disk_pct_at_horizon + '% at the horizon');
+        },
+    },
+    {
+        id: 'retention-by-age',
+        axis: 'retention',
+        label: 'Delete by age, per data class',
+        what: 'Each class declares how long it is kept; a scheduled job deletes '
+            + 'past it, IN BULK (one statement per table, never row by row).',
+        envelope: ({ input }) => (input.retention.business_days > 0 || input.retention.trace_days > 0)
+            ? ok('at least one class declares a retention window')
+            : no('both classes are declared as kept forever, so this option decides nothing: '
+                + 'set business_days and/or trace_days'),
+    },
+    {
+        id: 'retention-by-age-and-count',
+        axis: 'retention',
+        label: 'Delete by age AND by row count',
+        what: 'Age window plus a hard cap per table, whichever hits first.',
+        /* Same precondition as retention-by-age, and for the same reason: this
+         * is a SUPERSET of it, so without a declared window there is no age to
+         * apply and the option would decide nothing while still passing the
+         * gate. Found by tests/sizing-gate.test.ts. Consequence, deliberate:
+         * with retention 0/0 the retention axis has NO admissible option, so a
+         * project cannot be sized at all until it declares what bounds each
+         * data class -- which is the ADIP-KIKAN lesson in one line. */
+        envelope: ({ input }) => (input.retention.business_days > 0 || input.retention.trace_days > 0)
+            ? ok('a window is declared, and the row cap is what survives a traffic spike')
+            : no('both classes are declared as kept forever: declare business_days and/or '
+                + 'trace_days first -- with nothing bounded there is no age to delete by'),
+    },
+    /* ---------------- write_concurrency ---------------- */
+    {
+        id: 'implicit-single-thread',
+        axis: 'write_concurrency',
+        label: 'Implicit: the runtime is single threaded',
+        what: 'No transactions. Atomicity comes from nothing being able to '
+            + 'interleave between two synchronous statements.',
+        envelope: ({ input, choices }) => {
+            const residency = choices.state_residency;
+            const memoryResident = residency === 'memory-only' || residency === 'memory-write-through';
+            if (!memoryResident) {
+                return no('inadmissible once reads are asynchronous: an await between a check and its write '
+                    + 'lets a second request through, and every check-then-act becomes a race');
+            }
+            if (input.peak_concurrency > 1) {
+                return no('inadmissible with ' + input.peak_concurrency + ' concurrent users: the guarantee is '
+                    + 'implicit, undocumented, and nobody can see it in the code');
+            }
+            return ok('single user and a synchronous resident store: the guarantee holds, but write it down');
+        },
+    },
+    {
+        id: 'explicit-transactions',
+        axis: 'write_concurrency',
+        label: 'Explicit transactions',
+        what: 'Every multi-step mutation runs inside BEGIN / COMMIT. No '
+            + 'transaction is held across an external call.',
+        envelope: () => ok('always admissible'),
+    },
+    {
+        id: 'unique-keys-and-upsert',
+        axis: 'write_concurrency',
+        label: 'Natural UNIQUE keys plus upsert',
+        what: 'Idempotency enforced by the database (UNIQUE on the natural key + '
+            + 'INSERT ... ON DUPLICATE KEY) instead of check-then-act.',
+        envelope: () => ok('always admissible, and the only correct fix for a check-then-act race'),
+    },
+];
+export function optionsForAxis(axis) {
+    return OPTIONS.filter((o) => o.axis === axis);
+}
+export function findOption(id) {
+    return OPTIONS.find((o) => o.id === id);
+}
+/**
+ * Reject an input that decides nothing. A record of zeros would otherwise
+ * pass every envelope and the gate would become a formality -- which is
+ * exactly the failure mode being fixed, one level up.
+ */
+export function validateInput(input) {
+    const errs = [];
+    if (!Array.isArray(input.entities) || input.entities.length === 0) {
+        errs.push('entities: declare at least one business entity with its count and event rate');
+    }
+    else {
+        input.entities.forEach((e, i) => {
+            const at = 'entities[' + i + ']';
+            if (!e.name || !e.name.trim())
+                errs.push(at + '.name: required');
+            if (!(e.count > 0))
+                errs.push(at + '.count must be > 0');
+            if (!(e.events_per_year > 0))
+                errs.push(at + '.events_per_year must be > 0');
+            if (!(e.rows_per_event > 0)) {
+                errs.push(at + '.rows_per_event must be > 0 -- count EVERY table an event writes, '
+                    + 'not just the main one (in ADIP-KIKAN one event leaves ~17 rows)');
+            }
+        });
+    }
+    if (!(input.bytes_per_row > 0))
+        errs.push('bytes_per_row must be > 0 (retained bytes per row in the runtime)');
+    if (!(input.horizon_years > 0))
+        errs.push('horizon_years must be > 0');
+    if (!Number.isFinite(input.peak_concurrency) || input.peak_concurrency < 0) {
+        errs.push('peak_concurrency must be a number >= 0');
+    }
+    if (!input.retention || !Number.isFinite(input.retention.business_days) || !Number.isFinite(input.retention.trace_days)) {
+        errs.push('retention.business_days and retention.trace_days are required (0 means kept forever)');
+    }
+    const hw = input.hardware;
+    if (!hw) {
+        errs.push('hardware is required: ram_mb, heap_cap_mb, disk_gb, vcpus');
+    }
+    else {
+        if (!(hw.ram_mb > 0))
+            errs.push('hardware.ram_mb must be > 0');
+        if (!(hw.heap_cap_mb > 0)) {
+            errs.push('hardware.heap_cap_mb must be > 0 -- the RUNTIME heap ceiling '
+                + '(Node: node -e "console.log(require(\'v8\').getHeapStatistics().heap_size_limit)"), not the RAM of the machine');
+        }
+        if (hw.heap_cap_mb > hw.ram_mb) {
+            errs.push('hardware.heap_cap_mb (' + hw.heap_cap_mb + ') cannot exceed ram_mb (' + hw.ram_mb + ')');
+        }
+        if (!(hw.disk_gb > 0))
+            errs.push('hardware.disk_gb must be > 0');
+        if (!(hw.vcpus > 0))
+            errs.push('hardware.vcpus must be > 0');
+    }
+    if (input.trace_share !== undefined && (input.trace_share < 0 || input.trace_share > 1)) {
+        errs.push('trace_share must be between 0 and 1');
+    }
+    return errs;
+}
+/** The choice set this sizing admits, preferring the safest option. */
+export function recommend(input, derived) {
+    const base = {};
+    /* Residency first: other axes depend on it. */
+    base.state_residency = 'sql-async';
+    base.write_concurrency = 'explicit-transactions';
+    base.retention = derived.unbounded || derived.disk_pct_at_horizon > RETENTION_NONE_DISK_PCT_MAX
+        ? 'retention-by-age'
+        : 'retention-none';
+    base.pagination = derived.rows_at_horizon > IN_MEMORY_PAGE_ROWS_MAX || derived.unbounded
+        ? (derived.rows_at_horizon > 1_000_000 ? 'sql-keyset' : 'sql-limit-offset')
+        : 'sql-limit-offset';
+    void input;
+    return base;
+}
+/**
+ * Validate a full choice set. Fail-closed on every axis: an axis with no
+ * choice, an unknown option, or an option outside its envelope all fail.
+ */
+export function validateChoices(input, choices) {
+    const inputErrors = validateInput(input);
+    const derived = derive(input);
+    const ctx = { input, derived, choices };
+    const axes = AXES.map((axis) => {
+        const admissible = optionsForAxis(axis)
+            .filter((o) => o.envelope(ctx).ok)
+            .map((o) => o.id);
+        const chosen = choices[axis];
+        if (!chosen) {
+            return { axis, ok: false, reason: 'axis not decided; admissible: ' + (admissible.join(', ') || 'none'), admissible };
+        }
+        const opt = findOption(chosen);
+        if (!opt || opt.axis !== axis) {
+            return {
+                axis, chosen, ok: false,
+                reason: 'unknown option "' + chosen + '" for this axis; valid ids: '
+                    + optionsForAxis(axis).map((o) => o.id).join(', '),
+                admissible,
+            };
+        }
+        const v = opt.envelope(ctx);
+        return { axis, chosen, ok: v.ok, reason: v.reason, admissible };
+    });
+    return {
+        ok: inputErrors.length === 0 && axes.every((a) => a.ok),
+        derived,
+        axes,
+        input_errors: inputErrors,
+        recommended: recommend(input, derived),
+    };
+}
+/* ------------------------------------------------------------------ *
+ * Rendering (shared by the verb result, the gate and the prompt)
+ * ------------------------------------------------------------------ */
+export function renderDerived(d) {
+    return [
+        'rows/year: ' + d.rows_per_year.toLocaleString('en-US'),
+        'rows at horizon: ' + d.rows_at_horizon.toLocaleString('en-US'),
+        'live rows after retention: ' + d.live_rows.toLocaleString('en-US')
+            + ' (business ' + d.live_business_rows.toLocaleString('en-US')
+            + ', trace ' + d.live_trace_rows.toLocaleString('en-US') + ')',
+        'resident heap if in memory: ' + d.heap_mb_if_resident + ' MB = ' + d.heap_pct_if_resident + '% of the ceiling',
+        'disk at horizon: ' + d.disk_gb_at_horizon + ' GB = ' + d.disk_pct_at_horizon + '% of the disk',
+        'unbounded classes: ' + (d.unbounded ? d.unbounded_classes.join(', ') : 'none'),
+    ];
+}
+//# sourceMappingURL=model.js.map

package/dist/sizing/model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.js","sourceRoot":"","sources":["../../src/sizing/model.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AAiGH,qEAAqE;AACrE,MAAM,oBAAoB,GAAG,GAAG,CAAC;AAEjC,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B,MAAM,UAAU,MAAM,CAAC,KAAkB;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC;IACpD,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CACvC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,EACrF,CAAC,CACF,CAAC;IACF,MAAM,aAAa,GAAG,WAAW,GAAG,KAAK,CAAC;IAE1C,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAC9C,MAAM,aAAa,GAAG,CAAC,GAAG,UAAU,CAAC;IAErC,2EAA2E;IAC3E,MAAM,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC,aAAa,GAAG,CAAC;QACrD,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,aAAa,GAAG,aAAa,CAAC;QAChE,CAAC,CAAC,KAAK,CAAC;IACV,MAAM,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC;QAC/C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,aAAa,CAAC;QAC7D,CAAC,CAAC,KAAK,CAAC;IAEV,MAAM,YAAY,GAAG,WAAW,GAAG,aAAa,GAAG,aAAa,CAAC;IACjE,MAAM,SAAS,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,CAAC;IACxD,MAAM,QAAQ,GAAG,YAAY,GAAG,SAAS,CAAC;IAE1C,MAAM,MAAM,GAAG,CAAC,QAAQ,GAAG,CAAC,KAAK,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;IACvE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,CAAC,QAAQ,GAAG,CAAC,KAAK,CAAC,aAAa,IAAI,CAAC,CAAC,GAAG,oBAAoB,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;IACrG,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;IAEzD,MAAM,gBAAgB,GAAa,EAAE,CAAC;IACtC,IAAI,KAAK,CAAC,SAAS,CAAC,aAAa,IAAI,CAAC,IAAI,aAAa,GAAG,CAAC;QAAE,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC/F,IAAI,KAAK,CAAC,SAAS,CAAC,UAAU,IAAI,CAAC,IAAI,UAAU,GAAG,CAAC;QAAE,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAEtF,OAAO;QACL,aAAa,EAAE,KAAK,CAAC,WAAW,CAAC;QACjC,eAAe,EAAE,KAAK,CAAC,aAAa,CAAC;QACrC,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC;QAC1B,kBAAkB,EAAE,KAAK,CAAC,YAAY,CAAC;QACvC,eAAe,EAAE,KAAK,CAAC,SAAS,CAAC;QACjC,mBAAmB,EAAE,MAAM,CAAC,MAAM,CAAC;QACnC,oBAAoB,EAAE,MAAM,CAAC,CAAC,MAAM,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC;QACtD,kBAAkB,EAAE,MAAM,CAAC,MAAM,CAAC;QAClC,mBAAmB,EAAE,MAAM,CAAC,CAAC,MAAM,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC;QACrD,SAAS,EAAE,gBAAgB,CAAC,MAAM,GAAG,CAAC;QACtC,iBAAiB,EAAE,gBAAgB;KACpC,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AACD,SAAS,KAAK,CAAC,CAAS;IACtB,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AACD,SAAS,MAAM,CAAC,CAAS;IACvB,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;wEAEwE;AAExE,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,iBAAiB,EAAE,YAAY,EAAE,WAAW,EAAE,mBAAmB,CAAU,CAAC;AAGjG,MAAM,CAAC,MAAM,UAAU,GAAyB;IAC9C,eAAe,EAAE,6BAA6B;IAC9C,UAAU,EAAE,6BAA6B;IACzC,SAAS,EAAE,6BAA6B;IACxC,iBAAiB,EAAE,yCAAyC;CAC7D,CAAC;AA0BF;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAExC,uEAAuE;AACvE,MAAM,CAAC,MAAM,uBAAuB,GAAG,OAAO,CAAC;AAE/C,oFAAoF;AACpF,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC;AAE9C,MAAM,EAAE,GAAG,CAAC,MAAc,EAAmB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;AACvE,MAAM,EAAE,GAAG,CAAC,MAAc,EAAmB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;AAExE,MAAM,CAAC,MAAM,OAAO,GAA0B;IAC5C,uDAAuD;IACvD;QACE,EAAE,EAAE,aAAa;QACjB,IAAI,EAAE,iBAAiB;QACvB,KAAK,EAAE,0BAA0B;QACjC,IAAI,EAAE,mDAAmD;QACzD,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CACtB,KAAK,CAAC,gBAAgB,GAAG,CAAC;YACxB,CAAC,CAAC,EAAE,CAAC,gGAAgG;kBAC/F,KAAK,CAAC,gBAAgB,GAAG,wBAAwB,CAAC;YACxD,CAAC,CAAC,EAAE,CAAC,6DAA6D,CAAC;KACxE;IACD;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,iBAAiB;QACvB,KAAK,EAAE,sDAAsD;QAC7D,IAAI,EACF,sEAAsE;cACpE,iDAAiD;QACrD,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;YACxB,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;gBACtB,OAAO,EAAE,CAAC,qDAAqD;sBAC3D,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,kDAAkD;sBACzF,wDAAwD,CAAC,CAAC;YAChE,CAAC;YACD,IAAI,OAAO,CAAC,oBAAoB,IAAI,qBAAqB,EAAE,CAAC;gBAC1D,OAAO,EAAE,CAAC,wBAAwB,GAAG,OAAO,CAAC,mBAAmB,GAAG,QAAQ;sBACvE,OAAO,CAAC,oBAAoB,GAAG,WAAW,GAAG,sCAAsC;sBACnF,qBAAqB,GAAG,IAAI,CAAC,CAAC;YACpC,CAAC;YACD,OAAO,EAAE,CAAC,2BAA2B,GAAG,OAAO,CAAC,oBAAoB;kBAChE,mCAAmC,GAAG,qBAAqB,GAAG,SAAS,CAAC,CAAC;QAC/E,CAAC;KACF;IACD;QACE,EAAE,EAAE,WAAW;QACf,IAAI,EAAE,iBAAiB;QACvB,KAAK,EAAE,mCAAmC;QAC1C,IAAI,EACF,mEAAmE;cACjE,wCAAwC;QAC5C,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,0DAA0D,CAAC;KAC/E;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,iBAAiB;QACvB,KAAK,EAAE,sCAAsC;QAC7C,IAAI,EACF,8DAA8D;cAC5D,wBAAwB;QAC5B,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CACtB,CAAC,KAAK,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;YAC9C,CAAC,CAAC,EAAE,CAAC,8BAA8B,GAAG,CAAC,KAAK,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YAC5E,CAAC,CAAC,EAAE,CAAC,yDAAyD;kBACxD,4FAA4F,CAAC;KACxG;IAED,kDAAkD;IAClD;QACE,EAAE,EAAE,iBAAiB;QACrB,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,0CAA0C;QACjD,IAAI,EAAE,yDAAyD;QAC/D,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;YACxB,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;gBACtB,OAAO,EAAE,CAAC,2FAA2F,CAAC,CAAC;YACzG,CAAC;YACD,IAAI,OAAO,CAAC,eAAe,GAAG,uBAAuB,EAAE,CAAC;gBACtD,OAAO,EAAE,CAAC,OAAO,CAAC,eAAe,GAAG,mCAAmC;sBACnE,uBAAuB,GAAG,6CAA6C,CAAC,CAAC;YAC/E,CAAC;YACD,OAAO,EAAE,CAAC,6BAA6B,GAAG,uBAAuB,GAAG,OAAO,CAAC,CAAC;QAC/E,CAAC;KACF;IACD;QACE,EAAE,EAAE,kBAAkB;QACtB,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,8BAA8B;QACrC,IAAI,EAAE,+CAA+C;QACrD,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,mBAAmB,CAAC;KACxC;IACD;QACE,EAAE,EAAE,YAAY;QAChB,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,0BAA0B;QACjC,IAAI,EAAE,wDAAwD;QAC9D,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,2EAA2E,CAAC;KAChG;IAED,iDAAiD;IACjD;QACE,EAAE,EAAE,gBAAgB;QACpB,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,0BAA0B;QACjC,IAAI,EAAE,0BAA0B;QAChC,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE;YACjC,MAAM,SAAS,GAAG,OAAO,CAAC,eAAe,CAAC;YAC1C,IAAI,SAAS,KAAK,aAAa,IAAI,SAAS,KAAK,sBAAsB,EAAE,CAAC;gBACxE,OAAO,EAAE,CAAC,oGAAoG,CAAC,CAAC;YAClH,CAAC;YACD,IAAI,OAAO,CAAC,mBAAmB,GAAG,2BAA2B,EAAE,CAAC;gBAC9D,OAAO,EAAE,CAAC,cAAc,GAAG,OAAO,CAAC,kBAAkB,GAAG,QAAQ;sBAC5D,OAAO,CAAC,mBAAmB,GAAG,sDAAsD;sBACpF,2BAA2B,GAAG,IAAI,CAAC,CAAC;YAC1C,CAAC;YACD,OAAO,EAAE,CAAC,2BAA2B,GAAG,OAAO,CAAC,mBAAmB,GAAG,kBAAkB,CAAC,CAAC;QAC5F,CAAC;KACF;IACD;QACE,EAAE,EAAE,kBAAkB;QACtB,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,+BAA+B;QACtC,IAAI,EACF,mEAAmE;cACjE,+DAA+D;QACnE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CACtB,CAAC,KAAK,CAAC,SAAS,CAAC,aAAa,GAAG,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC,CAAC;YACnE,CAAC,CAAC,EAAE,CAAC,gDAAgD,CAAC;YACtD,CAAC,CAAC,EAAE,CAAC,6EAA6E;kBAC5E,qCAAqC,CAAC;KACjD;IACD;QACE,EAAE,EAAE,4BAA4B;QAChC,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,gCAAgC;QACvC,IAAI,EAAE,6DAA6D;QACnE;;;;;;uEAM+D;QAC/D,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CACtB,CAAC,KAAK,CAAC,SAAS,CAAC,aAAa,GAAG,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC,CAAC;YACnE,CAAC,CAAC,EAAE,CAAC,wEAAwE,CAAC;YAC9E,CAAC,CAAC,EAAE,CAAC,0EAA0E;kBACzE,uEAAuE,CAAC;KACnF;IAED,yDAAyD;IACzD;QACE,EAAE,EAAE,wBAAwB;QAC5B,IAAI,EAAE,mBAAmB;QACzB,KAAK,EAAE,0CAA0C;QACjD,IAAI,EACF,8DAA8D;cAC5D,gDAAgD;QACpD,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE;YAC/B,MAAM,SAAS,GAAG,OAAO,CAAC,eAAe,CAAC;YAC1C,MAAM,cAAc,GAAG,SAAS,KAAK,aAAa,IAAI,SAAS,KAAK,sBAAsB,CAAC;YAC3F,IAAI,CAAC,cAAc,EAAE,CAAC;gBACpB,OAAO,EAAE,CAAC,mFAAmF;sBACzF,wEAAwE,CAAC,CAAC;YAChF,CAAC;YACD,IAAI,KAAK,CAAC,gBAAgB,GAAG,CAAC,EAAE,CAAC;gBAC/B,OAAO,EAAE,CAAC,oBAAoB,GAAG,KAAK,CAAC,gBAAgB,GAAG,sCAAsC;sBAC5F,2DAA2D,CAAC,CAAC;YACnE,CAAC;YACD,OAAO,EAAE,CAAC,sFAAsF,CAAC,CAAC;QACpG,CAAC;KACF;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,mBAAmB;QACzB,KAAK,EAAE,uBAAuB;QAC9B,IAAI,EACF,2DAA2D;cACzD,8CAA8C;QAClD,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,mBAAmB,CAAC;KACxC;IACD;QACE,EAAE,EAAE,wBAAwB;QAC5B,IAAI,EAAE,mBAAmB;QACzB,KAAK,EAAE,iCAAiC;QACxC,IAAI,EACF,oEAAoE;cAClE,yDAAyD;QAC7D,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,uEAAuE,CAAC;KAC5F;CACF,CAAC;AAEF,MAAM,UAAU,cAAc,CAAC,IAAU;IACvC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,EAAU;IACnC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;AAC1C,CAAC;AAyBD;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAAkB;IAC9C,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClE,IAAI,CAAC,IAAI,CAAC,8EAA8E,CAAC,CAAC;IAC5F,CAAC;SAAM,CAAC;QACN,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC9B,MAAM,EAAE,GAAG,WAAW,GAAG,CAAC,GAAG,GAAG,CAAC;YACjC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,iBAAiB,CAAC,CAAC;YACjE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,oBAAoB,CAAC,CAAC;YACzD,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,8BAA8B,CAAC,CAAC;YAC7E,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC5B,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,oEAAoE;sBAC/E,iEAAiE,CAAC,CAAC;YACzE,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IACD,IAAI,CAAC,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,mEAAmE,CAAC,CAAC;IAC/G,IAAI,CAAC,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IACvE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,KAAK,CAAC,gBAAgB,GAAG,CAAC,EAAE,CAAC;QAC3E,IAAI,CAAC,IAAI,CAAC,wCAAwC,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC;QACxH,IAAI,CAAC,IAAI,CAAC,sFAAsF,CAAC,CAAC;IACpG,CAAC;IACD,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC;IAC1B,IAAI,CAAC,EAAE,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;IACzE,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;QAC/D,IAAI,CAAC,CAAC,EAAE,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,+DAA+D;kBACrE,gHAAgH,CAAC,CAAC;QACxH,CAAC;QACD,IAAI,EAAE,CAAC,WAAW,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,wBAAwB,GAAG,EAAE,CAAC,WAAW,GAAG,0BAA0B,GAAG,EAAE,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;QACtG,CAAC;QACD,IAAI,CAAC,CAAC,EAAE,CAAC,OAAO,GAAG,CAAC,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;QACjE,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;IAC/D,CAAC;IACD,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,IAAI,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC;QACxF,IAAI,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,SAAS,CAAC,KAAkB,EAAE,OAAgB;IAC5D,MAAM,IAAI,GAAkC,EAAE,CAAC;IAC/C,+CAA+C;IAC/C,IAAI,CAAC,eAAe,GAAG,WAAW,CAAC;IACnC,IAAI,CAAC,iBAAiB,GAAG,uBAAuB,CAAC;IACjD,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,mBAAmB,GAAG,2BAA2B;QAC7F,CAAC,CAAC,kBAAkB;QACpB,CAAC,CAAC,gBAAgB,CAAC;IACrB,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,eAAe,GAAG,uBAAuB,IAAI,OAAO,CAAC,SAAS;QACtF,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,GAAG,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,kBAAkB,CAAC;QAC3E,CAAC,CAAC,kBAAkB,CAAC;IACvB,KAAK,KAAK,CAAC;IACX,OAAO,IAA4B,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAkB,EAClB,OAAsC;IAEtC,MAAM,WAAW,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAgB,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;IAErD,MAAM,IAAI,GAAkB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QAC5C,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC;aACpC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;aACjC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpB,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,gCAAgC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC;QACvH,CAAC;QACD,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC9B,OAAO;gBACL,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK;gBACvB,MAAM,EAAE,kBAAkB,GAAG,MAAM,GAAG,8BAA8B;sBAChE,cAAc,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACpD,UAAU;aACX,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC5B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,EAAE,EAAE,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvD,OAAO;QACP,IAAI;QACJ,YAAY,EAAE,WAAW;QACzB,WAAW,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC;KACvC,CAAC;AACJ,CAAC;AAED;;wEAEwE;AAExE,MAAM,UAAU,aAAa,CAAC,CAAU;IACtC,OAAO;QACL,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,cAAc,CAAC,OAAO,CAAC;QACvD,mBAAmB,GAAG,CAAC,CAAC,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC;QAC/D,6BAA6B,GAAG,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,OAAO,CAAC;cAC/D,aAAa,GAAG,CAAC,CAAC,kBAAkB,CAAC,cAAc,CAAC,OAAO,CAAC;cAC5D,UAAU,GAAG,CAAC,CAAC,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG,GAAG;QAChE,8BAA8B,GAAG,CAAC,CAAC,mBAAmB,GAAG,QAAQ,GAAG,CAAC,CAAC,oBAAoB,GAAG,kBAAkB;QAC/G,mBAAmB,GAAG,CAAC,CAAC,kBAAkB,GAAG,QAAQ,GAAG,CAAC,CAAC,mBAAmB,GAAG,eAAe;QAC/F,qBAAqB,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;KAChF,CAAC;AACJ,CAAC"}

package/dist/sizing/store.d.ts

@@ -0,0 +1,114 @@
+import { type Axis, type SizingInput, type SizingVerdict } from './model.js';
+export interface SizingRevision {
+    at: string;
+    /** Who recorded it: a session id, 'owner', or the verb caller. */
+    by: string;
+    /** One line on what changed and why. Mandatory: a silent re-sizing
+     *  is how a wrong number survives a year. */
+    note: string;
+    input: SizingInput;
+    choices: Record<Axis, string>;
+}
+export interface SizingRecord {
+    version: 1;
+    project_slug: string;
+    updated_at: string;
+    input: SizingInput;
+    choices: Record<Axis, string>;
+    /** Free text: the owner's reasoning, kept for the next reader. */
+    rationale?: string;
+    /**
+     * When a surface stopped being a prototype. Once set, the gate applies
+     * outside any workflow. ISO date.
+     */
+    load_bearing_since?: string;
+    /** Every previous recording, newest last. Never pruned: the history IS
+     *  the audit trail of how the sizing drifted. */
+    revisions: SizingRevision[];
+}
+export declare function readSizing(project_slug: string): Promise<SizingRecord | undefined>;
+export declare function writeSizing(rec: SizingRecord): Promise<void>;
+export interface RecordSizingInput {
+    project_slug: string;
+    input: SizingInput;
+    choices: Partial<Record<Axis, string>>;
+    note: string;
+    by?: string;
+    rationale?: string;
+    load_bearing_since?: string;
+}
+export interface RecordSizingResult {
+    ok: boolean;
+    verdict: SizingVerdict;
+    /** Set only when ok: the record as persisted. */
+    record?: SizingRecord;
+    /** Set when !ok: nothing was written. */
+    refused?: string;
+}
+/**
+ * Record a sizing. REFUSES to persist a choice set that is outside its
+ * envelope, so the file on disk can only ever hold an admissible sizing.
+ *
+ * That is deliberate and it is the whole mechanism: if an inadmissible
+ * sizing could be stored with a warning, the gate downstream would have
+ * to decide whether to believe it, and "decide whether to believe it" is
+ * exactly the judgement call the brain talks its way out of.
+ */
+export declare function recordSizing(inp: RecordSizingInput): Promise<RecordSizingResult>;
+export type SizingGateState = 'ok' | 'missing' | 'stale' | 'not_required';
+export interface SizingGateResult {
+    state: SizingGateState;
+    ok: boolean;
+    /** One line for the refusal message / the prompt. */
+    reason: string;
+    /** Present when a record exists. */
+    verdict?: SizingVerdict;
+    record?: SizingRecord;
+}
+/**
+ * Evaluate the gate for a project.
+ *
+ * `construction` is true when the caller is about to enter (or is in) the
+ * construction stage of a workflow. Outside construction the gate still
+ * applies once `load_bearing_since` is set -- that is the prototype
+ * trigger from the header.
+ */
+export declare function sizingGate(project_slug: string, opts?: {
+    construction?: boolean;
+}): Promise<SizingGateResult>;
+export interface ObservedVolume {
+    /** Rows actually counted, per table or in total. */
+    rows_total: number;
+    /** Bytes actually retained per row, if measured. */
+    bytes_per_row?: number;
+    /** Over how many days those rows accumulated. */
+    over_days: number;
+    /** Where the numbers came from. Required: an unsourced number is a guess. */
+    source: string;
+}
+export interface DriftResult {
+    ok: boolean;
+    /** Declared rows/year vs the rate the observation implies. */
+    declared_rows_per_year: number;
+    observed_rows_per_year: number;
+    ratio: number;
+    /** Beyond this the sizing has to be redone. */
+    threshold: number;
+    verdict: string;
+    /** The gate verdict recomputed with the OBSERVED rate substituted in. */
+    with_observed?: SizingVerdict;
+}
+/** Past this ratio between observed and declared, the sizing is wrong
+ *  enough that the architecture choice has to be re-validated. 2x and not
+ *  10x because the point is to catch it in month 2, not month 12. */
+export declare const DRIFT_THRESHOLD = 2;
+/**
+ * Compare a real measurement against the declared sizing, and -- this is
+ * the useful part -- re-run the envelopes with the OBSERVED rate
+ * substituted in. The answer is not "you were 3x off", it is "at the rate
+ * you actually have, the architecture you chose is no longer admissible".
+ */
+export declare function checkDrift(project_slug: string, observed: ObservedVolume): Promise<DriftResult & {
+    record?: SizingRecord;
+}>;
+//# sourceMappingURL=store.d.ts.map

package/dist/sizing/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/sizing/store.ts"],"names":[],"mappings":"AAiCA,OAAO,EACL,KAAK,IAAI,EAAE,KAAK,WAAW,EAAE,KAAK,aAAa,EAEhD,MAAM,YAAY,CAAC;AA6BpB,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,kEAAkE;IAClE,EAAE,EAAE,MAAM,CAAC;IACX;iDAC6C;IAC7C,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,WAAW,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;CAC/B;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,CAAC,CAAC;IACX,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,WAAW,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC9B,kEAAkE;IAClE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;OAGG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B;qDACiD;IACjD,SAAS,EAAE,cAAc,EAAE,CAAC;CAC7B;AAED,wBAAsB,UAAU,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,GAAG,SAAS,CAAC,CAUxF;AAED,wBAAsB,WAAW,CAAC,GAAG,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAQlE;AAED,MAAM,WAAW,iBAAiB;IAChC,YAAY,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE,WAAW,CAAC;IACnB,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,EAAE,aAAa,CAAC;IACvB,iDAAiD;IACjD,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,yCAAyC;IACzC,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;GAQG;AACH,wBAAsB,YAAY,CAAC,GAAG,EAAE,iBAAiB,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAsCtF;AAMD,MAAM,MAAM,eAAe,GACvB,IAAI,GACJ,SAAS,GACT,OAAO,GACP,cAAc,CAAC;AAEnB,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,eAAe,CAAC;IACvB,EAAE,EAAE,OAAO,CAAC;IACZ,qDAAqD;IACrD,MAAM,EAAE,MAAM,CAAC;IACf,oCAAoC;IACpC,OAAO,CAAC,EAAE,aAAa,CAAC;IACxB,MAAM,CAAC,EAAE,YAAY,CAAC;CACvB;AAED;;;;;;;GAOG;AACH,wBAAsB,UAAU,CAC9B,YAAY,EAAE,MAAM,EACpB,IAAI,GAAE;IAAE,YAAY,CAAC,EAAE,OAAO,CAAA;CAAO,GACpC,OAAO,CAAC,gBAAgB,CAAC,CA4C3B;AAMD,MAAM,WAAW,cAAc;IAC7B,oDAAoD;IACpD,UAAU,EAAE,MAAM,CAAC;IACnB,oDAAoD;IACpD,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,iDAAiD;IACjD,SAAS,EAAE,MAAM,CAAC;IAClB,6EAA6E;IAC7E,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,OAAO,CAAC;IACZ,8DAA8D;IAC9D,sBAAsB,EAAE,MAAM,CAAC;IAC/B,sBAAsB,EAAE,MAAM,CAAC;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,+CAA+C;IAC/C,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,yEAAyE;IACzE,aAAa,CAAC,EAAE,aAAa,CAAC;CAC/B;AAED;;qEAEqE;AACrE,eAAO,MAAM,eAAe,IAAI,CAAC;AAEjC;;;;;GAKG;AACH,wBAAsB,UAAU,CAC9B,YAAY,EAAE,MAAM,EACpB,QAAQ,EAAE,cAAc,GACvB,OAAO,CAAC,WAAW,GAAG;IAAE,MAAM,CAAC,EAAE,YAAY,CAAA;CAAE,CAAC,CAiDlD"}