pi-mega-compact 0.19.3 → 0.20.1

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

@@ -0,0 +1,134 @@
+/**
+ * vector-cortex/shards/exact.ts — exact tier partition (VC4A).
+ *
+ * Carves the session's PROTECTED spans — every tool call/result pair, every
+ * anchor, every invalid UTF-8 event — into `ExactShardV1` payloads of the
+ * ORIGINAL bytes, verbatim and never normalized (SHD-UTF8-002: invalid bytes
+ * are exact-only and preserved unchanged — the codec's strict-fatal classifier
+ * means an invalid event has no lossy text to re-encode; we copy `originalBytes`
+ * directly). Each protected span is ATOMIC: a tool call/result pair is one
+ * `ProtectedSpan`, so no exact shard EVER splits a pair, even when the pair
+ * straddles the target-size boundary (SHD-PAIR-001).
+ *
+ * The partition walks the protected spans in canonical stream order (ascending
+ * first-seq), accrues each span's bytes, and closes an exact shard the moment
+ * adding the next atomic span would exceed `targetSize`. A single span over the
+ * budget still occupies exactly one shard — the pair case never splits.
+ *
+ * Triad: A = used with the semantic tier; B = the same exact spans preserved
+ * alongside extractive-derived semantic content; C = exact anchors/current
+ * transcript ONLY (this partition alone, with zero semantic shards).
+ *
+ * Pure/deterministic: hashes + array walking only, no storage, no console, no
+ * network (PREVENT-PI-004 / PREVENT-011).
+ */
+import { createHash } from "node:crypto";
+import { cumulativeOffsets } from "./semantic.js";
+/** Deterministic exact-shard digest over the verbatim original bytes. */
+function sealExactDigest(sessionId, bytes) {
+    const h = createHash("sha256");
+    h.update(`exact-shard-v1|${sessionId}|`);
+    h.update(bytes);
+    return `sha256:${h.digest("hex")}`;
+}
+/** Combine per-span cases into one shard case (invalid dominates, then tool-pair). */
+function combineCase(span, acc) {
+    if (span.case === "invalid-utf8" || acc === "invalid-utf8")
+        return "invalid-utf8";
+    if (span.case === "tool-pair" || acc === "tool-pair")
+        return "tool-pair";
+    return "anchor";
+}
+/** Concatenate an ordered group of events' original bytes, verbatim. */
+function concatBytes(events) {
+    let len = 0;
+    for (const e of events)
+        len += e.originalBytes.length;
+    const out = new Uint8Array(len);
+    let off = 0;
+    for (const e of events) {
+        out.set(e.originalBytes, off);
+        off += e.originalBytes.length;
+    }
+    return out;
+}
+/**
+ * Partition the exact tier (task 3). Returns `ok:true` with a list of
+ * `ExactShardV1` whose (sorted) ranges are contiguous, non-overlapping and
+ * jointly cover every protected span exactly once, each preserving the original
+ * bytes verbatim. Defensive failures mirror the semantic tier: a bad target size
+ * rejects with `SHD_INVALID_TARGET_SIZE`; a protected span referencing an event
+ * outside the session's stream, or a mixed-session span, rejects with
+ * `SHD_CROSS_SESSION`.
+ */
+export function partitionExact(input) {
+    const { sessionId, events, protectedSpans, targetSize } = input;
+    if (!Number.isFinite(targetSize) || targetSize <= 0) {
+        return { ok: false, code: "SHD_INVALID_TARGET_SIZE" };
+    }
+    const stream = new Set(events.map((e) => e.seq.toString()));
+    for (const span of protectedSpans) {
+        if (span.events.some((e) => e.sessionId !== sessionId || !stream.has(e.seq.toString()))) {
+            return { ok: false, code: "SHD_CROSS_SESSION" };
+        }
+    }
+    const offsets = cumulativeOffsets(events);
+    if (protectedSpans.length === 0)
+        return { ok: true, shards: [] };
+    // Process protected spans in canonical stream order (ascending first-seq;
+    // equal first-seq preserves input order for determinism).
+    const ordered = [...protectedSpans].sort((a, b) => {
+        const as = a.events.length ? a.events[0].seq : 0n;
+        const bs = b.events.length ? b.events[0].seq : 0n;
+        return as < bs ? -1 : as > bs ? 1 : 0;
+    });
+    const shards = [];
+    let batch = [];
+    let batchBytes = 0;
+    let batchCase = "anchor";
+    const spanBytes = (s) => s.events.reduce((n, e) => n + e.originalBytes.length, 0);
+    const flush = () => {
+        if (batch.length === 0)
+            return;
+        const first = batch[0];
+        const last = batch[batch.length - 1];
+        const firstEv = first.events[0];
+        const lastEv = last.events[last.events.length - 1];
+        const start = offsets.of(firstEv.seq);
+        const end = offsets.of(lastEv.seq);
+        const byteStart = start ? start.byteStart : 0;
+        const byteEnd = end ? end.byteEnd : byteStart;
+        const bytes = concatBytes(batch.flatMap((s) => s.events));
+        shards.push({
+            schema: "exact-shard-v1",
+            sessionId,
+            range: {
+                sessionId,
+                seqStart: firstEv.seq,
+                seqEnd: lastEv.seq,
+                byteStart,
+                byteEnd,
+            },
+            kind: "exact",
+            originalBytes: bytes,
+            digest: sealExactDigest(sessionId, bytes),
+            byteCount: batchBytes,
+            case: batchCase,
+        });
+        batch = [];
+        batchBytes = 0;
+        batchCase = "anchor";
+    };
+    for (const span of ordered) {
+        const sz = spanBytes(span);
+        // Close at a complete-span boundary when adding this atomic span would
+        // exceed the budget and we already hold at least one complete span.
+        if (batch.length > 0 && batchBytes + sz > targetSize)
+            flush();
+        batch.push(span);
+        batchBytes += sz;
+        batchCase = combineCase(span, batchCase);
+    }
+    flush();
+    return { ok: true, shards };
+}

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

@@ -0,0 +1,237 @@
+/**
+ * vector-cortex/shards/manifest.ts — shard manifest assembly + validation (VC4A).
+ *
+ * Owns `assembleShardManifest` (the deterministic build) and
+ * `validateShardManifest` (task 4). The builder takes the already-partitioned
+ * semantic + exact tiers plus the protected spans and emits a `ShardManifestV1`
+ * whose ranges are disjoint and sorted by `(seqStart, byteStart)`. The validator
+ * enforces the two structural rules the sprint acceptance pins:
+ *
+ *   - SHD_RANGE_OVERLAP — any two manifest shard ranges (semantic or exact)
+ *     overlap in the session byte stream;
+ *   - SHD_PROTECTED_GAP  — the exact shards do not cover every protected byte
+ *     exactly once (a protected span is unterminated by an exact shard, or an
+ *     exact shard covers a byte no protected span claims).
+ *
+ * Emits `vector_cortex_shard_manifest_built` on a successful assembly and
+ * `vector_cortex_protected_span_rejected` when validation fails, via the same
+ * flag-gated reporter pattern VC3A/VC3B/VC3C use (`MEGACOMPACT_VC4A=0` emits
+ * nothing — byte-identical predecessor).
+ *
+ * Pure/deterministic: hashes + range math only, no storage, no console, no
+ * network (PREVENT-PI-004 / PREVENT-011).
+ */
+import { createHash } from "node:crypto";
+import { VC4A_ENABLED } from "../../config/vector-cortex.js";
+/** A manifest shard's range, normalized for sorting / digest purposes. */
+function rangeKey(r) {
+    return `${r.seqStart.toString()},${r.byteStart}`;
+}
+/**
+ * Merge byte intervals into disjoint, sorted intervals (half-open). Overlapping
+ * AND touching intervals merge into one — this produces the "union" used for
+ * coverage math, never used to hide an overlap (overlap is checked separately in
+ * `hasOverlap` before any merging).
+ */
+function mergeIntervals(ranges) {
+    const sorted = [...ranges]
+        .map((r) => ({ start: r.byteStart, end: r.byteEnd }))
+        .sort((a, b) => (a.start !== b.start ? a.start - b.start : a.end - b.end));
+    const out = [];
+    for (const iv of sorted) {
+        const last = out[out.length - 1];
+        if (last !== undefined && iv.start <= last.end) {
+            out[out.length - 1] = { start: last.start, end: Math.max(last.end, iv.end) };
+            continue;
+        }
+        out.push(iv);
+    }
+    return out;
+}
+/** Difference: the bytes of `base` intervals NOT covered by `cover` intervals. */
+function subtractCover(base, cover) {
+    const ordered = cover
+        .slice()
+        .sort((a, b) => (a.start !== b.start ? a.start - b.start : a.end - b.end));
+    const gaps = [];
+    for (const iv of base) {
+        let cursor = iv.start;
+        for (const c of ordered) {
+            if (c.end <= cursor)
+                continue;
+            if (c.start > cursor) {
+                gaps.push({ start: cursor, end: Math.min(c.start, iv.end) });
+                if (c.start >= iv.end)
+                    break;
+            }
+            cursor = Math.max(cursor, c.end);
+            if (cursor >= iv.end)
+                break;
+        }
+        if (cursor < iv.end)
+            gaps.push({ start: cursor, end: iv.end });
+    }
+    return gaps;
+}
+/** True when any two ranges overlap (share at least one byte). */
+function hasOverlap(ranges) {
+    const sorted = [...ranges].sort((a, b) => (a.byteStart !== b.byteStart ? a.byteStart - b.byteStart : a.byteEnd - b.byteEnd));
+    for (let i = 1; i < sorted.length; i++) {
+        const prev = sorted[i - 1];
+        const cur = sorted[i];
+        if (cur.byteStart < prev.byteEnd)
+            return true;
+    }
+    return false;
+}
+/**
+ * Validate a manifest (task 4). Disjointness is a PER-TIER property: semantic
+ * shard ranges must be pairwise disjoint among themselves, and exact shard
+ * ranges pairwise disjoint among themselves (else `SHD_RANGE_OVERLAP`). The two
+ * tiers are NOT disjoint from each other — exact shards are a verbatim SUBSET of
+ * the semantic stream's bytes (a protected tool-pair's bytes are part of the
+ * semantic content), so a semantic range and an exact range overlapping is
+ * expected and correct. The cross-tier property is complete protected-span
+ * coverage: the exact shards must tile every protected span byte exactly once,
+ * no gap and no extra coverage (else `SHD_PROTECTED_GAP`). A manifest missing
+ * protected spans is malformed (`SHD_PROTECTED_GAP`). `generationDigest` is NOT
+ * verified here (it is a deterministic projection; the caller verifies it
+ * against the rebuilt digest).
+ */
+export function validateShardManifest(manifest) {
+    // Disjointness is enforced within each tier separately. An exact shard sitting
+    // inside a semantic shard is legitimate (exact ⊂ semantic).
+    if (hasOverlap(manifest.semantic.map((s) => s.range))) {
+        return { ok: false, code: "SHD_RANGE_OVERLAP" };
+    }
+    if (hasOverlap(manifest.exact.map((s) => s.range))) {
+        return { ok: false, code: "SHD_RANGE_OVERLAP" };
+    }
+    const protectedUnion = mergeIntervals(manifest.protectedSpans);
+    const exactUnion = mergeIntervals(manifest.exact.map((s) => s.range));
+    // Every protected byte must be covered by at least one exact shard (no gap),
+    // and no exact byte may fall outside the protected union (no extra coverage).
+    const gaps = subtractCover(protectedUnion, exactUnion);
+    const extras = subtractCover(exactUnion, protectedUnion);
+    if (gaps.length > 0 || extras.length > 0) {
+        return { ok: false, code: "SHD_PROTECTED_GAP" };
+    }
+    return { ok: true };
+}
+/**
+ * Deterministic manifest digest over a shard set — order-independent because it
+ * hashes the shards sorted by `(kind, seqStart, byteStart, digest)` (never input
+ * order). One SHA-256 over the canonical parts; the caller compares it against
+ * the stored `generationDigest`.
+ */
+export function shardManifestDigest(sessionId, sourceHighWater, semantic, exact) {
+    const rows = [
+        ...semantic.map((s) => ["semantic", s.range, s.digest]),
+        ...exact.map((s) => ["exact", s.range, s.digest]),
+    ].sort((a, b) => {
+        if (a[0] !== b[0])
+            return a[0] < b[0] ? -1 : 1;
+        const rk = rangeKey(a[1]);
+        const rk2 = rangeKey(b[1]);
+        return rk !== rk2 ? (rk < rk2 ? -1 : 1) : a[2] < b[2] ? -1 : a[2] > b[2] ? 1 : 0;
+    });
+    const h = createHash("sha256");
+    h.update(`shard-manifest-v1|${sessionId}|${sourceHighWater.toString()}|`);
+    for (const [kind, r, digest] of rows) {
+        h.update(`${kind}|${r.seqStart.toString()}|${r.seqEnd.toString()}|${r.byteStart}|${r.byteEnd}|${digest}~`);
+    }
+    return `sha256:${h.digest("hex")}`;
+}
+/**
+ * Assemble a `ShardManifestV1` from already-partitioned tiers (deterministic).
+ * Shards are sorted by `(seqStart, byteStart)`; `generationDigest`, `byteTotal`
+ * and `shardCount` are computed from the sorted set. The caller typically runs
+ * this through `assembleAndValidate` so the structural rules are enforced too.
+ */
+export function buildShardManifest(input) {
+    const cmp = (a, b) => {
+        if (a.range.seqStart !== b.range.seqStart) {
+            return a.range.seqStart < b.range.seqStart ? -1 : 1;
+        }
+        return a.range.byteStart !== b.range.byteStart
+            ? a.range.byteStart < b.range.byteStart ? -1 : 1
+            : 0;
+    };
+    const semantic = [...input.semantic].sort(cmp);
+    const exact = [...input.exact].sort(cmp);
+    const byteTotal = semantic.reduce((n, s) => n + s.byteCount, 0) +
+        exact.reduce((n, s) => n + s.byteCount, 0);
+    const generationDigest = shardManifestDigest(input.sessionId, input.sourceHighWater, semantic, exact);
+    return {
+        schema: "shard-manifest-v1",
+        sessionId: input.sessionId,
+        sourceHighWater: input.sourceHighWater,
+        semantic,
+        exact,
+        protectedSpans: [...input.protectedSpans],
+        byteTotal,
+        shardCount: semantic.length + exact.length,
+        generationDigest,
+    };
+}
+/**
+ * Assembly + validation seam (task 5). Builds the manifest, validates it, and
+ * emits `vector_cortex_shard_manifest_built` on success or
+ * `vector_cortex_protected_span_rejected` on failure (flag-gated). Non-fatal:
+ * a validation failure returns `{ok:false, code}` and NEVER throws into the host.
+ */
+export function assembleAndValidate(input, emit) {
+    const manifest = buildShardManifest(input);
+    const validation = validateShardManifest(manifest);
+    const reporter = createShardReporter(emit);
+    if (!validation.ok) {
+        reporter.protectedSpanRejected({
+            sessionId: input.sessionId,
+            code: validation.code,
+        });
+        return { ok: false, code: validation.code };
+    }
+    reporter.manifestBuilt({
+        sessionId: input.sessionId,
+        sourceHighWater: input.sourceHighWater.toString(),
+        shardCount: manifest.shardCount,
+        byteTotal: manifest.byteTotal,
+        generationDigest: manifest.generationDigest,
+    });
+    return { ok: true, manifest };
+}
+/**
+ * Whether each tier's ranges are internally sorted by (seqStart, byteStart).
+ * The two tiers are NOT globally ordered against each other (exact shards are a
+ * subset of the semantic stream, so an exact range always sits inside some
+ * semantic range); the guarantee the builder provides is per-tier ordering.
+ */
+export function manifestSorted(m) {
+    const key = (r) => `${r.seqStart.toString()},${r.byteStart}`;
+    const sorted = (rows) => rows.every((r, i) => i === 0 || key(rows[i - 1].range) <= key(r.range));
+    return sorted(m.semantic) && sorted(m.exact);
+}
+/** Build the flag-gated typed reporter (mirrors ledger/topology reporters). */
+function createShardReporter(emit) {
+    const fire = (event, fields) => {
+        if (!VC4A_ENABLED())
+            return;
+        if (!emit)
+            return;
+        try {
+            emit(event, fields);
+        }
+        catch {
+            /* non-fatal observability — never break the agent loop */
+        }
+    };
+    return {
+        manifestBuilt(fields) {
+            fire("vector_cortex_shard_manifest_built", fields);
+        },
+        protectedSpanRejected(fields) {
+            fire("vector_cortex_protected_span_rejected", fields);
+        },
+    };
+}
+export { createShardReporter };

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/extensions/dashboard-client/dist/assets/{AreaChart-DqiFSnDx.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-BFRzeYX3.js";import{R as p,F as ee,r as ve}from"./index-DSZON0Yi.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-DqiFSnDx.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