pi-mega-compact 0.20.13 → 0.20.15

package/dist/vector-cortex/migrations/request-hash-v2-ops.js

@@ -0,0 +1,143 @@
+/**
+ * request-hash-v2-ops.ts — M5 migration operational logic (copy/verify/switch).
+ *
+ * Extracted from request-hash-v2.ts to keep the parent file under the 300-line
+ * soft limit (soft-as-hard gate). Pure logic over an injected M5Host;
+ * deterministic + testable; no console. PREVENT-002/011/PI-004 honored.
+ */
+import { createHash } from "node:crypto";
+import { invalidationKey } from "../topology/query.js";
+import { M5_FAIL, REQUEST_HASH_LEGACY_VERSION, } from "./request-hash-v2-types.js";
+/** Length-prefixed framing so the folded fields cannot alias. */
+function field(value) {
+    return `${Buffer.byteLength(value, "utf8")}:${value}`;
+}
+const identity = (profileId, requestDigest) => `${profileId}::${requestDigest}`;
+/**
+ * The authoritative v2 hash: SHA-256 over the version tag, profile, request
+ * digest, and economics version. Length-prefixed for injectivity, exactly as the
+ * crystal key encoder frames its fields.
+ */
+export function deriveRequestHashV2(profileId, requestDigest, economicsVersion) {
+    return createHash("sha256")
+        .update(field("request-hash-v2") +
+        field(profileId) +
+        field(requestDigest) +
+        field(economicsVersion), "utf8")
+        .digest("hex");
+}
+/** Derive the v2 row for one v1 row. */
+export function deriveRequestHashRow(host, v1) {
+    const economicsVersion = host.economicsVersionOf(v1.profileId);
+    return {
+        profileId: v1.profileId,
+        // IDENTITY-PRESERVING: carried through verbatim, never re-derived.
+        requestDigest: v1.requestDigest,
+        economicsVersion,
+        hash: deriveRequestHashV2(v1.profileId, v1.requestDigest, economicsVersion),
+    };
+}
+/**
+ * Economics versions encode the generation they were minted under. We treat the
+ * trailing numeric segment as the generation; if it is not numeric the row is
+ * considered tied to generation 0 (always live unless explicitly invalidated).
+ */
+function generationFromEconomics(economicsVersion) {
+    const match = /(\d+)$/.exec(economicsVersion);
+    return match ? BigInt(match[1]) : 0n;
+}
+export function detectCollision(host) {
+    const byHash = new Map();
+    for (const v1 of host.v1Rows()) {
+        const row = deriveRequestHashRow(host, v1);
+        const prior = byHash.get(row.hash);
+        if (prior !== undefined &&
+            prior !== identity(v1.profileId, v1.requestDigest)) {
+            return true;
+        }
+        byHash.set(row.hash, identity(v1.profileId, v1.requestDigest));
+    }
+    return false;
+}
+export function isGenerationInvalidated(host, row) {
+    const session = host.sessionOf(row.profileId);
+    const live = host.liveGenerationOf(session);
+    const keyForLive = invalidationKey(session, live);
+    const keyForRow = invalidationKey(session, generationFromEconomics(row.economicsVersion));
+    return keyForLive !== keyForRow;
+}
+export function m5Copy(host) {
+    const existing = new Map(host.existingV2().map((r) => [identity(r.profileId, r.requestDigest), r]));
+    const wanted = [];
+    for (const v1 of host.v1Rows()) {
+        const fresh = deriveRequestHashRow(host, v1);
+        if (isGenerationInvalidated(host, fresh))
+            continue;
+        const stored = existing.get(identity(v1.profileId, v1.requestDigest));
+        if (stored !== undefined &&
+            stored.hash === fresh.hash &&
+            stored.economicsVersion === fresh.economicsVersion) {
+            continue;
+        }
+        wanted.push(fresh);
+    }
+    if (wanted.length > 0)
+        host.putV2(wanted);
+    return { written: wanted, all: [...host.existingV2()] };
+}
+function dedupe(codes) {
+    const out = [];
+    for (const c of codes)
+        if (!out.includes(c))
+            out.push(c);
+    return out;
+}
+export function m5Verify(host) {
+    const codes = [];
+    const stored = host.existingV2();
+    const v1Rows = host.v1Rows();
+    const counts = new Map();
+    for (const r of stored) {
+        const id = identity(r.profileId, r.requestDigest);
+        counts.set(id, (counts.get(id) ?? 0) + 1);
+    }
+    const expected = new Set();
+    for (const v1 of v1Rows) {
+        const id = identity(v1.profileId, v1.requestDigest);
+        expected.add(id);
+        const n = counts.get(id) ?? 0;
+        if (n === 0)
+            codes.push(M5_FAIL.COPY_PARTIAL);
+        if (n > 1)
+            codes.push(M5_FAIL.COUNT_MISMATCH);
+    }
+    const v1Digests = new Set(v1Rows.map((r) => identity(r.profileId, r.requestDigest)));
+    for (const r of stored) {
+        const fresh = deriveRequestHashV2(r.profileId, r.requestDigest, r.economicsVersion);
+        if (r.hash !== fresh)
+            codes.push(M5_FAIL.DIGEST_MISMATCH);
+        const id = identity(r.profileId, r.requestDigest);
+        if (!v1Digests.has(id)) {
+            codes.push(expected.size > 0 ? M5_FAIL.IDENTITY_DRIFT : M5_FAIL.COUNT_MISMATCH);
+        }
+    }
+    if (detectCollision(host))
+        codes.push(M5_FAIL.REQUEST_HASH_COLLISION);
+    return { ok: codes.length === 0, codes: dedupe(codes) };
+}
+export function m5Switch(host) {
+    if (host.activeVersion() !== REQUEST_HASH_LEGACY_VERSION) {
+        return { ok: false, codes: [M5_FAIL.NOT_ON_LEGACY] };
+    }
+    const verify = m5Verify(host);
+    if (!verify.ok)
+        return verify;
+    if (detectCollision(host))
+        return { ok: false, codes: [M5_FAIL.REQUEST_HASH_COLLISION] };
+    host.switchToV2();
+    return { ok: true, codes: [] };
+}
+export function migrateRequestHashV2(host) {
+    m5Copy(host);
+    return m5Switch(host);
+}

package/dist/vector-cortex/migrations/request-hash-v2-types.js

@@ -0,0 +1,30 @@
+/**
+ * request-hash-v2-types.ts — M5 request-hash-v2 migration types.
+ *
+ * Extracted from request-hash-v2.ts to keep the parent file under the 300-line
+ * soft limit (soft-as-hard gate). Pure type + constant definitions; no logic.
+ * PREVENT-002/011/PI-004 honored.
+ */
+/** The active-version value the v2 pointer is switched to. */
+export const REQUEST_HASH_V2_VERSION = 2;
+/** The legacy (predecessor) active version. */
+export const REQUEST_HASH_LEGACY_VERSION = 1;
+/** M5 failure codes. */
+export const M5_FAIL = {
+    COPY_PARTIAL: "M5_COPY_PARTIAL",
+    COUNT_MISMATCH: "M5_COUNT_MISMATCH",
+    DIGEST_MISMATCH: "M5_DIGEST_MISMATCH",
+    IDENTITY_DRIFT: "M5_IDENTITY_DRIFT",
+    /** Two distinct v1 rows map to the same v2 hash — blocks the switch. (VC7C) */
+    REQUEST_HASH_COLLISION: "M5_REQUEST_HASH_COLLISION",
+    /** The active pointer is not on v1; switching would be a no-op or a regression. */
+    NOT_ON_LEGACY: "M5_NOT_ON_LEGACY",
+};
+/**
+ * Registered M5 conformance IDs (M5-001..020). The acceptance test reads these
+ * rows from the v2 `migrations/` domain and asserts each returns its manifest
+ * bytes or exactly its listed failure code. Mirrors M6_IDS / M4_IDS.
+ */
+export const M5_IDS = Array.from({ length: 20 }, (_v, i) => `M5-${String(i + 1).padStart(3, "0")}`);
+/** Named M5 rows surfaced by the conformance corpus (mirrors M6_NAMED_IDS). */
+export const M5_NAMED_IDS = ["M5-COLLIDE-002"];

package/dist/vector-cortex/migrations/request-hash-v2.js

@@ -0,0 +1,56 @@
+/**
+ * vector-cortex/migrations/request-hash-v2.ts — M5 request-hash-v2 migration
+ * (COPY + VALIDATE + SWITCH).
+ *
+ * Delegate-shell: types + constants live in request-hash-v2-types.ts and the
+ * operational logic (copy/verify/switch/collision) lives in
+ * request-hash-v2-ops.ts. This file re-exports the public surface so callers
+ * import from a single module. Split to keep under the 300-line soft limit
+ * (soft-as-hard gate).
+ *
+ * M5 versions the canonical request hash: the predecessor hashed the outbound
+ * request under the v1 scheme; v2 folds in the provider profile's ECONOMICS
+ * version so a pricing/TTL/exclusion change cannot silently reuse a cache
+ * identity minted under different economics. Like M4/M6 it follows the
+ * copy/validate/switch contract:
+ *
+ *   - copy:     resumable per (profile, request) — an interrupted run resumes
+ *               without duplicate rows or active-pointer drift.
+ *   - validate: every v1 row has exactly one v2 row, every v2 digest re-hashes
+ *               from its own declared fields, the migration is IDENTITY-PRESERVING
+ *               (a v2 row carries the same `requestDigest` as its v1 source — v2
+ *               changes how a CACHE KEY is derived, never what the request IS), and
+ *               — the M5-specific invariant ADDED in VC7C — there are ZERO
+ *               collisions: no two distinct v1 rows may map to one v2 hash. A
+ *               collision (`M5_REQUEST_HASH_COLLISION`) means two different
+ *               conversations would share a cache key, the most dangerous outcome
+ *               in the subsystem, so it blocks the switch outright.
+ *   - switch:   ATOMICALLY flip the active pointer to v2 via `host.switchToV2()`.
+ *               VC7B deferred this; VC7C performs it — but ONLY after re-validating
+ *               against freshly-read host state at switch time.
+ *
+ * WHY THE COLLISION CHECK RUNS AT SWITCH TIME, NOT VALIDATE TIME. The brief's
+ * failure-injection contract is explicit: crash after M5 validation, inject a
+ * collision into host state, then resume — and the RESUMED run must detect
+ * `M5_REQUEST_HASH_COLLISION`. If the collision were detected only from the result
+ * of an earlier `m5Verify` call, the cached result would be replayed and the
+ * injected collision would be invisible. So `m5Switch` RE-READS the host (`v1Rows`,
+ * `existingV2`, `activeVersion`) and RE-RUNS the collision check against that live
+ * state. Validation is a precondition; the switch is the only place that proves the
+ * hazard is absent *right now*. This is the same resume-after-crash discipline as
+ * M4/M6: a migration that trusts a stale verification is a migration that loses
+ * data on restart.
+ *
+ * M6 INVALIDATION CONSUMPTION. A v2 request hash is only as trustworthy as the
+ * generation it was minted under. The switch consumes M6's structured invalidation
+ * keys via the REAL API (`invalidationKey` from `../topology/query.js`) rather than
+ * inventing one: when a v2 row's economics version maps to an invalidated router
+ * generation, that row cannot be promoted to active. We do not re-derive a
+ * generation here — topology is the authority on what generation is live — we only
+ * refuse to switch a row whose generation is dead. This keeps M5 from resurrecting
+ * cache identities tied to a generation the router has already invalidated.
+ *
+ * PREVENT-002/011/PI-004 honored.
+ */
+export { REQUEST_HASH_V2_VERSION, REQUEST_HASH_LEGACY_VERSION, M5_FAIL, M5_IDS, M5_NAMED_IDS, } from "./request-hash-v2-types.js";
+export { deriveRequestHashV2, deriveRequestHashRow, detectCollision, isGenerationInvalidated, m5Copy, m5Verify, m5Switch, migrateRequestHashV2, } from "./request-hash-v2-ops.js";

package/dist/vector-cortex/provider/economics-ids.js

@@ -0,0 +1,29 @@
+/**
+ * vector-cortex/provider/economics-ids.ts — VC7B conformance ID registrations.
+ *
+ * Extracted from economics.ts to keep that file under the 300-line soft limit
+ * (soft-as-hard gate). The ID ranges and named rows are pure data — splitting
+ * them out mirrors how vector-cortex-breakers.ts was extracted from
+ * vector-cortex.ts. economics.ts re-exports them so no consumer import path
+ * changes.
+ *
+ * Pi-agnostic, dependency-free (PREVENT-PI-004 / PREVENT-011).
+ */
+/**
+ * Registered VC7B cache-economics conformance ID range (CACHE-001..015). The
+ * acceptance aggregator reads these rows from the v2 manifest and asserts each
+ * returns its manifest `ok`/`code`.
+ */
+export const CACHE_IDS = Array.from({ length: 15 }, (_v, i) => `CACHE-${String(i + 1).padStart(3, "0")}`);
+/**
+ * Registered VC7B provider-economics conformance rows (PRO-024..030), continuing
+ * VC7A's PRO-016..023. These pin the ECONOMICS half of a provider profile:
+ * pricing validity, the exclusion-proof rule, and TTL/min-prefix eligibility.
+ */
+export const ECONOMICS_PROVIDER_IDS = Array.from({ length: 7 }, (_v, i) => `PRO-${String(i + 24).padStart(3, "0")}`);
+/** Named VC7B conformance assertions (the sprint's headline rows). */
+export const ECONOMICS_NAMED_IDS = [
+    "CACHE-COST-001",
+    "CACHE-EXCLUDE-002",
+    "CACHE-RANDOM-003",
+];

package/dist/vector-cortex/provider/economics.js

@@ -0,0 +1,176 @@
+/**
+ * vector-cortex/provider/economics.ts — VC7B cache economics (ProviderProfileV1
+ * extension).
+ *
+ * VC7A proved a render can be FROZEN and reused. VC7B answers the question that
+ * immediately follows: is reusing it actually WORTH IT? Provider prompt caching
+ * is not free — a cache WRITE typically costs MORE than an uncached token, and a
+ * cache READ costs less. So a cache is profitable only when a written prefix is
+ * read back enough times, before its TTL expires, to repay the write premium.
+ * This file is that arithmetic and nothing else.
+ *
+ * THE NET-SAVINGS MODEL. For a prefix of `cachedTokens` tokens:
+ *
+ *   baseline (no cache) = cachedTokens * basePrice * (writes + hits)
+ *   actual (cached)     = cachedTokens * (writePrice * writes + readPrice * hits)
+ *   netSavings          = baseline - actual
+ *
+ * A NEGATIVE `netSavings` is a real, expected, and important outcome: it means
+ * the cache LOST money (a prefix written once and never re-read always does, by
+ * exactly the write premium). We report it rather than clamping it at zero,
+ * because a floor at zero would make every rollout look free and would hide the
+ * single failure mode this sprint exists to detect.
+ *
+ * EXACT ARITHMETIC, NO FLOATS IN THE MONEY PATH. Prices are integer
+ * MICRO-UNITS per token (1e-6 of the provider's currency unit), never floating
+ * point. `0.1 + 0.2 !== 0.3` is not an acceptable property for a cost ledger, and
+ * accumulating float error across millions of tokens produces aggregates that
+ * silently disagree with the provider's own bill. All money is integer; only the
+ * derived RATIO is a float, and it is finite-guarded.
+ *
+ * EVERY EXCLUSION NEEDS A FIXTURE (the sprint's headline safety rule). A provider
+ * profile may declare that some request field does not affect cache identity —
+ * but an UNPROVEN exclusion is how you get silent cache poisoning: the renderer
+ * folds a field the provider actually keys on, two different requests collapse to
+ * one cache entry, and one conversation is served another's prefix. So an
+ * exclusion without a `fixtureId` (or with a blank one) is REJECTED here —
+ * `ECON_EXCLUSION_UNPROVEN` — rather than trusted. There is no override.
+ *
+ * ESTIMATE VS MEASURED. Every result is labeled. Only telemetry from a
+ * RANDOMIZED live assignment may be called `measured` and fed into a causal
+ * interval; shadow or non-randomized numbers are `estimate` and are excluded
+ * from causal aggregates (see `experiments.ts`). Mixing the two would let a
+ * self-selected population masquerade as a controlled experiment.
+ *
+ * PURE. No clock, no storage, no console, no network (PREVENT-PI-004 /
+ * PREVENT-011). Runs identically with `MEGACOMPACT_VC7B` on or off — the flag
+ * gates only the reporter/dashboard seam in `../cache/economics-emit.ts`.
+ */
+/** A non-negative safe integer — the only shape money and counts may take. */
+function isCount(n) {
+    return Number.isSafeInteger(n) && n >= 0;
+}
+/**
+ * Validate a profile's economics, enforcing the exclusion-proof rule.
+ *
+ * An exclusion claims "this field cannot affect provider cache identity". That
+ * claim is only as good as the fixture that proves it, so a profile carrying
+ * exclusions MUST name a `exclusionFixtureId`, and every individual exclusion
+ * must carry its own `fixtureId` too (VC5B already models that field; VC7B makes
+ * a blank one fatal instead of decorative). Returns deduplicated codes in a
+ * deterministic order.
+ */
+export function validateEconomics(econ, exclusions) {
+    const codes = new Set();
+    for (const n of [econ.basePrice, econ.readPrice, econ.writePrice, econ.ttlMs, econ.minPrefix]) {
+        if (!isCount(n))
+            codes.add("ECON_PRICE_INVALID");
+    }
+    // The headline rule: exclusions without a proving fixture are never trusted.
+    if (exclusions.length > 0) {
+        const id = econ.exclusionFixtureId;
+        if (id === null || id.trim() === "")
+            codes.add("ECON_EXCLUSION_UNPROVEN");
+        for (const ex of exclusions) {
+            if (ex.fixtureId.trim() === "")
+                codes.add("ECON_EXCLUSION_UNPROVEN");
+        }
+    }
+    const order = ["ECON_EXCLUSION_UNPROVEN", "ECON_PRICE_INVALID"];
+    return order.filter((c) => codes.has(c));
+}
+/**
+ * Validate a profile + its economics together. Convenience over
+ * `validateEconomics` for callers holding a whole `ProviderProfileV1`: the
+ * exclusion list is read from the profile itself, so the two can never disagree.
+ */
+export function validateProfileEconomics(profile, econ) {
+    return validateEconomics(econ, profile.excludedJsonPointers);
+}
+/**
+ * Hits required for ONE write to break even.
+ *
+ * One write costs `(writePrice - basePrice)` extra per token; each subsequent
+ * hit saves `(basePrice - readPrice)` per token. So break-even is the ceiling of
+ * premium/discount. Returns `null` when the cache can NEVER pay for itself
+ * (a read that costs at least as much as an uncached token) — reporting a huge
+ * number there would imply "just get more hits", which is false.
+ * Returns 0 when writing is already free or cheaper than not caching.
+ */
+export function breakEvenHits(econ) {
+    const premium = econ.writePrice - econ.basePrice;
+    const discount = econ.basePrice - econ.readPrice;
+    if (premium <= 0)
+        return 0;
+    if (discount <= 0)
+        return null;
+    return Math.ceil(premium / discount);
+}
+/**
+ * Compute net cache savings for observed (or shadow) usage.
+ *
+ * Pure integer arithmetic in micro-units. The only float is `savingsRatio`, and
+ * it is zero-guarded so a zero baseline yields 0 rather than NaN/Infinity — the
+ * sprint invariant is that every reported aggregate is FINITE.
+ *
+ * `evidence` is supplied by the caller and simply carried through: this function
+ * cannot know whether its inputs came from a randomized arm, and guessing would
+ * be exactly the mislabeling the causal rules forbid.
+ */
+export function computeEconomics(econ, usage, evidence) {
+    const codes = [];
+    for (const n of [econ.basePrice, econ.readPrice, econ.writePrice, econ.ttlMs, econ.minPrefix]) {
+        if (!isCount(n)) {
+            codes.push("ECON_PRICE_INVALID");
+            break;
+        }
+    }
+    for (const n of [usage.cachedTokens, usage.writeCount, usage.hitCount]) {
+        if (!isCount(n)) {
+            codes.push("ECON_USAGE_INVALID");
+            break;
+        }
+    }
+    if (codes.length > 0)
+        return { ok: false, codes };
+    const { cachedTokens, writeCount, hitCount } = usage;
+    const baselineCost = cachedTokens * econ.basePrice * (writeCount + hitCount);
+    const actualCost = cachedTokens * (econ.writePrice * writeCount + econ.readPrice * hitCount);
+    // Exactness is the whole point of the integer model: if any product leaves the
+    // safe-integer range the result is silently wrong, so we fail instead.
+    if (!Number.isSafeInteger(baselineCost) || !Number.isSafeInteger(actualCost)) {
+        return { ok: false, codes: ["ECON_OVERFLOW"] };
+    }
+    const netSavings = baselineCost - actualCost;
+    // Tokens served at the discounted read price — the cache's token-level benefit,
+    // independent of price (a hit re-reads the whole prefix).
+    const tokenSavings = cachedTokens * hitCount;
+    const savingsRatio = baselineCost === 0 ? 0 : netSavings / baselineCost;
+    return {
+        ok: true,
+        result: {
+            profileId: econ.profileId,
+            baselineCost,
+            actualCost,
+            netSavings,
+            tokenSavings,
+            savingsRatio,
+            breakEvenHits: breakEvenHits(econ),
+            evidence,
+        },
+    };
+}
+/**
+ * Whether a prefix is eligible to be cached at all: it must meet the profile's
+ * minimum prefix, and it must still be within TTL. A prefix below `minPrefix` is
+ * not "a small win", it is not cacheable by the provider at all.
+ */
+export function isCacheEligible(econ, prefixTokens, ageMs) {
+    if (!isCount(prefixTokens) || !isCount(ageMs))
+        return false;
+    return prefixTokens >= econ.minPrefix && ageMs < econ.ttlMs;
+}
+// Conformance ID ranges + named rows extracted to economics-ids.ts to keep this
+// file under the 300-line soft limit (soft-as-hard gate). Re-exported here so no
+// consumer import path changes.
+export { CACHE_IDS, ECONOMICS_PROVIDER_IDS, ECONOMICS_NAMED_IDS, } from "./economics-ids.js";

package/dist/vector-cortex/provider/experiments.js

@@ -0,0 +1,166 @@
+/**
+ * vector-cortex/provider/experiments.ts — VC7B session-level cache experiments.
+ *
+ * To claim a cache strategy CAUSED a saving you need a randomized comparison,
+ * not a before/after. This file assigns each session to an experiment arm and
+ * guarantees the two properties that make the resulting telemetry admissible as
+ * causal evidence.
+ *
+ * 1. STABLE, JOURNAL-FREE ASSIGNMENT. The arm is a pure function of
+ *    `sha256(experimentId, sessionId)` — NOT a random draw recorded in a
+ *    journal. So the assignment survives anything: process restart, a lost or
+ *    corrupted journal, a different host, a replay months later. This is the
+ *    sprint's unique failure-injection case (lose the journal after the first
+ *    event, restart, and the same arm must come back), and a hash-derived arm
+ *    passes it by construction rather than by careful recovery code. A journal
+ *    can still be kept as an audit trail, but nothing DEPENDS on it.
+ *
+ *    The corollary matters just as much: every event in one session shares one
+ *    arm (CACHE-RANDOM-003). If a session could drift between arms mid-flight,
+ *    its rows would appear in both arms of the comparison and the contrast would
+ *    be measuring nothing.
+ *
+ * 2. RANDOMIZED ⇒ CAUSAL; EVERYTHING ELSE ⇒ ESTIMATE. Hashing a session id is
+ *    randomization only when the id itself is unpredictable and every session is
+ *    eligible. A FORCED arm (operator override), a SHADOW arm (computed but not
+ *    served), and a non-randomized rollout are all labeled `estimate` and are
+ *    excluded from causal intervals by `isCausallyAdmissible`. Shadow numbers are
+ *    genuinely useful — they are just not evidence of an effect.
+ *
+ * WHY 10_000 BUCKETS. Bucket granularity bounds how finely traffic can be split;
+ * 10k gives 0.01% resolution, matching VC5C's rollout bucketing so the two
+ * subsystems partition traffic on the same scale rather than on quietly
+ * different ones.
+ *
+ * PURE. No clock, no storage, no console, no network (PREVENT-PI-004 /
+ * PREVENT-011). `assignedAt` is an INJECTED timestamp, never `Date.now()` read
+ * here, so assignment is fully reproducible in tests and replays. Runs
+ * identically with `MEGACOMPACT_VC7B` on or off.
+ */
+import { createHash } from "node:crypto";
+/** The registered arms, in canonical bucket order. */
+export const EXPERIMENT_ARMS = ["A", "B", "C"];
+/** Bucket space: 10k buckets = 0.01% resolution (matches VC5C rollout). */
+export const EXPERIMENT_BUCKETS = 10_000;
+/** Even three-way split (the default): 3334 / 3333 / 3333 = 10000. */
+export const EVEN_SPLIT = { A: 3334, B: 3333, C: 3333 };
+/**
+ * Length-prefixed field framing, identical in spirit to the crystal key encoder:
+ * `<byteLength>:<value>` makes the concatenation injective, so experiment
+ * `"a"` + session `"b:c"` cannot collide with experiment `"a:b"` + session `"c"`.
+ * Without it, two different (experiment, session) pairs could share a bucket and
+ * a session could appear to switch arms when an experiment is renamed.
+ */
+function field(value) {
+    return `${Buffer.byteLength(value, "utf8")}:${value}`;
+}
+/**
+ * The stable bucket for a session: the low 32 bits of
+ * `sha256(experimentId, sessionId)`, modulo the bucket space.
+ *
+ * Deterministic and storage-free — this is what makes a lost assignment journal
+ * a non-event. Reading 4 bytes (rather than the whole digest) keeps the value in
+ * exact integer range; SHA-256's avalanche means any 32 bits are equidistributed.
+ */
+export function experimentBucket(experimentId, sessionId) {
+    const h = createHash("sha256")
+        .update(field(experimentId) + field(sessionId), "utf8")
+        .digest();
+    return h.readUInt32BE(0) % EXPERIMENT_BUCKETS;
+}
+/** Validate that a split covers the bucket space exactly once. */
+export function validateSplit(split) {
+    for (const n of [split.A, split.B, split.C]) {
+        if (!Number.isSafeInteger(n) || n < 0)
+            return false;
+    }
+    return split.A + split.B + split.C === EXPERIMENT_BUCKETS;
+}
+/**
+ * Map a bucket to an arm under a split. Arms occupy contiguous bucket ranges in
+ * the fixed order A, B, C, so the mapping is stable: widening arm C's share can
+ * never reshuffle a session already sitting in arm A.
+ */
+export function armForBucket(bucket, split) {
+    if (bucket < split.A)
+        return "A";
+    if (bucket < split.A + split.B)
+        return "B";
+    return "C";
+}
+/**
+ * Assign a session to an experiment arm.
+ *
+ * The default path is `randomized`: bucket = stable hash, arm = bucket's range.
+ * Passing `forced` overrides the arm and downgrades the source (and therefore
+ * causal admissibility) — the bucket is still computed and reported so the
+ * override remains auditable against what the session WOULD have got.
+ *
+ * `assignedAt` is injected by the caller. Assignment is a pure function of its
+ * arguments, so the same session always yields the same arm no matter when, or
+ * how many times, it is asked.
+ */
+export function assignExperiment(input) {
+    const codes = [];
+    if (input.experimentId.trim() === "" || input.sessionId.trim() === "") {
+        codes.push("EXP_ID_INVALID");
+    }
+    const split = input.split ?? EVEN_SPLIT;
+    if (!validateSplit(split))
+        codes.push("EXP_SPLIT_INVALID");
+    if (input.forced !== undefined && !EXPERIMENT_ARMS.includes(input.forced)) {
+        codes.push("EXP_ARM_UNKNOWN");
+    }
+    if (codes.length > 0)
+        return { ok: false, codes };
+    const bucket = experimentBucket(input.experimentId, input.sessionId);
+    const natural = armForBucket(bucket, split);
+    const arm = input.forced ?? natural;
+    // Precedence: a forced arm is self-selected, so it is never causal even when
+    // it happens to agree with the natural arm. Shadow is likewise non-causal.
+    const source = input.forced !== undefined ? "forced" : input.shadow === true ? "shadow" : "randomized";
+    return {
+        ok: true,
+        assignment: {
+            schema: "cache-experiment-v1",
+            experimentId: input.experimentId,
+            sessionId: input.sessionId,
+            arm,
+            bucket,
+            source,
+            assignedAt: input.assignedAt,
+        },
+    };
+}
+/**
+ * Whether an assignment's telemetry may enter a causal interval.
+ *
+ * ONLY `randomized`. This single predicate is what keeps forced and shadow rows
+ * out of the causal aggregate; every consumer computing an interval must filter
+ * through it rather than re-deriving the rule.
+ */
+export function isCausallyAdmissible(a) {
+    return a.source === "randomized";
+}
+/**
+ * Keep only causally admissible assignments. The complement is not discarded by
+ * the caller — it is reported as `estimate` — but it never reaches an interval.
+ */
+export function causalOnly(assignments) {
+    return assignments.filter(isCausallyAdmissible);
+}
+/**
+ * Whether every assignment for one session agrees on the arm (CACHE-RANDOM-003).
+ * A session that appears in two arms would contaminate both sides of the
+ * comparison, so this is asserted directly rather than assumed.
+ */
+export function sessionArmsConsistent(assignments) {
+    const bySession = new Map();
+    for (const a of assignments) {
+        const seen = bySession.get(a.sessionId);
+        if (seen !== undefined && seen !== a.arm)
+            return false;
+        bySession.set(a.sessionId, a.arm);
+    }
+    return true;
+}

package/extensions/dashboard-client/dist/assets/{AreaChart-CB-U7ViX.js → AreaChart-CV8WqMmt.js}

@@ -1,2 +1,2 @@
-import{b as R,c as W,m as T,i as C,d as F,A as ie,e as B,h as q,j as oe,k as G,l as se,n as le,u as ue,o as K,G as ce,p as J,q as Q,D as fe,g as pe,X as he,Y as de,f as me}from"./generateCategoricalChart-B-IUoLd1.js";import{R as p,F as ee,r as ve}from"./index-Do749WlW.js";var ye=["layout","type","stroke","connectNulls","isRange","ref"],be=["key"],te;function M(e){"@babel/helpers - typeof";return M=typeof Symbol=="function"&&typeof Symbol.iterator=="symbol"?function(t){return typeof t}:function(t){return t&&typeof Symbol=="function"&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},M(e)}function ae(e,t){if(e==null)return{};var r=Ae(e,t),a,n;if(Object.getOwnPropertySymbols){var i=Object.getOwnPropertySymbols(e);for(n=0;n<i.length;n++)a=i[n],!(t.indexOf(a)>=0)&&Object.prototype.propertyIsEnumerable.call(e,a)&&(r[a]=e[a])}return r}function Ae(e,t){if(e==null)return{};var r={};for(var a in e)if(Object.prototype.hasOwnProperty.call(e,a)){if(t.indexOf(a)>=0)continue;r[a]=e[a]}return r}function D(){return D=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var r=arguments[t];for(var a in r)Object.prototype.hasOwnProperty.call(r,a)&&(e[a]=r[a])}return e},D.apply(this,arguments)}function U(e,t){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(e);t&&(a=a.filter(function(n){return Object.getOwnPropertyDescriptor(e,n).enumerable})),r.push.apply(r,a)}return r}function S(e){for(var t=1;t<arguments.length;t++){var r=arguments[t]!=null?arguments[t]:{};t%2?U(Object(r),!0).forEach(function(a){E(e,a,r[a])}):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(r)):U(Object(r)).forEach(function(a){Object.defineProperty(e,a,Object.getOwnPropertyDescriptor(r,a))})}return e}function ge(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function Z(e,t){for(var r=0;r<t.length;r++){var a=t[r];a.enumerable=a.enumerable||!1,a.configurable=!0,"value"in a&&(a.writable=!0),Object.defineProperty(e,ne(a.key),a)}}function xe(e,t,r){return t&&Z(e.prototype,t),r&&Z(e,r),Object.defineProperty(e,"prototype",{writable:!1}),e}function Pe(e,t,r){return t=$(t),Oe(e,re()?Reflect.construct(t,r||[],$(e).constructor):t.apply(e,r))}function Oe(e,t){if(t&&(M(t)==="object"||typeof t=="function"))return t;if(t!==void 0)throw new TypeError("Derived constructors may only return object or undefined");return Ee(e)}function Ee(e){if(e===void 0)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return e}function re(){try{var e=!Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],function(){}))}catch{}return(re=function(){return!!e})()}function $(e){return $=Object.setPrototypeOf?Object.getPrototypeOf.bind():function(r){return r.__proto__||Object.getPrototypeOf(r)},$(e)}function we(e,t){if(typeof t!="function"&&t!==null)throw new TypeError("Super expression must either be null or a function");e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,writable:!0,configurable:!0}}),Object.defineProperty(e,"prototype",{writable:!1}),t&&X(e,t)}function X(e,t){return X=Object.setPrototypeOf?Object.setPrototypeOf.bind():function(a,n){return a.__proto__=n,a},X(e,t)}function E(e,t,r){return t=ne(t),t in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}function ne(e){var t=_e(e,"string");return M(t)=="symbol"?t:t+""}function _e(e,t){if(M(e)!="object"||!e)return e;var r=e[Symbol.toPrimitive];if(r!==void 0){var a=r.call(e,t);if(M(a)!="object")return a;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}var L=function(e){function t(){var r;ge(this,t);for(var a=arguments.length,n=new Array(a),i=0;i<a;i++)n[i]=arguments[i];return r=Pe(this,t,[].concat(n)),E(r,"state",{isAnimationFinished:!0}),E(r,"id",ue("recharts-area-")),E(r,"handleAnimationEnd",function(){var o=r.props.onAnimationEnd;r.setState({isAnimationFinished:!0}),K(o)&&o()}),E(r,"handleAnimationStart",function(){var o=r.props.onAnimationStart;r.setState({isAnimationFinished:!1}),K(o)&&o()}),r}return we(t,e),xe(t,[{key:"renderDots",value:function(a,n,i){var o=this.props.isAnimationActive,s=this.state.isAnimationFinished;if(o&&!s)return null;var u=this.props,l=u.dot,f=u.points,c=u.dataKey,h=R(this.props,!1),A=R(l,!0),g=f.map(function(v,O){var y=S(S(S({key:"dot-".concat(O),r:3},h),A),{},{index:O,cx:v.x,cy:v.y,dataKey:c,value:v.value,payload:v.payload,points:f});return t.renderDotItem(l,y)}),x={clipPath:a?"url(#clipPath-".concat(n?"":"dots-").concat(i,")"):null};return p.createElement(W,D({className:"recharts-area-dots"},x),g)}},{key:"renderHorizontalRect",value:function(a){var n=this.props,i=n.baseLine,o=n.points,s=n.strokeWidth,u=o[0].x,l=o[o.length-1].x,f=a*Math.abs(u-l),c=T(o.map(function(h){return h.y||0}));return C(i)&&typeof i=="number"?c=Math.max(i,c):i&&Array.isArray(i)&&i.length&&(c=Math.max(T(i.map(function(h){return h.y||0})),c)),C(c)?p.createElement("rect",{x:u<l?u:u-f,y:0,width:f,height:Math.floor(c+(s?parseInt("".concat(s),10):1))}):null}},{key:"renderVerticalRect",value:function(a){var n=this.props,i=n.baseLine,o=n.points,s=n.strokeWidth,u=o[0].y,l=o[o.length-1].y,f=a*Math.abs(u-l),c=T(o.map(function(h){return h.x||0}));return C(i)&&typeof i=="number"?c=Math.max(i,c):i&&Array.isArray(i)&&i.length&&(c=Math.max(T(i.map(function(h){return h.x||0})),c)),C(c)?p.createElement("rect",{x:0,y:u<l?u:u-f,width:c+(s?parseInt("".concat(s),10):1),height:Math.floor(f)}):null}},{key:"renderClipRect",value:function(a){var n=this.props.layout;return n==="vertical"?this.renderVerticalRect(a):this.renderHorizontalRect(a)}},{key:"renderAreaStatically",value:function(a,n,i,o){var s=this.props,u=s.layout,l=s.type,f=s.stroke,c=s.connectNulls,h=s.isRange;s.ref;var A=ae(s,ye);return p.createElement(W,{clipPath:i?"url(#clipPath-".concat(o,")"):null},p.createElement(F,D({},R(A,!0),{points:a,connectNulls:c,type:l,baseLine:n,layout:u,stroke:"none",className:"recharts-area-area"})),f!=="none"&&p.createElement(F,D({},R(this.props,!1),{className:"recharts-area-curve",layout:u,type:l,connectNulls:c,fill:"none",points:a})),f!=="none"&&h&&p.createElement(F,D({},R(this.props,!1),{className:"recharts-area-curve",layout:u,type:l,connectNulls:c,fill:"none",points:n})))}},{key:"renderAreaWithAnimation",value:function(a,n){var i=this,o=this.props,s=o.points,u=o.baseLine,l=o.isAnimationActive,f=o.animationBegin,c=o.animationDuration,h=o.animationEasing,A=o.animationId,g=this.state,x=g.prevPoints,v=g.prevBaseLine;return p.createElement(ie,{begin:f,duration:c,isActive:l,easing:h,from:{t:0},to:{t:1},key:"area-".concat(A),onAnimationEnd:this.handleAnimationEnd,onAnimationStart:this.handleAnimationStart},function(O){var y=O.t;if(x){var _=x.length/s.length,d=s.map(function(P,N){var k=Math.floor(N*_);if(x[k]){var j=x[k],I=B(j.x,P.x),V=B(j.y,P.y);return S(S({},P),{},{x:I(y),y:V(y)})}return P}),m;if(C(u)&&typeof u=="number"){var b=B(v,u);m=b(y)}else if(q(u)||oe(u)){var w=B(v,0);m=w(y)}else m=u.map(function(P,N){var k=Math.floor(N*_);if(v[k]){var j=v[k],I=B(j.x,P.x),V=B(j.y,P.y);return S(S({},P),{},{x:I(y),y:V(y)})}return P});return i.renderAreaStatically(d,m,a,n)}return p.createElement(W,null,p.createElement("defs",null,p.createElement("clipPath",{id:"animationClipPath-".concat(n)},i.renderClipRect(y))),p.createElement(W,{clipPath:"url(#animationClipPath-".concat(n,")")},i.renderAreaStatically(s,u,a,n)))})}},{key:"renderArea",value:function(a,n){var i=this.props,o=i.points,s=i.baseLine,u=i.isAnimationActive,l=this.state,f=l.prevPoints,c=l.prevBaseLine,h=l.totalLength;return u&&o&&o.length&&(!f&&h>0||!G(f,o)||!G(c,s))?this.renderAreaWithAnimation(a,n):this.renderAreaStatically(o,s,a,n)}},{key:"render",value:function(){var a,n=this.props,i=n.hide,o=n.dot,s=n.points,u=n.className,l=n.top,f=n.left,c=n.xAxis,h=n.yAxis,A=n.width,g=n.height,x=n.isAnimationActive,v=n.id;if(i||!s||!s.length)return null;var O=this.state.isAnimationFinished,y=s.length===1,_=ee("recharts-area",u),d=c&&c.allowDataOverflow,m=h&&h.allowDataOverflow,b=d||m,w=q(v)?this.id:v,P=(a=R(o,!1))!==null&&a!==void 0?a:{r:3,strokeWidth:2},N=P.r,k=N===void 0?3:N,j=P.strokeWidth,I=j===void 0?2:j,V=se(o)?o:{},Y=V.clipDot,H=Y===void 0?!0:Y,z=k*2+I;return p.createElement(W,{className:_},d||m?p.createElement("defs",null,p.createElement("clipPath",{id:"clipPath-".concat(w)},p.createElement("rect",{x:d?f:f-A/2,y:m?l:l-g/2,width:d?A:A*2,height:m?g:g*2})),!H&&p.createElement("clipPath",{id:"clipPath-dots-".concat(w)},p.createElement("rect",{x:f-z/2,y:l-z/2,width:A+z,height:g+z}))):null,y?null:this.renderArea(b,w),(o||y)&&this.renderDots(b,H,w),(!x||O)&&le.renderCallByParent(this.props,s))}}],[{key:"getDerivedStateFromProps",value:function(a,n){return a.animationId!==n.prevAnimationId?{prevAnimationId:a.animationId,curPoints:a.points,curBaseLine:a.baseLine,prevPoints:n.curPoints,prevBaseLine:n.curBaseLine}:a.points!==n.curPoints||a.baseLine!==n.curBaseLine?{curPoints:a.points,curBaseLine:a.baseLine}:null}}])}(ve.PureComponent);te=L;E(L,"displayName","Area");E(L,"defaultProps",{stroke:"#3182bd",fill:"#3182bd",fillOpacity:.6,xAxisId:0,yAxisId:0,legendType:"line",connectNulls:!1,points:[],dot:!1,activeDot:!0,hide:!1,isAnimationActive:!ce.isSsr,animationBegin:0,animationDuration:1500,animationEasing:"ease"});E(L,"getBaseValue",function(e,t,r,a){var n=e.layout,i=e.baseValue,o=t.props.baseValue,s=o??i;if(C(s)&&typeof s=="number")return s;var u=n==="horizontal"?a:r,l=u.scale.domain();if(u.type==="number"){var f=Math.max(l[0],l[1]),c=Math.min(l[0],l[1]);return s==="dataMin"?c:s==="dataMax"||f<0?f:Math.max(Math.min(l[0],l[1]),0)}return s==="dataMin"?l[0]:s==="dataMax"?l[1]:l[0]});E(L,"getComposedData",function(e){var t=e.props,r=e.item,a=e.xAxis,n=e.yAxis,i=e.xAxisTicks,o=e.yAxisTicks,s=e.bandSize,u=e.dataKey,l=e.stackedData,f=e.dataStartIndex,c=e.displayedData,h=e.offset,A=t.layout,g=l&&l.length,x=te.getBaseValue(t,r,a,n),v=A==="horizontal",O=!1,y=c.map(function(d,m){var b;g?b=l[f+m]:(b=J(d,u),Array.isArray(b)?O=!0:b=[x,b]);var w=b[1]==null||g&&J(d,u)==null;return v?{x:Q({axis:a,ticks:i,bandSize:s,entry:d,index:m}),y:w?null:n.scale(b[1]),value:b,payload:d}:{x:w?null:a.scale(b[1]),y:Q({axis:n,ticks:o,bandSize:s,entry:d,index:m}),value:b,payload:d}}),_;return g||O?_=y.map(function(d){var m=Array.isArray(d.value)?d.value[0]:null;return v?{x:d.x,y:m!=null&&d.y!=null?n.scale(m):null}:{x:m!=null?a.scale(m):null,y:d.y}}):_=v?n.scale(x):a.scale(x),S({points:y,baseLine:_,layout:A,isRange:O},h)});E(L,"renderDotItem",function(e,t){var r;if(p.isValidElement(e))r=p.cloneElement(e,t);else if(K(e))r=e(t);else{var a=ee("recharts-area-dot",typeof e!="boolean"?e.className:""),n=t.key,i=ae(t,be);r=p.createElement(fe,D({},i,{key:n,className:a}))}return r});var ke=pe({chartName:"AreaChart",GraphicalChild:L,axisComponents:[{axisType:"xAxis",AxisComp:he},{axisType:"yAxis",AxisComp:de}],formatAxisMap:me});export{ke as A,L as a};
-//# sourceMappingURL=AreaChart-CB-U7ViX.js.map
+import{b as R,c as W,m as T,i as C,d as F,A as ie,e as B,h as q,j as oe,k as G,l as se,n as le,u as ue,o as K,G as ce,p as J,q as Q,D as fe,g as pe,X as he,Y as de,f as me}from"./generateCategoricalChart-CMmkuwj5.js";import{R as p,F as ee,r as ve}from"./index-Dz8GPBOE.js";var ye=["layout","type","stroke","connectNulls","isRange","ref"],be=["key"],te;function M(e){"@babel/helpers - typeof";return M=typeof Symbol=="function"&&typeof Symbol.iterator=="symbol"?function(t){return typeof t}:function(t){return t&&typeof Symbol=="function"&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},M(e)}function ae(e,t){if(e==null)return{};var r=Ae(e,t),a,n;if(Object.getOwnPropertySymbols){var i=Object.getOwnPropertySymbols(e);for(n=0;n<i.length;n++)a=i[n],!(t.indexOf(a)>=0)&&Object.prototype.propertyIsEnumerable.call(e,a)&&(r[a]=e[a])}return r}function Ae(e,t){if(e==null)return{};var r={};for(var a in e)if(Object.prototype.hasOwnProperty.call(e,a)){if(t.indexOf(a)>=0)continue;r[a]=e[a]}return r}function D(){return D=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var r=arguments[t];for(var a in r)Object.prototype.hasOwnProperty.call(r,a)&&(e[a]=r[a])}return e},D.apply(this,arguments)}function U(e,t){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(e);t&&(a=a.filter(function(n){return Object.getOwnPropertyDescriptor(e,n).enumerable})),r.push.apply(r,a)}return r}function S(e){for(var t=1;t<arguments.length;t++){var r=arguments[t]!=null?arguments[t]:{};t%2?U(Object(r),!0).forEach(function(a){E(e,a,r[a])}):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(r)):U(Object(r)).forEach(function(a){Object.defineProperty(e,a,Object.getOwnPropertyDescriptor(r,a))})}return e}function ge(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function Z(e,t){for(var r=0;r<t.length;r++){var a=t[r];a.enumerable=a.enumerable||!1,a.configurable=!0,"value"in a&&(a.writable=!0),Object.defineProperty(e,ne(a.key),a)}}function xe(e,t,r){return t&&Z(e.prototype,t),r&&Z(e,r),Object.defineProperty(e,"prototype",{writable:!1}),e}function Pe(e,t,r){return t=$(t),Oe(e,re()?Reflect.construct(t,r||[],$(e).constructor):t.apply(e,r))}function Oe(e,t){if(t&&(M(t)==="object"||typeof t=="function"))return t;if(t!==void 0)throw new TypeError("Derived constructors may only return object or undefined");return Ee(e)}function Ee(e){if(e===void 0)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return e}function re(){try{var e=!Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],function(){}))}catch{}return(re=function(){return!!e})()}function $(e){return $=Object.setPrototypeOf?Object.getPrototypeOf.bind():function(r){return r.__proto__||Object.getPrototypeOf(r)},$(e)}function we(e,t){if(typeof t!="function"&&t!==null)throw new TypeError("Super expression must either be null or a function");e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,writable:!0,configurable:!0}}),Object.defineProperty(e,"prototype",{writable:!1}),t&&X(e,t)}function X(e,t){return X=Object.setPrototypeOf?Object.setPrototypeOf.bind():function(a,n){return a.__proto__=n,a},X(e,t)}function E(e,t,r){return t=ne(t),t in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}function ne(e){var t=_e(e,"string");return M(t)=="symbol"?t:t+""}function _e(e,t){if(M(e)!="object"||!e)return e;var r=e[Symbol.toPrimitive];if(r!==void 0){var a=r.call(e,t);if(M(a)!="object")return a;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}var L=function(e){function t(){var r;ge(this,t);for(var a=arguments.length,n=new Array(a),i=0;i<a;i++)n[i]=arguments[i];return r=Pe(this,t,[].concat(n)),E(r,"state",{isAnimationFinished:!0}),E(r,"id",ue("recharts-area-")),E(r,"handleAnimationEnd",function(){var o=r.props.onAnimationEnd;r.setState({isAnimationFinished:!0}),K(o)&&o()}),E(r,"handleAnimationStart",function(){var o=r.props.onAnimationStart;r.setState({isAnimationFinished:!1}),K(o)&&o()}),r}return we(t,e),xe(t,[{key:"renderDots",value:function(a,n,i){var o=this.props.isAnimationActive,s=this.state.isAnimationFinished;if(o&&!s)return null;var u=this.props,l=u.dot,f=u.points,c=u.dataKey,h=R(this.props,!1),A=R(l,!0),g=f.map(function(v,O){var y=S(S(S({key:"dot-".concat(O),r:3},h),A),{},{index:O,cx:v.x,cy:v.y,dataKey:c,value:v.value,payload:v.payload,points:f});return t.renderDotItem(l,y)}),x={clipPath:a?"url(#clipPath-".concat(n?"":"dots-").concat(i,")"):null};return p.createElement(W,D({className:"recharts-area-dots"},x),g)}},{key:"renderHorizontalRect",value:function(a){var n=this.props,i=n.baseLine,o=n.points,s=n.strokeWidth,u=o[0].x,l=o[o.length-1].x,f=a*Math.abs(u-l),c=T(o.map(function(h){return h.y||0}));return C(i)&&typeof i=="number"?c=Math.max(i,c):i&&Array.isArray(i)&&i.length&&(c=Math.max(T(i.map(function(h){return h.y||0})),c)),C(c)?p.createElement("rect",{x:u<l?u:u-f,y:0,width:f,height:Math.floor(c+(s?parseInt("".concat(s),10):1))}):null}},{key:"renderVerticalRect",value:function(a){var n=this.props,i=n.baseLine,o=n.points,s=n.strokeWidth,u=o[0].y,l=o[o.length-1].y,f=a*Math.abs(u-l),c=T(o.map(function(h){return h.x||0}));return C(i)&&typeof i=="number"?c=Math.max(i,c):i&&Array.isArray(i)&&i.length&&(c=Math.max(T(i.map(function(h){return h.x||0})),c)),C(c)?p.createElement("rect",{x:0,y:u<l?u:u-f,width:c+(s?parseInt("".concat(s),10):1),height:Math.floor(f)}):null}},{key:"renderClipRect",value:function(a){var n=this.props.layout;return n==="vertical"?this.renderVerticalRect(a):this.renderHorizontalRect(a)}},{key:"renderAreaStatically",value:function(a,n,i,o){var s=this.props,u=s.layout,l=s.type,f=s.stroke,c=s.connectNulls,h=s.isRange;s.ref;var A=ae(s,ye);return p.createElement(W,{clipPath:i?"url(#clipPath-".concat(o,")"):null},p.createElement(F,D({},R(A,!0),{points:a,connectNulls:c,type:l,baseLine:n,layout:u,stroke:"none",className:"recharts-area-area"})),f!=="none"&&p.createElement(F,D({},R(this.props,!1),{className:"recharts-area-curve",layout:u,type:l,connectNulls:c,fill:"none",points:a})),f!=="none"&&h&&p.createElement(F,D({},R(this.props,!1),{className:"recharts-area-curve",layout:u,type:l,connectNulls:c,fill:"none",points:n})))}},{key:"renderAreaWithAnimation",value:function(a,n){var i=this,o=this.props,s=o.points,u=o.baseLine,l=o.isAnimationActive,f=o.animationBegin,c=o.animationDuration,h=o.animationEasing,A=o.animationId,g=this.state,x=g.prevPoints,v=g.prevBaseLine;return p.createElement(ie,{begin:f,duration:c,isActive:l,easing:h,from:{t:0},to:{t:1},key:"area-".concat(A),onAnimationEnd:this.handleAnimationEnd,onAnimationStart:this.handleAnimationStart},function(O){var y=O.t;if(x){var _=x.length/s.length,d=s.map(function(P,N){var k=Math.floor(N*_);if(x[k]){var j=x[k],I=B(j.x,P.x),V=B(j.y,P.y);return S(S({},P),{},{x:I(y),y:V(y)})}return P}),m;if(C(u)&&typeof u=="number"){var b=B(v,u);m=b(y)}else if(q(u)||oe(u)){var w=B(v,0);m=w(y)}else m=u.map(function(P,N){var k=Math.floor(N*_);if(v[k]){var j=v[k],I=B(j.x,P.x),V=B(j.y,P.y);return S(S({},P),{},{x:I(y),y:V(y)})}return P});return i.renderAreaStatically(d,m,a,n)}return p.createElement(W,null,p.createElement("defs",null,p.createElement("clipPath",{id:"animationClipPath-".concat(n)},i.renderClipRect(y))),p.createElement(W,{clipPath:"url(#animationClipPath-".concat(n,")")},i.renderAreaStatically(s,u,a,n)))})}},{key:"renderArea",value:function(a,n){var i=this.props,o=i.points,s=i.baseLine,u=i.isAnimationActive,l=this.state,f=l.prevPoints,c=l.prevBaseLine,h=l.totalLength;return u&&o&&o.length&&(!f&&h>0||!G(f,o)||!G(c,s))?this.renderAreaWithAnimation(a,n):this.renderAreaStatically(o,s,a,n)}},{key:"render",value:function(){var a,n=this.props,i=n.hide,o=n.dot,s=n.points,u=n.className,l=n.top,f=n.left,c=n.xAxis,h=n.yAxis,A=n.width,g=n.height,x=n.isAnimationActive,v=n.id;if(i||!s||!s.length)return null;var O=this.state.isAnimationFinished,y=s.length===1,_=ee("recharts-area",u),d=c&&c.allowDataOverflow,m=h&&h.allowDataOverflow,b=d||m,w=q(v)?this.id:v,P=(a=R(o,!1))!==null&&a!==void 0?a:{r:3,strokeWidth:2},N=P.r,k=N===void 0?3:N,j=P.strokeWidth,I=j===void 0?2:j,V=se(o)?o:{},Y=V.clipDot,H=Y===void 0?!0:Y,z=k*2+I;return p.createElement(W,{className:_},d||m?p.createElement("defs",null,p.createElement("clipPath",{id:"clipPath-".concat(w)},p.createElement("rect",{x:d?f:f-A/2,y:m?l:l-g/2,width:d?A:A*2,height:m?g:g*2})),!H&&p.createElement("clipPath",{id:"clipPath-dots-".concat(w)},p.createElement("rect",{x:f-z/2,y:l-z/2,width:A+z,height:g+z}))):null,y?null:this.renderArea(b,w),(o||y)&&this.renderDots(b,H,w),(!x||O)&&le.renderCallByParent(this.props,s))}}],[{key:"getDerivedStateFromProps",value:function(a,n){return a.animationId!==n.prevAnimationId?{prevAnimationId:a.animationId,curPoints:a.points,curBaseLine:a.baseLine,prevPoints:n.curPoints,prevBaseLine:n.curBaseLine}:a.points!==n.curPoints||a.baseLine!==n.curBaseLine?{curPoints:a.points,curBaseLine:a.baseLine}:null}}])}(ve.PureComponent);te=L;E(L,"displayName","Area");E(L,"defaultProps",{stroke:"#3182bd",fill:"#3182bd",fillOpacity:.6,xAxisId:0,yAxisId:0,legendType:"line",connectNulls:!1,points:[],dot:!1,activeDot:!0,hide:!1,isAnimationActive:!ce.isSsr,animationBegin:0,animationDuration:1500,animationEasing:"ease"});E(L,"getBaseValue",function(e,t,r,a){var n=e.layout,i=e.baseValue,o=t.props.baseValue,s=o??i;if(C(s)&&typeof s=="number")return s;var u=n==="horizontal"?a:r,l=u.scale.domain();if(u.type==="number"){var f=Math.max(l[0],l[1]),c=Math.min(l[0],l[1]);return s==="dataMin"?c:s==="dataMax"||f<0?f:Math.max(Math.min(l[0],l[1]),0)}return s==="dataMin"?l[0]:s==="dataMax"?l[1]:l[0]});E(L,"getComposedData",function(e){var t=e.props,r=e.item,a=e.xAxis,n=e.yAxis,i=e.xAxisTicks,o=e.yAxisTicks,s=e.bandSize,u=e.dataKey,l=e.stackedData,f=e.dataStartIndex,c=e.displayedData,h=e.offset,A=t.layout,g=l&&l.length,x=te.getBaseValue(t,r,a,n),v=A==="horizontal",O=!1,y=c.map(function(d,m){var b;g?b=l[f+m]:(b=J(d,u),Array.isArray(b)?O=!0:b=[x,b]);var w=b[1]==null||g&&J(d,u)==null;return v?{x:Q({axis:a,ticks:i,bandSize:s,entry:d,index:m}),y:w?null:n.scale(b[1]),value:b,payload:d}:{x:w?null:a.scale(b[1]),y:Q({axis:n,ticks:o,bandSize:s,entry:d,index:m}),value:b,payload:d}}),_;return g||O?_=y.map(function(d){var m=Array.isArray(d.value)?d.value[0]:null;return v?{x:d.x,y:m!=null&&d.y!=null?n.scale(m):null}:{x:m!=null?a.scale(m):null,y:d.y}}):_=v?n.scale(x):a.scale(x),S({points:y,baseLine:_,layout:A,isRange:O},h)});E(L,"renderDotItem",function(e,t){var r;if(p.isValidElement(e))r=p.cloneElement(e,t);else if(K(e))r=e(t);else{var a=ee("recharts-area-dot",typeof e!="boolean"?e.className:""),n=t.key,i=ae(t,be);r=p.createElement(fe,D({},i,{key:n,className:a}))}return r});var ke=pe({chartName:"AreaChart",GraphicalChild:L,axisComponents:[{axisType:"xAxis",AxisComp:he},{axisType:"yAxis",AxisComp:de}],formatAxisMap:me});export{ke as A,L as a};
+//# sourceMappingURL=AreaChart-CV8WqMmt.js.map