pi-mega-compact 0.19.2 → 0.20.0

package/dist/vector-cortex/shards/semantic.js

@@ -0,0 +1,137 @@
+/**
+ * vector-cortex/shards/semantic.ts — semantic tier partition (VC4A, mode A/B).
+ *
+ * Partitions a session's canonical EventV2 stream into `SemanticShardV1`
+ * chunks, cutting ONLY at complete record boundaries. Every shard's `range`
+ * names the exact inclusive seq span and the half-open source byte window it
+ * covers in canonical stream order; a shard NEVER splits a record (or a tool
+ * call/result pair). Semantic shards carry DERIVED aggregate content (a
+ * deterministic digest + token estimate + byte/event counts) and never
+ * reproduce exact text — exact bytes are the exact tier's job.
+ *
+ * The partition is deterministic and size-bounded: it walks the sorted events,
+ * accrues each record's bytes, and closes a shard the moment adding the next
+ * complete record would exceed `targetSize`. A single record that is already
+ * over the budget gets its own shard (a shard is always at least one complete
+ * record, so over-budget records are never split).
+ *
+ * Triad: A = this semantic tier plus exact shards; B = the same range shape
+ * derived from extractive heads with the semantic encoder disabled (the caller
+ * may substitute the derived payload, since the range+digest contract is
+ * identical); C = exact anchors/current transcript only (no semantic shards at
+ * all, handled by the exact tier alone).
+ *
+ * Pure/deterministic: hashes + array walking only, no storage, no console, no
+ * network (PREVENT-PI-004 / PREVENT-011).
+ */
+import { createHash } from "node:crypto";
+/**
+ * Compute the canonical per-record byte offsets for a session's sorted events.
+ * Events are sorted by seq (ascending) defensively; the byte stream is the
+ * concatenation of each event's `originalBytes` in that order. A shared pure
+ * helper so semantic + exact tiers agree on source ranges (the two partitioning
+ * algorithms remain otherwise independent). Returns `undefined`-guarding lookup
+ * plus the total length; empty input yields an empty map with total 0.
+ */
+export function cumulativeOffsets(events) {
+    const map = new Map();
+    let off = 0;
+    const sorted = [...events].sort((a, b) => (a.seq < b.seq ? -1 : a.seq > b.seq ? 1 : 0));
+    for (const e of sorted) {
+        const len = e.originalBytes.length;
+        map.set(e.seq.toString(), { byteStart: off, byteEnd: off + len });
+        off += len;
+    }
+    return {
+        of: (seq) => map.get(seq.toString()),
+        total: off,
+    };
+}
+/** Approximate token count for a valid UTF-8 text (whitespace-separated runs). */
+function approxTokens(text) {
+    if (text.length === 0)
+        return 0;
+    const runs = text.match(/\S+/g);
+    return runs ? runs.length : 0;
+}
+/** Deterministic SHARD digest over a semantic shard's derived payload. */
+function sealedSemanticDigest(sessionId, events, range, tokenEstimate) {
+    const h = createHash("sha256");
+    h.update(`semantic-shard-v1|${sessionId}|`);
+    h.update(`${range.seqStart.toString()}|${range.seqEnd.toString()}|`);
+    h.update(`${range.byteStart}|${range.byteEnd}|`);
+    h.update(`${tokenEstimate}|`);
+    // One `~`-joined run of the covered records' authoritative byte digests in
+    // seq order, so the shard digest depends on exactly which records it covers.
+    for (const e of [...events].sort((a, b) => (a.seq < b.seq ? -1 : a.seq > b.seq ? 1 : 0))) {
+        h.update(`${e.seq.toString()}:${e.bytesDigest}~`);
+    }
+    return `sha256:${h.digest("hex")}`;
+}
+/**
+ * Partition the semantic tier (task 2). Returns `ok:true` with a list of
+ * `SemanticShardV1` whose (sorted) ranges are contiguous, non-overlapping and
+ * jointly cover every event exactly once. Failures are defensive: a non-positive
+ * or non-finite `targetSize` rejects with `SHD_INVALID_TARGET_SIZE`; mixed-session
+ * events reject with `SHD_CROSS_SESSION`.
+ */
+export function partitionSemantic(input) {
+    const { sessionId, events, targetSize } = input;
+    if (!Number.isFinite(targetSize) || targetSize <= 0) {
+        return { ok: false, code: "SHD_INVALID_TARGET_SIZE" };
+    }
+    if (events.some((e) => e.sessionId !== sessionId)) {
+        return { ok: false, code: "SHD_CROSS_SESSION" };
+    }
+    const offsets = cumulativeOffsets(events);
+    const sorted = [...events].sort((a, b) => (a.seq < b.seq ? -1 : a.seq > b.seq ? 1 : 0));
+    if (sorted.length === 0)
+        return { ok: true, shards: [] };
+    const shards = [];
+    let batch = [];
+    let batchBytes = 0;
+    let batchTokens = 0;
+    const flush = () => {
+        if (batch.length === 0)
+            return;
+        const first = batch[0];
+        const last = batch[batch.length - 1];
+        const start = offsets.of(first.seq);
+        const end = offsets.of(last.seq);
+        const byteStart = start ? start.byteStart : 0;
+        const byteEnd = end ? end.byteEnd : byteStart;
+        const tokenEstimate = batchTokens;
+        shards.push({
+            schema: "semantic-shard-v1",
+            sessionId,
+            range: {
+                sessionId,
+                seqStart: first.seq,
+                seqEnd: last.seq,
+                byteStart,
+                byteEnd,
+            },
+            kind: "semantic",
+            digest: sealedSemanticDigest(sessionId, batch, { seqStart: first.seq, seqEnd: last.seq, byteStart, byteEnd }, tokenEstimate),
+            byteCount: batchBytes,
+            eventCount: batch.length,
+            tokenEstimate,
+        });
+        batch = [];
+        batchBytes = 0;
+        batchTokens = 0;
+    };
+    for (const e of sorted) {
+        const len = e.originalBytes.length;
+        const tokens = e.utf8.valid ? approxTokens(e.utf8.text) : Math.ceil(len / 4);
+        // A batch that already has a complete record and would exceed the budget
+        // (and the next record itself fits, or it doesn't) closes at a boundary.
+        if (batch.length > 0 && batchBytes + len > targetSize)
+            flush();
+        batch.push(e);
+        batchBytes += len;
+        batchTokens += tokens;
+    }
+    flush();
+    return { ok: true, shards };
+}

package/dist/vector-cortex/shards/types.js

@@ -0,0 +1,51 @@
+/**
+ * vector-cortex/shards/types.ts — dual-tier shard contract (VC4A).
+ *
+ * Owns `SemanticShardV1` / `ExactShardV1` / `ShardManifestV1` — the shared
+ * partition contract of the sprint failure triad:
+ *
+ *   A = semantic + exact shards (normal path);
+ *   B = extractive + exact shards with the semantic encoder disabled;
+ *   C = exact anchors/current transcript only.
+ *
+ * A session's canonical byte stream is partitioned ONLY at complete EventV2
+ * record boundaries (VC1A byte authority — an EventV2's `originalBytes` + its
+ * SHA-256 `bytesDigest` are authoritative, invalid UTF-8 is never normalized).
+ * A `ShardRange` names a contiguous run of complete records by inclusive
+ * seq `[seqStart..seqEnd]` and by the half-open source byte range
+ * `[byteStart, byteEnd)` they occupy in canonical stream order (record `seq`
+ * carries every byte from `offset(seq)` to `offset(seq)+len(seq)`).
+ *
+ * Semantic shards carry derived aggregate vectors/token estimates and NEVER
+ * reproduce exact text (the RESIDUAL_CODEC / exact-payload shards own exact
+ * bytes). Exact shards carry the EXACT original bytes, unchanged, for the
+ * protected spans: every tool call/result pair, every anchor, and every invalid
+ * UTF-8 event (SHD-UTF8-002 — invalid bytes are exact-only and never
+ * normalized/re-encoded). A tool call/result pair that straddles a target-size
+ * boundary stays in ONE exact shard (SHD-PAIR-001).
+ *
+ * Consumes only reviewer-accepted predecessor contracts (VC1A EventV2) and the
+ * [common contracts](../../../../docs/vector-cortex/CONTRACTS.md). Pure
+ * types/schema + small predicates: no storage, no console, no network
+ * (PREVENT-PI-004 / PREVENT-011). The acceptance contract and the conformance
+ * IDs (SHD-001..020 + named SHD-PAIR-001 / SHD-UTF8-002 / SHD-RANGE-003) live
+ * here.
+ */
+/**
+ * Registered SHD conformance ID range (SHD-001..020). The acceptance test reads
+ * these rows from the v2 manifest and asserts each returns its manifest
+ * `ok`/`code`. The named assertions (SHD-PAIR-001 / SHD-UTF8-002 /
+ * SHD-RANGE-003) live in the acceptance test.
+ */
+export const SHD_IDS = [
+    "SHD-001", "SHD-002", "SHD-003", "SHD-004", "SHD-005",
+    "SHD-006", "SHD-007", "SHD-008", "SHD-009", "SHD-010",
+    "SHD-011", "SHD-012", "SHD-013", "SHD-014", "SHD-015",
+    "SHD-016", "SHD-017", "SHD-018", "SHD-019", "SHD-020",
+];
+/** Named SHD conformance assertions. */
+export const SHD_NAMED_IDS = [
+    "SHD-PAIR-001",
+    "SHD-UTF8-002",
+    "SHD-RANGE-003",
+];

package/dist/vector-cortex/topology/query.js

@@ -0,0 +1,342 @@
+/**
+ * vector-cortex/topology/query.ts — topology query + router invalidation (VC3C).
+ *
+ * Owns `RouterKeyV2` (the structured router key) and `TopologyQueryV1` (the
+ * generation query/index surface that serves graphs and invalidates stale
+ * generations). This is the degradation seam of the sprint's failure triad:
+ *
+ *   A = topology index at current generation (serve the active graph);
+ *   B = fresh linear scan forced when a key targets a STALE generation;
+ *   C = authority sequence scan forced when the derived store is unavailable.
+ *
+ * Key encoding is length-delimited with unsigned-byte (prefix) ordering and a
+ * FIXED five-field arity, so no field value can ambiguously prefix another and
+ * two sessions `a` / `aa` can never prefix-collide at the key level
+ * (M6-KEY-001). Invalidation matches the exact `(session,generation)` identity
+ * bytes — never a string-prefix — and a query whose key carries a generation
+ * older than the session's active one is rejected with `TOP_GENERATION_STALE`
+ * (M6-STALE-002), which forces mode B.
+ *
+ * Pure src/ logic over an injected `TopologyQueryHost` (the source of graphs +
+ * linear/authority scans) and an optional `TopologyQueryEmit`. Deterministic,
+ * pi-agnostic, no console, no network (PREVENT-PI-004), no `any`
+ * (PREVENT-011). The caller owns durability; every store write on the caller
+ * side is best-effort and never breaks the agent loop.
+ */
+import { createHash } from "node:crypto";
+/** Query rejected: the key's generation is stale relative to the active one. */
+export const TOP_GENERATION_STALE = "TOP_GENERATION_STALE";
+/** Query rejected: a key could not be decoded (malformed length-delimited bytes). */
+export const TOP_KEY_DECODE_FAILED = "TOP_KEY_DECODE_FAILED";
+/** Query rejected: the derived store is unavailable and no authority scan is possible. */
+export const TOP_AUTHORITY_UNAVAILABLE = "TOP_AUTHORITY_UNAVAILABLE";
+/** Frozen router key schema version carried in every encoded key. */
+export const ROUTER_KEY_VERSION = 2;
+/**
+ * Create the query surface. `emit` is optional and flag-gated (the caller passes
+ * a reporter produced by the same pattern VC3A/VC3B use — zero emissions when
+ * `MEGACOMPACT_VC3C=0`, byte-identical to the predecessor). Pure in-memory index
+ * over the injected host; durability of invalidation is the caller's job.
+ */
+export function createTopologyQuery(host, emit) {
+    // session -> Set of indexed generation strings (exact, byte-identity).
+    const generations = new Map();
+    const fire = (event, fields) => {
+        if (!emit)
+            return;
+        try {
+            emit(event, fields);
+        }
+        catch {
+            /* non-fatal observability — never break the agent loop */
+        }
+    };
+    const query = (key) => {
+        const active = host.activeGeneration(key.session);
+        // Mode C: derived store unavailable -> authority sequence scan.
+        if (!host.derivedAvailable(key.session)) {
+            const cDigest = host.authorityScan(key.session, key.sourceStart, key.sourceEnd);
+            if (cDigest === undefined) {
+                return { ok: false, code: TOP_AUTHORITY_UNAVAILABLE, mode: "C" };
+            }
+            fire("vector_cortex_topology_query_demoted", {
+                session: key.session,
+                generation: key.generation.toString(),
+                code: "DERIVED_UNAVAILABLE",
+                toMode: "C",
+            });
+            return {
+                ok: true,
+                mode: "C",
+                session: key.session,
+                generation: key.generation,
+                algorithm: key.algorithm,
+                matchedKey: encodeRouterKeyV2(key),
+                digest: cDigest.digest,
+            };
+        }
+        // A key is stale when its generation is below the active one (or the active
+        // generation is unset and the requested generation is non-zero).
+        const stale = active === undefined
+            ? key.generation !== 0n
+            : key.generation < active;
+        if (stale) {
+            // Mode B: fresh linear scan forced by a stale A key.
+            const bDigest = host.linearScan(key.session, key.sourceStart, key.sourceEnd);
+            fire("vector_cortex_topology_query_demoted", {
+                session: key.session,
+                generation: key.generation.toString(),
+                activeGeneration: active === undefined ? null : active.toString(),
+                code: "STALE_GENERATION",
+                toMode: "B",
+            });
+            return {
+                ok: true,
+                mode: "B",
+                session: key.session,
+                generation: key.generation,
+                algorithm: key.algorithm,
+                matchedKey: encodeRouterKeyV2(key),
+                digest: bDigest.digest,
+            };
+        }
+        // Mode A: topology index at the current generation. If the derived store is
+        // up but has not indexed this exact (generation, algorithm) yet, that is a
+        // mode-A miss (no graph to serve) — force the fresh linear scan rather than
+        // fabricate a graph or report a false staleness (Q03: the index cannot be
+        // trusted to hold every current generation; B recomputes from source).
+        const graph = host.graphAt(key.session, key.generation, key.algorithm);
+        if (graph === undefined) {
+            const bDigest = host.linearScan(key.session, key.sourceStart, key.sourceEnd);
+            fire("vector_cortex_topology_query_demoted", {
+                session: key.session,
+                generation: key.generation.toString(),
+                code: "GENERATION_MISS",
+                toMode: "B",
+            });
+            return {
+                ok: true,
+                mode: "B",
+                session: key.session,
+                generation: key.generation,
+                algorithm: key.algorithm,
+                matchedKey: encodeRouterKeyV2(key),
+                digest: bDigest.digest,
+            };
+        }
+        return {
+            ok: true,
+            mode: "A",
+            session: key.session,
+            generation: key.generation,
+            algorithm: key.algorithm,
+            matchedKey: encodeRouterKeyV2(key),
+            digest: graph.digest,
+        };
+    };
+    const invalidate = (session, generation) => {
+        const invalidationIdentity = invalidationKey(session, generation);
+        const set = generations.get(session);
+        if (set)
+            set.delete(invalidationIdentity);
+        fire("vector_cortex_router_generation_invalidated", {
+            session,
+            generation: generation.toString(),
+            key: invalidationIdentity,
+        });
+    };
+    const generationalCount = (session) => {
+        return generations.get(session)?.size ?? 0;
+    };
+    return { query, invalidate, generationalCount };
+}
+// ---------------------------------------------------------------------------
+// Length-delimited, unsigned-byte-ordered key encoding (M6-KEY-001)
+// ---------------------------------------------------------------------------
+/**
+ * Encode one field: `u32BE(byteLength) || bytes`. Non-negative numbers are
+ * encoded as their unsigned big-endian byte form (leading zeros trimmed). This
+ * is the standard big-endian length-prefixed encoding: two fields compare in
+ * unsigned-byte order exactly as their values do, and no value is an ambiguous
+ * prefix of another.
+ */
+function encodeLengthDelimited(bytes) {
+    const out = new Uint8Array(4 + bytes.length);
+    const view = new DataView(out.buffer);
+    view.setUint32(0, bytes.length, false);
+    out.set(bytes, 4);
+    return out;
+}
+/** Big-endian unsigned bytes of a non-negative bigint (length-prefixed below). */
+function bigintBytes(n) {
+    let v = n;
+    const out = [];
+    if (v === 0n)
+        return new Uint8Array([0]);
+    while (v > 0n) {
+        out.unshift(Number(v & 0xffn));
+        v >>= 8n;
+    }
+    return Uint8Array.from(out);
+}
+/** UTF-8 bytes of a string. */
+function strBytes(s) {
+    return new TextEncoder().encode(s);
+}
+function concat(parts) {
+    let len = 0;
+    for (const p of parts)
+        len += p.length;
+    const out = new Uint8Array(len);
+    let off = 0;
+    for (const p of parts) {
+        out.set(p, off);
+        off += p.length;
+    }
+    return out;
+}
+/**
+ * Encode a RouterKeyV2 into its canonical, length-delimited, unsigned-byte-ordered
+ * byte form. Version-prefixed (1 byte) + five length-delimited fields in fixed
+ * order (session, sourceStart, sourceEnd, generation, algorithm). Fixed arity +
+ * length-delimiting means no key is a strict prefix of another and sessions `a`
+ * and `aa` never collide (M6-KEY-001).
+ */
+export function encodeRouterKeyV2(key) {
+    const version = Uint8Array.of(ROUTER_KEY_VERSION);
+    const session = encodeLengthDelimited(strBytes(key.session));
+    const sourceStart = encodeLengthDelimited(bigintBytes(key.sourceStart));
+    const sourceEnd = encodeLengthDelimited(bigintBytes(key.sourceEnd));
+    const generation = encodeLengthDelimited(bigintBytes(key.generation));
+    const algorithm = encodeLengthDelimited(strBytes(key.algorithm));
+    return "rk2:" + Buffer.from(concat([version, session, sourceStart, sourceEnd, generation, algorithm])).toString("hex");
+}
+/**
+ * Decode a RouterKeyV2 from its canonical byte form. Returns
+ * TOP_KEY_DECODE_FAILED on malformed bytes (bad version, truncated length, or
+ * trailing garbage). Never parses by string prefix.
+ */
+export function decodeRouterKeyV2(encoded) {
+    if (!encoded.startsWith("rk2:"))
+        return { ok: false, code: "TOP_KEY_DECODE_FAILED" };
+    const hex = encoded.slice(4);
+    if (!/^[0-9a-f]*$/.test(hex) || hex.length % 2 !== 0) {
+        return { ok: false, code: "TOP_KEY_DECODE_FAILED" };
+    }
+    const buf = Buffer.from(hex, "hex");
+    const bytes = new Uint8Array(buf);
+    const reader = new Reader(bytes);
+    const version = reader.u8();
+    if (version !== ROUTER_KEY_VERSION)
+        return { ok: false, code: "TOP_KEY_DECODE_FAILED" };
+    const sessionBytes = reader.lenPrefixed();
+    const ssBytes = reader.lenPrefixed();
+    const seBytes = reader.lenPrefixed();
+    const genBytes = reader.lenPrefixed();
+    const algoBytes = reader.lenPrefixed();
+    if (reader.remaining() !== 0)
+        return { ok: false, code: "TOP_KEY_DECODE_FAILED" };
+    if (sessionBytes === null || ssBytes === null || seBytes === null || genBytes === null || algoBytes === null) {
+        return { ok: false, code: "TOP_KEY_DECODE_FAILED" };
+    }
+    const session = new TextDecoder().decode(sessionBytes);
+    const sourceStart = bytesToBigint(ssBytes);
+    const sourceEnd = bytesToBigint(seBytes);
+    const generation = bytesToBigint(genBytes);
+    const algorithm = new TextDecoder().decode(algoBytes);
+    return { ok: true, key: { session, sourceStart, sourceEnd, generation, algorithm } };
+}
+/** Sequential length-delimited byte reader. */
+class Reader {
+    bytes;
+    off = 0;
+    constructor(bytes) {
+        this.bytes = bytes;
+    }
+    u8() {
+        const v = this.bytes[this.off];
+        this.off += 1;
+        return v;
+    }
+    lenPrefixed() {
+        if (this.off + 4 > this.bytes.length)
+            return null;
+        const view = new DataView(this.bytes.buffer, this.bytes.byteOffset + this.off, 4);
+        const len = view.getUint32(0, false);
+        this.off += 4;
+        if (this.off + len > this.bytes.length)
+            return null;
+        const out = this.bytes.slice(this.off, this.off + len);
+        this.off += len;
+        return out;
+    }
+    remaining() {
+        return this.bytes.length - this.off;
+    }
+}
+/** Non-negative bigint from its unsigned big-endian bytes. */
+function bytesToBigint(bytes) {
+    let n = 0n;
+    for (const b of bytes)
+        n = (n << 8n) | BigInt(b);
+    return n;
+}
+/**
+ * Canonical invalidation identity for an exact (session,generation) pair, using
+ * the SAME length-delimited scheme so two pairs can only match by exact byte
+ * equality (never by string prefix — `a` never matches `aa`). Returned as hex
+ * for use as a registry key.
+ */
+export function invalidationKey(session, generation) {
+    const sessionF = encodeLengthDelimited(strBytes(session));
+    const genF = encodeLengthDelimited(bigintBytes(generation));
+    return "inv:" + Buffer.from(concat([sessionF, genF])).toString("hex");
+}
+/** One deterministic SHA-256 (hex) digest over the canonical key bytes. */
+export function keyDigest(key) {
+    return `sha256:${createHash("sha256").update(Buffer.from(encodeRouterKeyV2(key).slice(4), "hex")).digest("hex")}`;
+}
+/**
+ * Shared invalidation-capability seam (narrow delegate, no routing rewrite).
+ * Records the EXACT (session,generation) identity and, when `enabled`, best-effort
+ * emits `vector_cortex_router_generation_invalidated`. Falsy `enabled` (flag OFF)
+ * is a strict no-op so the predecessor keying is byte-identical to pre-sprint.
+ * Exactness is enforced by `invalidationKey` (length-delimited, never a string
+ * prefix — `a` never matches `aa`), the same identity M6 validates.
+ */
+export function routerGenerationInvalidationSeam(key, enabled, emit) {
+    if (!enabled)
+        return;
+    const identity = invalidationKey(key.session, key.generation);
+    if (emit) {
+        try {
+            emit("vector_cortex_router_generation_invalidated", {
+                session: key.session,
+                generation: key.generation.toString(),
+                key: identity,
+            });
+        }
+        catch {
+            /* non-fatal observability — never break the agent loop */
+        }
+    }
+}
+/** Registered TOP query conformance ID range (TOP-021..030). */
+export const TOP_QUERY_IDS = [
+    "TOP-021",
+    "TOP-022",
+    "TOP-023",
+    "TOP-024",
+    "TOP-025",
+    "TOP-026",
+    "TOP-027",
+    "TOP-028",
+    "TOP-029",
+    "TOP-030",
+];
+/** Registered named TOP-query conformance IDs. */
+export const TOP_QUERY_NAMED_IDS = [
+    "TOP-QUERY-003",
+    "M6-KEY-001",
+    "M6-STALE-002",
+];

package/extensions/dashboard-client/dist/assets/{AreaChart-CSaJZXru.js → AreaChart-n4z5w9Ox.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-vgeOQU3L.js";import{R as p,F as ee,r as ve}from"./index-lVrWQjpu.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-CSaJZXru.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-sZ6ZNtBi.js";import{R as p,F as ee,r as ve}from"./index-CX9zv8cJ.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-n4z5w9Ox.js.map