pi-mega-compact 0.20.2 → 0.20.4

package/dist/vector-cortex/prompt-dag/_acceptance-fixture.js

@@ -0,0 +1,59 @@
+/**
+ * prompt-dag/_acceptance-fixture.ts — conformance fixture I/O for VC5A DAG +
+ * planner acceptance rows.
+ *
+ * Reads the v2 conformance manifest + the per-sprint fixture files, and exposes
+ * the `DagFixture` / `PlnFixture` shapes the acceptance aggregator drives. No
+ * mocks/stubs: the fixtures are the committed canonical corpus.
+ */
+import { readFileSync, existsSync } from "node:fs";
+import { join, dirname } from "node:path";
+import { fileURLToPath } from "node:url";
+import assert from "node:assert/strict";
+const HERE = dirname(fileURLToPath(import.meta.url));
+function repoRoot(from) {
+    let dir = from;
+    for (let i = 0; i < 8; i++) {
+        if (existsSync(join(dir, "conformance", "vector-cortex")))
+            return dir;
+        const next = dirname(dir);
+        if (next === dir)
+            break;
+        dir = next;
+    }
+    throw new Error("conformance corpus not found above " + from);
+}
+export const REPO_ROOT = repoRoot(HERE);
+export const V2 = join(REPO_ROOT, "conformance", "vector-cortex", "v2");
+export function readManifest() {
+    return JSON.parse(readFileSync(join(V2, "manifest.json"), "utf8"));
+}
+/** Resolve a fixture row by ID, restricting to one of this sprint's two roots. */
+function readFixture(id, prefix) {
+    const m = readManifest();
+    const row = m.fixtures.find((f) => f.id === id && f.path.startsWith(`${prefix}/`));
+    assert.ok(row, `fixture ${id} registered under ${prefix}/ in manifest`);
+    return JSON.parse(readFileSync(join(V2, row.path), "utf8"));
+}
+export function dagFixture(id) {
+    return readFixture(id, "prompt-dag");
+}
+export function plnFixture(id) {
+    return readFixture(id, "planner");
+}
+/** Flag-pinned wrapper: VC5A gated by MEGACOMPACT_VC5A (defaults ON). */
+export function withFlagsOn(fn) {
+    return () => {
+        const saved = process.env.MEGACOMPACT_VC5A;
+        process.env.MEGACOMPACT_VC5A = "1";
+        try {
+            fn();
+        }
+        finally {
+            if (saved === undefined)
+                delete process.env.MEGACOMPACT_VC5A;
+            else
+                process.env.MEGACOMPACT_VC5A = saved;
+        }
+    };
+}

package/dist/vector-cortex/prompt-dag/_acceptance-helpers.js

@@ -0,0 +1,17 @@
+/**
+ * prompt-dag/_acceptance-helpers.ts — barrel re-export for the VC5A DAG +
+ * planner acceptance rows.
+ *
+ * The implementation is split across focused sibling files to keep each under
+ * the src/ 500-line hard limit; this file is the single import surface the
+ * acceptance aggregator uses:
+ *   - `_acceptance-fixture.ts`  — manifest I/O + DagFixture/PlnFixture shapes + withFlagsOn
+ *   - `_acceptance-dag.ts`      — declarative DAG materialization + runDagScenario
+ *   - `_acceptance-planner.ts` — candidate-set materialization + runPlannerScenario
+ *   - `_acceptance-shuffle.ts` — deterministic eq/shuffle helpers
+ *
+ * Every function drives the REAL prompt-dag / planner logic — no mocks, no stubs.
+ */
+export { REPO_ROOT, V2, readManifest, dagFixture, plnFixture, withFlagsOn, } from "./_acceptance-fixture.js";
+export { materializeDag, runDagScenario } from "./_acceptance-dag.js";
+export { materializeCandidates, runPlannerScenario } from "./_acceptance-planner.js";

package/dist/vector-cortex/prompt-dag/_acceptance-planner.js

@@ -0,0 +1,153 @@
+/**
+ * prompt-dag/_acceptance-planner.ts — declarative candidate-set materialization
+ * + scenario driver for VC5A planner acceptance rows.
+ *
+ * Turns named candidate-set scenarios into real `PlanCandidate[]` values and
+ * drives them through the REAL portfolio planner (planPortfolio). The
+ * `mandatoryTokenEstimate` is the VC4C content-only figure = sum of mandatory
+ * content tokens (zero-framing fixtures pin this exactly).
+ */
+import assert from "node:assert/strict";
+import { planPortfolio, planManifestDigest, validatePlanManifest, } from "../planner/portfolio.js";
+import { DEFAULT_FRAMING } from "../planner/types.js";
+import { shuffle } from "./_acceptance-shuffle.js";
+export function materializeCandidates(name) {
+    const sets = {
+        // m1=10, m2=20 mandatory → 30 content tokens (zero-framing fixtures pin this).
+        "mandatory-only": [
+            { nodeId: "m1", tokenEstimate: 10, utility: 100, sourceSeq: 1n, mandatory: true },
+            { nodeId: "m2", tokenEstimate: 20, utility: 200, sourceSeq: 2n, mandatory: true },
+        ],
+        // Two mandatory nodes totalling 101 content tokens → over budget at 100.
+        "mandatory-101": [
+            { nodeId: "m1", tokenEstimate: 50, utility: 100, sourceSeq: 1n, mandatory: true },
+            { nodeId: "m2", tokenEstimate: 51, utility: 200, sourceSeq: 2n, mandatory: true },
+        ],
+        // Optional candidates: hi=10t/20u (ratio 2.0), mid=10t/10u (ratio 1.0), lo=10t/5u.
+        ratio: [
+            { nodeId: "hi", tokenEstimate: 10, utility: 20, sourceSeq: 1n, mandatory: false },
+            { nodeId: "mid", tokenEstimate: 10, utility: 10, sourceSeq: 2n, mandatory: false },
+            { nodeId: "lo", tokenEstimate: 10, utility: 5, sourceSeq: 3n, mandatory: false },
+        ],
+        // Equal ratios (1.0) → source seq tie-break (early=seq1 wins).
+        "tie-seq": [
+            { nodeId: "early", tokenEstimate: 10, utility: 10, sourceSeq: 1n, mandatory: false },
+            { nodeId: "late", tokenEstimate: 10, utility: 10, sourceSeq: 2n, mandatory: false },
+        ],
+        // Equal ratios AND equal source seq → lower ID bytes wins.
+        "tie-id": [
+            { nodeId: "bbb", tokenEstimate: 10, utility: 10, sourceSeq: 1n, mandatory: false },
+            { nodeId: "aaa", tokenEstimate: 10, utility: 10, sourceSeq: 1n, mandatory: false },
+        ],
+        // One indivisible optional node of 10t/10u: 0/1 means it is taken whole.
+        indivisible: [
+            { nodeId: "one", tokenEstimate: 10, utility: 10, sourceSeq: 1n, mandatory: false },
+        ],
+        // A zero-utility optional node must be omitted.
+        "zero-utility": [
+            { nodeId: "zero", tokenEstimate: 5, utility: 0, sourceSeq: 1n, mandatory: false },
+        ],
+        // An optional node incompatible with a mandatory node is omitted (the planner
+        // enforces `incompatiblePairs`; here `bad` is mutually exclusive with `m1`).
+        incompatible: [
+            { nodeId: "m1", tokenEstimate: 10, utility: 100, sourceSeq: 1n, mandatory: true },
+            { nodeId: "bad", tokenEstimate: 5, utility: 50, sourceSeq: 2n, mandatory: false },
+        ],
+        // Mixed: 2 mandatory + optional candidates exercising closure + selection.
+        mixed: [
+            { nodeId: "m1", tokenEstimate: 10, utility: 100, sourceSeq: 1n, mandatory: true },
+            { nodeId: "m2", tokenEstimate: 20, utility: 200, sourceSeq: 2n, mandatory: true },
+            { nodeId: "opt", tokenEstimate: 30, utility: 90, sourceSeq: 3n, mandatory: false },
+        ],
+    };
+    const set = sets[name];
+    assert.ok(set, `candidate-set materializer missing for "${name}"`);
+    return set;
+}
+function framing(zero) {
+    return zero ? { perNode: 0, overhead: 0 } : DEFAULT_FRAMING;
+}
+/**
+ * Drive a planner fixture scenario through the REAL portfolio planner. The
+ * `mandatoryTokenEstimate` is the VC4C CONTENT-ONLY figure = sum of mandatory
+ * content tokens (zero-framing fixtures make that the exact candidate sum).
+ */
+export function runPlannerScenario(fx) {
+    const { candidates: setName, tokenBudget, zeroFraming, permute, mutateTokensAfterPlan } = fx.input;
+    const cands = materializeCandidates(setName);
+    // VC4C content-only mandatory estimate = sum of mandatory content tokens.
+    const mandatoryTokenEstimate = cands
+        .filter((c) => c.mandatory)
+        .reduce((s, c) => s + c.tokenEstimate, 0);
+    const dagDigest = "deadbeef".repeat(8);
+    // The `incompatible` set wires an explicit mutual-exclusion pair (bad ⊥ m1) so
+    // the planner's incompatibility gate is exercised end-to-end.
+    const incompatiblePairs = setName === "incompatible" ? [["bad", "m1"]] : undefined;
+    const input = {
+        dagDigest,
+        candidates: permute ? shuffle([...cands]) : cands,
+        mandatoryTokenEstimate,
+        tokenBudget,
+        dependencyHighWater: 100n,
+        framing: framing(zeroFraming),
+        ...(incompatiblePairs ? { incompatiblePairs } : {}),
+    };
+    const res = planPortfolio(input);
+    if (fx.expected.permutationInvariant) {
+        const a = planPortfolio(input);
+        const b = planPortfolio({ ...input, candidates: shuffle([...cands]) });
+        const ids = (ok) => (ok.ok ? [...ok.plan.selectedNodeIds] : []);
+        return { ok: true, permutationInvariant: JSON.stringify(ids(a)) === JSON.stringify(ids(b)) };
+    }
+    if (!res.ok) {
+        // Over-budget failure: mandatory set preserved intact, demotes to C.
+        const mandatoryIds = cands.filter((c) => c.mandatory).map((c) => c.nodeId).sort();
+        const preserved = res.mandatory.slice().sort().join(",") === mandatoryIds.join(",");
+        return {
+            ok: false,
+            code: res.code,
+            mandatoryPreserved: preserved,
+            demotesToC: res.code === "MANDATORY_CLOSURE_OVER_BUDGET",
+        };
+    }
+    // ── Accepted-plan assertions ──
+    const plan = res.plan;
+    const selected = [...plan.selectedNodeIds];
+    const out = { ok: true, selected, tokenTotal: plan.tokenTotal };
+    if (fx.expected.firstSelected !== undefined)
+        out.firstSelected = selected[0];
+    if (fx.expected.withinBudget)
+        out.withinBudget = plan.tokenTotal <= tokenBudget;
+    if (fx.expected.noPartialSelection) {
+        out.noPartialSelection = cands.every((c) => !c.mandatory || selected.includes(c.nodeId));
+    }
+    if (fx.expected.planIsClosed) {
+        const mandatoryIds = cands.filter((c) => c.mandatory).map((c) => c.nodeId).sort();
+        out.planIsClosed = mandatoryIds.every((id) => selected.includes(id));
+    }
+    if (fx.expected.omittedOverBudget) {
+        const omit = plan.omissions.some((o) => o.reason === "over-budget");
+        out.omittedOverBudget = omit;
+    }
+    if (fx.expected.omittedZeroUtility) {
+        out.omittedZeroUtility = plan.omissions.some((o) => o.reason === "zero-utility");
+    }
+    if (fx.expected.omittedIncompatible) {
+        out.omittedIncompatible = plan.omissions.some((o) => o.reason === "incompatible");
+    }
+    // Manifest identity: a post-plan token mutation must fail revalidation.
+    if (mutateTokensAfterPlan) {
+        const pinned = planManifestDigest(plan, cands);
+        const mutated = cands.map((c, i) => (i === 0 ? { ...c, tokenEstimate: c.tokenEstimate + 1 } : c));
+        const check = validatePlanManifest(plan, mutated, pinned);
+        out.ok = check.ok; // false → plan rejected, never reaches provider
+        out.code = check.ok ? undefined : check.code;
+        return out;
+    }
+    if (fx.expected.manifestStable) {
+        const pinned = planManifestDigest(plan, cands);
+        const check = validatePlanManifest(plan, cands, pinned);
+        out.manifestStable = check.ok;
+    }
+    return out;
+}

package/dist/vector-cortex/prompt-dag/_acceptance-shuffle.js

@@ -0,0 +1,24 @@
+/**
+ * prompt-dag/_acceptance-shuffle.ts — small deterministic helpers shared by the
+ * VC5A acceptance DAG/planner materializers.
+ */
+/** Array element equality (length + pairwise). */
+export function eq(a, b) {
+    return a.length === b.length && a.every((v, i) => v === b[i]);
+}
+/**
+ * Fisher–Yates with a FIXED seed so permutation tests are reproducible across
+ * runs and machines (no Math.random in tests).
+ */
+export function shuffle(arr) {
+    const a = [...arr];
+    let seed = 0x9e3779b9;
+    for (let i = a.length - 1; i > 0; i--) {
+        seed = (seed * 1664525 + 1013904223) >>> 0;
+        const j = seed % (i + 1);
+        const t = a[i];
+        a[i] = a[j];
+        a[j] = t;
+    }
+    return a;
+}

package/dist/vector-cortex/prompt-dag/builder.js

@@ -0,0 +1,171 @@
+/**
+ * vector-cortex/prompt-dag/builder.ts — single-session PromptDagV1 construction
+ * (VC5A, task 2).
+ *
+ * The builder is the STRUCTURAL gate: it rejects a graph that could never be
+ * planned safely, before any ordering or selection is attempted. Rejections are
+ * hard and total (the sprint bar: "cycles/incompatibilities rejected 100%"):
+ *
+ *   - `DAG_MIXED_SESSION`        — a span whose sessionId differs from the DAG's.
+ *                                  Cross-session evidence MUST be a synthetic
+ *                                  node citing a separately validated manifest,
+ *                                  never a foreign span (CONTRACTS §PromptDagV1).
+ *   - `DAG_DUPLICATE_ID`         — two nodes sharing an id.
+ *   - `DAG_MISSING_ENDPOINT`     — an edge naming an absent node.
+ *   - `DAG_INVALID_SPAN`         — reversed/negative range, or a synthetic node
+ *                                  carrying a span (synthetics have no source
+ *                                  position by definition).
+ *   - `DAG_SPAN_DIGEST_CONFLICT` — two overlapping spans pinning DIFFERENT
+ *                                  digests for the same bytes: a corrupted or
+ *                                  forged source claim, not a legal overlap.
+ *   - `DAG_UNKNOWN_INCOMPATIBLE` — `incompatibleWith` naming an absent node.
+ *   - `DAG_TOOL_PAIR_SPLIT`      — a tool-pair edge whose endpoints are not both
+ *                                  present (PREVENT-PI-002).
+ *
+ * Cycle and reversed-`precedes` detection belong to the VALIDATOR, which owns
+ * the topological order; the builder only guarantees the graph is structurally
+ * well-formed and single-session.
+ *
+ * Determinism: nodes and edges are emitted in a canonical sorted order so the
+ * same inputs always produce byte-identical DAG bytes, whatever order the caller
+ * supplied them in. Pure: no storage, no console, no network (PREVENT-PI-004).
+ */
+/** Bytewise string comparison — the universal deterministic tie-break. */
+function byBytes(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+/**
+ * Canonical node order: source position first (`startSeq`, then `startByte`),
+ * synthetics last (they have no span), then `syntheticOrdinal`, then id bytes.
+ * This mirrors the validator's queue key so the emitted DAG and its topological
+ * order agree on what "earlier" means.
+ */
+export function compareNodes(a, b) {
+    const aSeq = a.span?.startSeq;
+    const bSeq = b.span?.startSeq;
+    if (aSeq !== undefined && bSeq !== undefined) {
+        if (aSeq !== bSeq)
+            return aSeq < bSeq ? -1 : 1;
+    }
+    else if (aSeq !== undefined) {
+        return -1; // spanned nodes precede synthetics
+    }
+    else if (bSeq !== undefined) {
+        return 1;
+    }
+    // Contract key: (startSeq, syntheticOrdinal, id bytes) — byte offset is NOT a
+    // tie-break, so the emitted DAG and its topological order agree exactly.
+    const aOrd = a.syntheticOrdinal ?? 0;
+    const bOrd = b.syntheticOrdinal ?? 0;
+    if (aOrd !== bOrd)
+        return aOrd < bOrd ? -1 : 1;
+    return byBytes(a.id, b.id);
+}
+/** Canonical edge order: from, then to, then kind — a total order. */
+export function compareEdges(a, b) {
+    const f = byBytes(a.from, b.from);
+    if (f !== 0)
+        return f;
+    const t = byBytes(a.to, b.to);
+    if (t !== 0)
+        return t;
+    return byBytes(a.kind, b.kind);
+}
+/** Whether two half-open byte ranges in the same session intersect. */
+function spansOverlap(a, b) {
+    if (a.sessionId !== b.sessionId)
+        return false;
+    return a.startByte < b.endByte && b.startByte < a.endByte;
+}
+/** A span is well-formed when both its seq and byte ranges are non-decreasing. */
+function spanIsValid(span) {
+    if (span.startSeq > span.endSeq)
+        return false;
+    if (span.startByte < 0 || span.endByte < 0)
+        return false;
+    return span.startByte <= span.endByte;
+}
+/** Push a failure code once (codes are a SET, reported in discovery order). */
+function pushCode(codes, code) {
+    if (!codes.includes(code))
+        codes.push(code);
+}
+/**
+ * Build a canonical single-session `PromptDagV1`, or reject with the exact
+ * structural failure codes (task 2).
+ *
+ * Every check runs before returning so a caller sees ALL structural problems at
+ * once rather than fixing them one round-trip at a time; the codes array is
+ * deduplicated and ordered by discovery.
+ */
+export function buildPromptDag(input) {
+    const codes = [];
+    // ── Node identity + span validity + single-session enforcement ─────────────
+    const byId = new Map();
+    for (const n of input.nodes) {
+        if (byId.has(n.id))
+            pushCode(codes, "DAG_DUPLICATE_ID");
+        else
+            byId.set(n.id, n);
+        if (n.kind === "synthetic") {
+            // A synthetic node has no source position by definition; carrying a span
+            // would make its ordering ambiguous against real source nodes.
+            if (n.span !== undefined)
+                pushCode(codes, "DAG_INVALID_SPAN");
+            continue;
+        }
+        if (n.span === undefined)
+            continue; // a spanless non-synthetic orders last
+        if (!spanIsValid(n.span))
+            pushCode(codes, "DAG_INVALID_SPAN");
+        // Single-session: cross-session evidence must be a synthetic citation.
+        if (n.span.sessionId !== input.sessionId)
+            pushCode(codes, "DAG_MIXED_SESSION");
+    }
+    // ── Overlapping spans must agree on the digest of the shared bytes ─────────
+    const spanned = input.nodes.filter((n) => n.span !== undefined);
+    for (let i = 0; i < spanned.length; i++) {
+        for (let j = i + 1; j < spanned.length; j++) {
+            const a = spanned[i];
+            const b = spanned[j];
+            if (!spansOverlap(a.span, b.span))
+                continue;
+            if (a.span.digest !== b.span.digest) {
+                pushCode(codes, "DAG_SPAN_DIGEST_CONFLICT");
+            }
+        }
+    }
+    // ── Incompatibility targets must exist ────────────────────────────────────
+    for (const n of input.nodes) {
+        for (const other of n.incompatibleWith) {
+            if (!byId.has(other))
+                pushCode(codes, "DAG_UNKNOWN_INCOMPATIBLE");
+        }
+    }
+    // ── Edge endpoints must exist; tool pairs must be whole ───────────────────
+    for (const e of input.edges) {
+        const hasFrom = byId.has(e.from);
+        const hasTo = byId.has(e.to);
+        if (!hasFrom || !hasTo) {
+            pushCode(codes, "DAG_MISSING_ENDPOINT");
+            // A tool pair missing an endpoint is ALSO a split pair (PREVENT-PI-002):
+            // the atomic unit cannot be represented, let alone selected whole.
+            if (e.kind === "tool-pair")
+                pushCode(codes, "DAG_TOOL_PAIR_SPLIT");
+        }
+    }
+    if (codes.length > 0)
+        return { ok: false, codes };
+    const nodes = [...input.nodes].sort(compareNodes);
+    const edges = [...input.edges].sort(compareEdges);
+    return {
+        ok: true,
+        dag: {
+            schema: "prompt-dag-v1",
+            sessionId: input.sessionId,
+            sourceHighWater: input.sourceHighWater,
+            nodes,
+            edges,
+        },
+    };
+}

package/dist/vector-cortex/prompt-dag/types.js

@@ -0,0 +1,33 @@
+/**
+ * vector-cortex/prompt-dag/types.ts — the exact single-session `PromptDagV1`
+ * schema (VC5A, task 1).
+ *
+ * A PromptDagV1 is the STRUCTURE a plan is selected over: nodes are prompt
+ * candidates (events, exact spans, semantic renderings, synthetic citations) and
+ * edges are the ordering/atomicity/exclusivity constraints among them. It is
+ * strictly SINGLE-SESSION (CONTRACTS §PromptDagV1): every node span MUST carry
+ * `dag.sessionId`; cross-session evidence is represented by a SYNTHETIC node
+ * whose payload cites a separately validated source manifest, never by a foreign
+ * span.
+ *
+ * Ordering is a total order by construction so the same DAG always yields the
+ * same Kahn sequence:
+ *
+ *   - event/exact/semantic nodes order by their source span (`startSeq`, then
+ *     `startByte`);
+ *   - synthetic nodes have NO span and sort after every prerequisite, then by
+ *     `syntheticOrdinal`, then by node-ID bytes;
+ *   - the zero-indegree queue key is `(span.startSeq ?? MAX, syntheticOrdinal ??
+ *     0, id bytes)` — never object/map iteration order.
+ *
+ * Pure types + registered conformance IDs: no storage, no console, no network
+ * (PREVENT-PI-004 / PREVENT-011).
+ */
+/**
+ * Registered DAG conformance ID range (DAG-001..030). The acceptance aggregator
+ * reads these rows from the v2 manifest and asserts each returns its manifest
+ * `ok`/`code`.
+ */
+export const DAG_IDS = Array.from({ length: 30 }, (_v, i) => `DAG-${String(i + 1).padStart(3, "0")}`);
+/** Named VC5A DAG conformance assertion (the sprint's headline DAG row). */
+export const DAG_NAMED_IDS = ["DAG-CYCLE-001"];

package/extensions/dashboard-client/dist/assets/{AreaChart-XF3jPpvn.js → AreaChart-Cam9-nhT.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-B6p2WnkY.js";import{R as p,F as ee,r as ve}from"./index-CFLekP12.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-XF3jPpvn.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-CvHKUdhX.js";import{R as p,F as ee,r as ve}from"./index-0Ye_un22.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-Cam9-nhT.js.map