pi-mega-compact 0.20.6 → 0.20.8

package/dist/vector-cortex/heal/closure-opt.js

@@ -0,0 +1,242 @@
+/**
+ * vector-cortex/heal/closure-opt.ts — VC6A deterministic transitive reduction
+ * over the ALREADY-MANDATORY VC4C closure.
+ *
+ * WHAT THIS DOES NOT DO: it does not close anything and it does not change which
+ * nodes are selected. `closeSelection` (VC4C) has already run and produced the
+ * mandatory set; CONTRACTS §plan and closure is explicit that "VC6 only
+ * optimizes restoration/self-healing". This module takes that closed set and
+ * shrinks the EDGE PLAN used to justify/re-walk it.
+ *
+ * THE REDUCTION. Requirements flow prerequisite `from` → dependent `to`, and
+ * closure walks them BACKWARD (selecting `to` pulls in `from`). So the
+ * requirement relation is `to ⇒ from`. If `c ⇒ b` and `b ⇒ a` are both in the
+ * plan, then a third edge `c ⇒ a` adds nothing: walking `c` already reaches `a`
+ * through `b`. That third edge is transitively implied and is the only kind of
+ * edge this module removes.
+ *
+ * WHAT IS NEVER REMOVED (task 3):
+ *   - a `tool-pair` edge          — the pair is atomic (PREVENT-PI-002);
+ *   - any edge touching an anchor — the floor is preserved (PREVENT-PI-001);
+ *   - a `contradicts` edge        — the resolver reads it directly, so removing
+ *                                   it would change the resolved set;
+ *   - a SOLE dependency edge      — the only edge pulling its prerequisite in.
+ * Every considered edge — retained or removed — is recorded in the proof, so the
+ * verifier can replay the decision rather than trust it.
+ *
+ * DETERMINISM. Vertices and edges are sorted by ID BYTES (the same bytewise
+ * comparator `reconstruct/closure.ts` uses), the reachability search drains a
+ * sorted worklist, and every emitted array is sorted. Two graphs that differ
+ * only in input order produce byte-identical proofs.
+ *
+ * PURITY. No storage, no console, no clock, no network (PREVENT-PI-004 /
+ * PREVENT-011). The FLAG DOES NOT GATE THIS ARITHMETIC: `MEGACOMPACT_VC6A=0`
+ * gates the reporter + dashboard seam only (see `emit.ts`), exactly as
+ * VC5B/VC5C do, so flag-off is byte-identical to the predecessor.
+ */
+/** Bytewise id comparator — identical to `reconstruct/closure.ts::sortedIds`. */
+function byBytes(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+/** Total order over edges: `from`, then `to`, then `kind` — all bytewise. */
+function compareEdges(x, y) {
+    return byBytes(x.from, y.from) || byBytes(x.to, y.to) || byBytes(x.kind, y.kind);
+}
+/** Sorted copy of an edge list (never mutates the caller's array). */
+function sortedEdges(edges) {
+    return [...edges].sort(compareEdges);
+}
+/**
+ * The requirement adjacency of a plan: for a dependent node, which prerequisites
+ * it pulls in. Mirrors `reconstruct/closure.ts::buildRequirements` — `depends`
+ * walks backward to the prerequisite, `tool-pair` walks BOTH ways because a pair
+ * is atomic. `contradicts` never pulls a node in and is therefore absent here
+ * (it is still protected from removal; it simply is not a traversal edge).
+ */
+function requirementAdjacency(edges) {
+    const adj = new Map();
+    const add = (key, value) => {
+        const list = adj.get(key);
+        if (list === undefined)
+            adj.set(key, [value]);
+        else
+            list.push(value);
+    };
+    for (const e of edges) {
+        if (e.kind === "depends")
+            add(e.to, e.from);
+        else if (e.kind === "tool-pair") {
+            add(e.to, e.from);
+            add(e.from, e.to);
+        }
+    }
+    for (const list of adj.values())
+        list.sort(byBytes);
+    return adj;
+}
+/**
+ * Is `target` reachable from `start` through the requirement adjacency WITHOUT
+ * using the direct `start ⇒ target` hop? Returns the witnessing intermediate
+ * vertex (the first hop of the detour, bytewise-smallest) or `null`.
+ *
+ * This is the "alternate path exists" test that licenses a removal. The direct
+ * hop is excluded so an edge can never justify its own removal; a cycle simply
+ * revisits `seen` and terminates.
+ */
+function alternatePathVia(adj, start, target) {
+    // First hops other than the direct one, in bytewise order so the witness is
+    // deterministic when several detours exist.
+    const firstHops = (adj.get(start) ?? []).filter((n) => n !== target);
+    for (const hop of firstHops) {
+        // Breadth-first from this hop; `seen` excludes `start` so a detour that
+        // loops back through the origin cannot be counted as progress.
+        const seen = new Set([start]);
+        const worklist = [hop];
+        while (worklist.length > 0) {
+            worklist.sort(byBytes);
+            const current = worklist.shift();
+            if (current === undefined)
+                break;
+            if (current === target)
+                return hop;
+            if (seen.has(current))
+                continue;
+            seen.add(current);
+            for (const next of adj.get(current) ?? []) {
+                if (!seen.has(next))
+                    worklist.push(next);
+            }
+        }
+    }
+    return null;
+}
+/**
+ * Is `target` reachable from `start` using ONLY the edges in `others` (a path of
+ * length >= 2, never the direct hop)? Returns the bytewise-smallest first-hop
+ * vertex (the witness `via`) or `null`.
+ *
+ * The transitive-reduction correctness rule: an edge `start ⇒ target` is
+ * redundant only if a length>=2 path exists through the OTHER edges. Crucially
+ * we EXCLUDE the edge under consideration, so removing one edge never invalidates
+ * the witness used to justify removing ANOTHER — a plain single-pass check over
+ * the full adjacency over-removes (HEAL-PROTECT-002: a tool pair backs two
+ * depends edges that would each look implied by the full graph but only survive
+ * together).
+ */
+function alternatePathExcluding(others, start, target) {
+    const adj = requirementAdjacency(others);
+    return alternatePathVia(adj, start, target);
+}
+/** The set of node ids marked as anchor-floor members in the graph. */
+function anchorIds(graph) {
+    const out = new Set();
+    for (const n of graph.nodes)
+        if (n.anchor === true)
+            out.add(n.id);
+    return out;
+}
+/**
+ * Count how many `depends` edges pull in each prerequisite. A prerequisite with
+ * exactly one such edge has a SOLE dependency edge: removing it would drop the
+ * prerequisite from the closure entirely, so it is protected regardless of any
+ * alternate path.
+ */
+function dependsFanIn(edges) {
+    const counts = new Map();
+    for (const e of edges) {
+        if (e.kind !== "depends")
+            continue;
+        counts.set(e.from, (counts.get(e.from) ?? 0) + 1);
+    }
+    return counts;
+}
+/**
+ * Classify a NON-removable edge, or return `null` when the edge is an ordinary
+ * `depends` edge that removal is at least allowed to consider.
+ *
+ * Order matters and is deliberate: the strongest structural guarantee is
+ * reported first, so a tool-pair edge that also touches an anchor is recorded as
+ * `tool-pair` and the proof reads as the reason a reviewer would give.
+ */
+function protectedReason(edge, anchors, fanIn) {
+    if (edge.kind === "tool-pair")
+        return "tool-pair";
+    if (edge.kind === "contradicts")
+        return "contradiction";
+    if (anchors.has(edge.from) || anchors.has(edge.to))
+        return "anchor";
+    if ((fanIn.get(edge.from) ?? 0) <= 1)
+        return "sole-dependency";
+    return null;
+}
+/**
+ * Optimize the already-mandatory closure by transitive reduction (task 2).
+ *
+ * Only edges INSIDE the closed selection are considered: an edge touching an
+ * unselected node is not part of the traversal plan for this closure at all, so
+ * it is neither retained nor removed — it is simply out of scope and produces no
+ * proof row.
+ *
+ * `selected` is copied through UNCHANGED. That is the whole safety property: the
+ * optimizer is allowed to make the plan cheaper, never to make it smaller.
+ */
+export function optimizeClosure(input) {
+    const { graph, conservative } = input;
+    const selected = new Set(conservative.selected);
+    const anchors = anchorIds(graph);
+    // Consider only in-selection edges, in deterministic bytewise order.
+    const considered = sortedEdges(graph.edges.filter((e) => selected.has(e.from) && selected.has(e.to)));
+    const fanIn = dependsFanIn(considered);
+    const rows = [];
+    const retained = [];
+    const removed = [];
+    for (const e of considered) {
+        const guard = protectedReason(e, anchors, fanIn);
+        if (guard !== null) {
+            // Protected: retained unconditionally, EVEN WHEN an alternate path exists
+            // (HEAL-PROTECT-002). The reason names the guarantee, not the topology.
+            rows.push({ from: e.from, to: e.to, kind: e.kind, decision: "retained", reason: guard });
+            retained.push(e);
+            continue;
+        }
+        // Ordinary `depends` edge: removable iff the requirement it carries is
+        // already carried by a longer path `to ⇒ via ⇒ ... ⇒ from` through the OTHER
+        // edges (the edge under test is excluded so removals stay mutually valid).
+        const others = considered.filter((o) => o !== e);
+        const via = alternatePathExcluding(others, e.to, e.from);
+        if (via === null) {
+            rows.push({
+                from: e.from,
+                to: e.to,
+                kind: e.kind,
+                decision: "retained",
+                reason: "no-alternate-path",
+            });
+            retained.push(e);
+            continue;
+        }
+        rows.push({
+            from: e.from,
+            to: e.to,
+            kind: e.kind,
+            decision: "removed",
+            reason: "transitively-implied",
+            via,
+        });
+        removed.push(e);
+    }
+    return {
+        schema: "closure-proof-v2",
+        sessionId: graph.sessionId,
+        selected: [...conservative.selected],
+        retainedEdges: sortedEdges(retained),
+        removedEdges: sortedEdges(removed),
+        rows,
+        conservativeTraversals: considered.length,
+        optimizedTraversals: retained.length,
+    };
+}
+// Metrics + VC6B handoff (traversal savings, RestoreHintV1) live in the
+// delegate-shell sibling `closure-metrics.ts` to keep this core reduction
+// algorithm under the 300-line soft limit.
+export { traversalSavings, restoreHints } from "./closure-metrics.js";

package/dist/vector-cortex/heal/emit.js

@@ -0,0 +1,69 @@
+/**
+ * vector-cortex/heal/emit.ts — VC6A event reporter seam (task 5).
+ *
+ * Mirrors `../rollout/emit.ts`: a thin `safe()` wrapper around an optional
+ * injected `emit` (so unit tests stay pure — they pass `undefined` and inspect
+ * nothing), and two event names required verbatim by the sprint spec:
+ *   - `vector_cortex_closure_optimized`   — emitted when a proof is produced.
+ *   - `vector_cortex_closure_proof_rejected` — emitted when verification fails.
+ *
+ * FLAG SEMANTICS (the invariant VC5B/VC5C established). The optimizer and
+ * verifier are PURE arithmetic and run REGARDLESS of the flag. The flag gates
+ * ONLY the reporting + dashboard seam: when `MEGACOMPACT_VC6A=0` we still compute
+ * the proof (needed for byte-identical parity with the predecessor), we just do
+ * not emit the VC6A-namespaced events. This is what makes flag-off byte-identical
+ * to VC5C — the arithmetic is never skipped, only the announcement.
+ *
+ * No console, no storage, no network (PREVENT-PI-004 / PREVENT-011). Every line
+ * is a structured JSON event with `ts` + `event`.
+ */
+import { VC6A_ENABLED } from "../../config/vector-cortex.js";
+/**
+ * Run `fn` only when an emit is available, swallowing and logging nothing on
+ * failure (PRACTICES: non-fatal stores). `fn` receives the emit so callers need
+ * not null-check.
+ */
+function safe(emit, fn) {
+    if (emit === undefined)
+        return;
+    try {
+        fn(emit);
+    }
+    catch {
+        // Non-fatal: a reporting failure must never break the agent loop.
+    }
+}
+/** The event names VC6A emits, exported for the dashboard seam and tests. */
+export const HEAL_EVENT_NAMES = [
+    "vector_cortex_closure_optimized",
+    "vector_cortex_closure_proof_rejected",
+];
+/**
+ * Report a successful optimization. `MEGACOMPACT_VC6A=0` suppresses the VC6A
+ * event (flag-off parity) but does not affect the computation that produced
+ * `proof`.
+ */
+export function reportClosureOptimized(emit, payload) {
+    if (!VC6A_ENABLED())
+        return;
+    safe(emit, (e) => e("vector_cortex_closure_optimized", {
+        ts: undefined,
+        event: "vector_cortex_closure_optimized",
+        sessionId: payload.sessionId,
+        removedEdges: payload.removed,
+        retainedEdges: payload.retained,
+        traversalSavings: payload.savings,
+    }));
+}
+/** Report a rejected proof. Suppressed under flag-off, like the above. */
+export function reportProofRejected(emit, payload) {
+    if (!VC6A_ENABLED())
+        return;
+    safe(emit, (e) => e("vector_cortex_closure_proof_rejected", {
+        ts: undefined,
+        event: "vector_cortex_closure_proof_rejected",
+        sessionId: payload.sessionId,
+        reason: payload.reason,
+        fallbackMode: payload.mode,
+    }));
+}

package/dist/vector-cortex/heal/proof.js

@@ -0,0 +1,210 @@
+/**
+ * vector-cortex/heal/proof.ts — VC6A proof verifier (task 4).
+ *
+ * The optimizer (`closure-opt.ts`) is PURE and cheap, but a proof is cheap to
+ * LIE about: a buggy or tampered producer could ship a proof that removes an
+ * edge the conservative closure actually needs. The verifier does not trust the
+ * proof — it REPLAYS it against the conservative oracle from scratch.
+ *
+ * REPLAY. From the conservative `ClosureResult` we rebuild the requirement
+ * adjacency (`to ⇒ from` for `depends`, both directions for `tool-pair`) over
+ * the in-selection edges — exactly the relation `closure-opt` reduced over.
+ * For every row the proof claims to REMOVE, the verifier independently confirms
+ * the same alternate path exists. For every row it claims to RETAIN, it confirms
+ * the protection reason holds (or that no alternate path exists). Any row that
+ * fails its own predicate is a witness violation.
+ *
+ * SELECTED-SET DIVERGENCE (the cardinal sin). The proof must contain the SAME
+ * selected set as the conservative oracle, byte for byte. Closure optimization
+ * is allowed to make the plan cheaper, never smaller — so if the proof's
+ * `selected` differs from the oracle's, that is `HEAL_PROOF_SET_MISMATCH` and the
+ * repaired triad must fall back to mode B (the conservative closure) and
+ * ultimately C (VC5C's legacy prompt) if even that fails.
+ *
+ * PURE / DETERMINISTIC / LOCAL, like everything in `heal/`: no storage, no
+ * console, no clock, no network (PREVENT-PI-004 / PREVENT-011). The verifier
+ * reads only types and the two ClosureEdge/ClosureGraph/ClosureResult shapes.
+ */
+/** Bytewise id comparator — matches `closure-opt.ts` / `reconstruct/closure.ts`. */
+function byBytes(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+/** Requirement adjacency over an edge list, identical to `closure-opt`. */
+function requirementAdjacency(edges) {
+    const adj = new Map();
+    const add = (key, value) => {
+        const list = adj.get(key);
+        if (list === undefined)
+            adj.set(key, [value]);
+        else
+            list.push(value);
+    };
+    for (const row of edges) {
+        if (row.kind === "contradicts")
+            continue; // not a traversal edge
+        if (row.kind === "depends")
+            add(row.to, row.from);
+        else if (row.kind === "tool-pair") {
+            add(row.to, row.from);
+            add(row.from, row.to);
+        }
+    }
+    for (const list of adj.values())
+        list.sort(byBytes);
+    return adj;
+}
+/** Does a detour `start ⇒ via ⇒ ... ⇒ target` exist, excluding the direct hop? */
+function alternatePathVia(adj, start, target) {
+    for (const hop of (adj.get(start) ?? []).filter((n) => n !== target)) {
+        const seen = new Set([start]);
+        const worklist = [hop];
+        while (worklist.length > 0) {
+            worklist.sort(byBytes);
+            const current = worklist.shift();
+            if (current === undefined)
+                break;
+            if (current === target)
+                return hop;
+            if (seen.has(current))
+                continue;
+            seen.add(current);
+            for (const next of adj.get(current) ?? []) {
+                if (!seen.has(next))
+                    worklist.push(next);
+            }
+        }
+    }
+    return null;
+}
+/**
+ * Verify a `ClosureProofV2` produced for an already-closed graph.
+ *
+ * Returns `{ ok: true, selected }` when the replay confirms the optimized plan is
+ * provably equivalent to the conservative closure — mode A may be used. On any
+ * divergence it returns `{ ok: false, codes }` listing every failure code; the
+ * caller routes to mode B (conservative) and, if that also fails, mode C (legacy,
+ * with `semanticLossStated`). The verifier is idempotent — replaying the same
+ * proof twice yields the same verdict, which `vc6a-acceptance.test.ts` asserts.
+ */
+export function verifyProof(proof, conservative, graph) {
+    const codes = [];
+    const inSelection = new Set(conservative.selected);
+    const anchors = new Set((graph?.nodes ?? []).filter((n) => n.anchor === true).map((n) => n.id));
+    // 1. Selected-set divergence is the hard gate (task 4: HEAL_PROOF_SET_MISMATCH).
+    const oracleSelected = [...conservative.selected].sort(byBytes);
+    const proofSelected = [...proof.selected].sort(byBytes);
+    const selectedMatch = oracleSelected.length === proofSelected.length &&
+        oracleSelected.every((id, i) => id === proofSelected[i]);
+    if (!selectedMatch)
+        codes.push("HEAL_PROOF_SET_MISMATCH");
+    // 2. Re-check each row against its own predicate. For a removal, the witness
+    //    is validated against the OTHER rows (the reduced graph), so a removal
+    //    never justifies another's witness — this catches both a missing-witness
+    //    removal (HEAL-PROOF-003) and a protected edge that was removed
+    //    (HEAL_PROOF_PROTECTED_REMOVED).
+    for (const row of proof.rows) {
+        // Out-of-scope rows (touch an unselected node) should never have been
+        // emitted; treat as a witness violation so a malformed proof fails loudly.
+        if (!inSelection.has(row.from) || !inSelection.has(row.to)) {
+            codes.push("HEAL_PROOF_WITNESS_INVALID");
+            continue;
+        }
+        if (row.decision === "removed") {
+            // A removal MUST carry a witness and the witness MUST still validate
+            // against the OTHER rows (the reduced graph) — never the row itself, so a
+            // removal never justifies another's witness (matches the optimizer's
+            // exclusion rule).
+            if (row.via === undefined) {
+                codes.push("HEAL_PROOF_WITNESS_INVALID");
+                continue;
+            }
+            const others = proof.rows.filter((r) => r !== row);
+            const witness = alternatePathVia(requirementAdjacency(others), row.to, row.from);
+            if (witness === null) {
+                codes.push("HEAL_PROOF_WITNESS_INVALID");
+                continue;
+            }
+            if (anchors.has(row.from) || anchors.has(row.to)) {
+                // Topology says removable, but an anchor edge is NEVER removable.
+                codes.push("HEAL_PROOF_PROTECTED_REMOVED");
+                continue;
+            }
+            if (row.kind === "tool-pair" || row.kind === "contradicts") {
+                // Both are protected regardless of topology.
+                codes.push("HEAL_PROOF_PROTECTED_REMOVED");
+            }
+        }
+        else {
+            // A retained plain depends edge that claims `no-alternate-path` but
+            // actually HAS one (through the other rows) is an internal inconsistency:
+            // the optimizer kept a removable edge without removing it. The proof is
+            // internally contradictory, so it fails replay.
+            if (row.kind === "depends" && row.reason === "no-alternate-path") {
+                const others = proof.rows.filter((r) => r !== row);
+                const hasPath = alternatePathVia(requirementAdjacency(others), row.to, row.from);
+                if (hasPath !== null)
+                    codes.push("HEAL_PROOF_WITNESS_INVALID");
+            }
+        }
+    }
+    // 3. Completeness: every in-selection edge the optimizer considered must appear
+    //    in the proof. A dropped row (the unique-injection test drops one) surfaces
+    //    as HEAL_PROOF_INCOMPLETE even if the remaining rows replay fine — the proof
+    //    must account for EVERY considered edge. `conservativeTraversals` is the
+    //    optimizer's own record of how many edges it fed through, so `rows.length`
+    //    must equal it exactly.
+    if (proof.rows.length < proof.conservativeTraversals) {
+        codes.push("HEAL_PROOF_INCOMPLETE");
+    }
+    if (codes.length === 0) {
+        return { ok: true, selected: proofSelected };
+    }
+    return { ok: false, codes: [...new Set(codes)] };
+}
+/**
+ * Drive the A/B/C resilient triad for one closure (task 5 wiring; VC6A exposes
+ * the decision; the actual selection/budget work is VC4C/VC5A respectively).
+ *
+ *  - A: the optimized proof verified cleanly → ship the optimized plan.
+ *  - B: proof rejected → fall back to the conservative VC4C closure (no opt).
+ *  - C: B also failed (should not happen for a sound conservative closure) →
+ *       state the legacy prompt path with `semanticLossStated`.
+ *
+ * This is PURE: it returns the verdict and which mode to use; it does not emit,
+ * store, or touch the network. The emit seam (`emit.ts`) consumes the outcome.
+ */
+export function selectHealMode(proof, conservative, graph) {
+    const verification = verifyProof(proof, conservative, graph);
+    if (verification.ok) {
+        return {
+            mode: "A",
+            proof,
+            selected: [...proof.selected],
+            codes: [],
+            semanticLossStated: false,
+        };
+    }
+    // Mode B: conservative closure is sound by construction (it is the oracle the
+    // proof was measured against). Use it directly.
+    return {
+        mode: "B",
+        proof: null,
+        selected: [...conservative.selected],
+        codes: verification.codes,
+        semanticLossStated: false,
+    };
+}
+/**
+ * Convenience for the rare B-failure path: if even the conservative oracle's
+ * selection cannot be honored, state the legacy prompt and MARK semantic loss.
+ * Mode C is the last resort and the only place semantic loss is ever admitted.
+ */
+export function legacyFallback(conservative, reason) {
+    return {
+        mode: "C",
+        proof: null,
+        selected: [...conservative.selected],
+        codes: [reason, "HEAL_CLOSURE_REJECTED"],
+        semanticLossStated: true,
+    };
+}

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

@@ -0,0 +1,42 @@
+/**
+ * vector-cortex/heal/types.ts — VC6A closure-optimization contract.
+ *
+ * Owns `ClosureProofV2` and `RestoreHintV1`.
+ *
+ * VC4C already performs the MANDATORY conservative closure (CONTRACTS §plan and
+ * closure): it recursively adds every `depends`/tool-pair predecessor to a fixed
+ * point, resolves contradictions, and preserves the anchor floor. VC6A does NOT
+ * re-close and does NOT change WHICH NODES ARE SELECTED — "VC6 only optimizes
+ * restoration/self-healing". It optimizes the PROOF EDGES of that already-closed
+ * graph by transitive reduction: an edge `a -> c` whose requirement is already
+ * carried by a path `a -> b -> c` is redundant and can be dropped from the
+ * traversal plan without changing the closed set.
+ *
+ * The optimization is therefore a claim, and a claim needs a receipt:
+ * `ClosureProofV2` records EVERY considered edge — retained or removed — with
+ * the reason. `proof.ts` replays those rows against the conservative VC4C oracle
+ * and rejects the optimization if the selected set diverges
+ * (`HEAL_PROOF_SET_MISMATCH`) or if a considered edge has no proof row
+ * (`HEAL_PROOF_INCOMPLETE`).
+ *
+ * PROTECTED EDGES ARE NEVER REMOVED. A tool-pair edge (PREVENT-PI-002), an edge
+ * touching an anchor node (PREVENT-PI-001's anchor floor), a
+ * contradiction-resolution edge, and a SOLE dependency edge (the only edge that
+ * pulls its prerequisite in) are all retained unconditionally, even when an
+ * alternate path exists. Only a redundant `depends` edge may go.
+ *
+ * Pure types + registered conformance IDs: no storage, no console, no network
+ * (PREVENT-PI-004 / PREVENT-011).
+ */
+/**
+ * Registered HEAL conformance ID range (HEAL-001..015). The acceptance test
+ * reads these rows from the v2 manifest and asserts each returns its manifest
+ * `ok`/`code`.
+ */
+export const HEAL_IDS = Array.from({ length: 15 }, (_v, i) => `HEAL-${String(i + 1).padStart(3, "0")}`);
+/** Named VC6A conformance assertions (the sprint's headline rows). */
+export const HEAL_NAMED_IDS = [
+    "HEAL-REDUCE-001",
+    "HEAL-PROTECT-002",
+    "HEAL-PROOF-003",
+];

package/extensions/dashboard-client/dist/assets/{AreaChart-DqTbaSRA.js → AreaChart-5yxaI8IO.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-DRresOQF.js";import{R as p,F as ee,r as ve}from"./index-DohmtZWL.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-DqTbaSRA.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-swm0YZe0.js";import{R as p,F as ee,r as ve}from"./index-DeIky7xm.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-5yxaI8IO.js.map