pi-mega-compact 0.20.1 → 0.20.3

package/dist/vector-cortex/reconstruct/assemble.js

@@ -0,0 +1,137 @@
+/**
+ * vector-cortex/reconstruct/assemble.ts — source-order assembly (VC4C).
+ *
+ * Task 4: given a CLOSED + VALIDATED selection, decode the relevant shards,
+ * insert protected exact bytes unchanged, then lay the spans out SOLELY by their
+ * source range (`ShardRange`) before concatenation — never by closure order,
+ * which carries no positional meaning. The deterministic content-only
+ * `mandatoryTokenEstimate` from the closure is carried through UNCHANGED to VC5A
+ * (VC5A owns framing + budget admission).
+ *
+ * OWNERSHIP BOUNDARY (CONTRACTS plan + TRIAD_RESILIENCE): assemble produces the
+ * raw, ordered, content-only reconstruction. It does NOT frame it, does NOT
+ * admit against a budget, and NEVER truncates a mandatory node. Any byte/order
+ * error produces a hard rejection (REC_SPAN_OVERLAP / REC_TOOL_PAIR_SPLIT)
+ * because a corrupted layout must never reach a live prompt.
+ *
+ * Determinism: sorting is bytewise on (sessionId, seqStart, byteStart). The
+ * output digest is over the CONCATENATED BYTES so any reorder is itself detected
+ * downstream (RESIDUAL_CODEC admission parity).
+ *
+ * Pure/deterministic: no storage, no console, no network.
+ */
+/** SHA-256 hex of an arbitrary byte array (Web Crypto; no network, no deps). */
+async function sha256Hex(bytes) {
+    const buf = bytes.buffer.slice(bytes.byteOffset, bytes.byteOffset + bytes.byteLength);
+    const digest = await crypto.subtle.digest("SHA-256", buf);
+    const out = new Uint8Array(digest);
+    return Array.from(out, (b) => b.toString(16).padStart(2, "0")).join("");
+}
+/** Stable source-order comparator: (sessionId, seqStart, byteStart). */
+function bySourceOrder(a, b) {
+    if (a.range.sessionId !== b.range.sessionId) {
+        return a.range.sessionId < b.range.sessionId ? -1 : 1;
+    }
+    if (a.range.seqStart !== b.range.seqStart) {
+        return a.range.seqStart < b.range.seqStart ? -1 : 1;
+    }
+    return a.range.byteStart - b.range.byteStart;
+}
+/**
+ * Detect a hard layout failure BEFORE concatenation:
+ *   - REC_SPAN_OVERLAP: two spans intersect in the source byte space.
+ *   - REC_TOOL_PAIR_SPLIT: a node bound by a tool-pair edge must be adjacent to
+ *     its partner (end of one == start of the other) in source order
+ *     (PREVENT-PI-002 restated at assembly time — a toolCall/toolResult pair is
+ *     never split across a gap).
+ * Returns the first failure code found, or null when the layout is clean.
+ */
+function detectLayoutFailure(spans, nodes, edges) {
+    const ordered = [...spans].sort(bySourceOrder);
+    for (let i = 1; i < ordered.length; i++) {
+        const prev = ordered[i - 1].range;
+        const cur = ordered[i].range;
+        const prevEnd = prev.byteEnd; // half-open: [byteStart, byteEnd)
+        if (cur.byteStart < prevEnd)
+            return "REC_SPAN_OVERLAP";
+    }
+    // Tool-pair adjacency: every tool-pair edge names two partners that must be
+    // immediately adjacent in source order. We check each edge once.
+    const rangeById = new Map(spans.map((s) => [s.nodeId, s.range]));
+    const inOrder = new Map(ordered.map((s) => [s.nodeId, s.range]));
+    const seenEdges = new Set();
+    for (const e of edges) {
+        if (e.kind !== "tool-pair")
+            continue;
+        const key = e.from < e.to ? `${e.from}|${e.to}` : `${e.to}|${e.from}`;
+        if (seenEdges.has(key))
+            continue;
+        seenEdges.add(key);
+        // Both endpoints must be present in the selection to be a split concern.
+        const a = rangeById.get(e.from);
+        const b = rangeById.get(e.to);
+        if (a === undefined || b === undefined)
+            continue;
+        const aEnd = a.byteEnd;
+        const bEnd = b.byteEnd;
+        const adjacent = aEnd === b.byteStart || bEnd === a.byteStart;
+        if (!adjacent)
+            return "REC_TOOL_PAIR_SPLIT";
+    }
+    // `nodes` kept in the signature for call symmetry with the composed validator;
+    // it is the authoritative kind source but not needed for these two checks.
+    void nodes;
+    void inOrder;
+    return null;
+}
+/**
+ * Assemble a closed+validated selection into source order (task 4).
+ *
+ * `shards` must be EXACTLY one `DecodedShard` per node id in `selected` — the
+ * caller (validate.ts) guarantees availability. A missing shard is therefore a
+ * programming error surfaced as REC_SOURCE_UNAVAILABLE, never a silent gap.
+ */
+export async function assembleSourceOrder(args) {
+    const { sessionId, selected, nodes, edges, mandatoryTokenEstimate } = args;
+    const shardById = new Map(args.shards.map((s) => [s.nodeId, s]));
+    // Every selected node MUST have a decoded shard; a missing one is the unique
+    // failure-injection path (erase a dependency shard -> REC_SOURCE_UNAVAILABLE).
+    for (const id of selected) {
+        if (!shardById.has(id))
+            return { reconstruction: null, code: "REC_SOURCE_UNAVAILABLE" };
+    }
+    const spans = selected.map((id) => {
+        const s = shardById.get(id);
+        return {
+            nodeId: s.nodeId,
+            range: s.range,
+            source: s.source,
+            bytes: s.bytes,
+            digest: s.digest,
+            protectedSpan: s.protectedSpan,
+        };
+    });
+    const layoutFailure = detectLayoutFailure(spans, nodes, edges);
+    if (layoutFailure !== null)
+        return { reconstruction: null, code: layoutFailure };
+    const ordered = [...spans].sort(bySourceOrder);
+    const byteTotal = ordered.reduce((sum, s) => sum + s.bytes.length, 0);
+    const concatenated = new Uint8Array(byteTotal);
+    let offset = 0;
+    for (const s of ordered) {
+        concatenated.set(s.bytes, offset);
+        offset += s.bytes.length;
+    }
+    const digest = await sha256Hex(concatenated);
+    return {
+        reconstruction: {
+            schema: "reconstruction-v1",
+            sessionId,
+            spans: ordered,
+            digest,
+            byteTotal,
+            mandatoryTokenEstimate,
+        },
+        code: null,
+    };
+}

package/dist/vector-cortex/reconstruct/closure.js

@@ -0,0 +1,268 @@
+/**
+ * vector-cortex/reconstruct/closure.ts — mandatory conservative closure (VC4C).
+ *
+ * Task 2/3: a WORKLIST recursion that repeatedly adds every `depends`
+ * predecessor and every whole tool pair of an already-selected node until the
+ * selection stops growing (a FIXED POINT), tracking visited ids so a cyclic
+ * graph terminates instead of recursing forever. Task 3: contradictions are
+ * resolved by retaining the LATER exact source resolution; an explicit
+ * resolution event may name the loser directly; equal/unordered resolutions are
+ * an unresolved tie and return `CLO_CONTRADICTION_UNRESOLVED` so the candidate
+ * never goes live (CONTRACTS §plan and closure).
+ *
+ * Determinism: the worklist is drained in sorted id order and every returned
+ * array is sorted, so the closed set is identical regardless of the order seeds
+ * or edges were supplied in. Time is never read here — contradiction ordering
+ * uses the SOURCE `resolvedAtMs` fact carried on the node.
+ *
+ * OWNERSHIP: `mandatoryTokenEstimate` is CONTENT ONLY (no prompt framing) and is
+ * handed unchanged to VC5A, which owns framing + budget admission and returns
+ * `MANDATORY_CLOSURE_OVER_BUDGET` on overflow. Closure NEVER truncates a
+ * mandatory node.
+ *
+ * Pure/deterministic: no storage, no console, no network (PREVENT-PI-004 /
+ * PREVENT-011).
+ */
+/** Sorted copy (bytewise id order) — every closure output is order-stable. */
+function sortedIds(ids) {
+    return [...ids].sort((a, b) => (a < b ? -1 : a > b ? 1 : 0));
+}
+/** Index the graph's nodes by id (last wins is impossible — ids are unique). */
+function indexNodes(graph) {
+    const byId = new Map();
+    for (const n of graph.nodes)
+        byId.set(n.id, n);
+    return byId;
+}
+/**
+ * Build the "requirement" adjacency: for a selected node `x`, which nodes must
+ * ALSO be selected. Edges point prerequisite `from` → dependent `to`, so:
+ *
+ *   - `depends`   — selecting `to` requires `from` (walk BACKWARD to the
+ *                   prerequisite; this is the transitive dependency closure);
+ *   - `tool-pair` — the pair is atomic, so selecting EITHER endpoint requires
+ *                   the other (walk BOTH directions — a pair is never split,
+ *                   PREVENT-PI-002).
+ *
+ * `contradicts` is deliberately absent: a contradiction never PULLS a node in,
+ * it removes one (resolved separately below).
+ */
+function buildRequirements(edges) {
+    const req = new Map();
+    const add = (key, id, rule) => {
+        const list = req.get(key);
+        if (list === undefined)
+            req.set(key, [{ id, rule }]);
+        else
+            list.push({ id, rule });
+    };
+    for (const e of edges) {
+        if (e.kind === "depends") {
+            add(e.to, e.from, "depends");
+            continue;
+        }
+        if (e.kind === "tool-pair") {
+            add(e.to, e.from, "tool-pair");
+            add(e.from, e.to, "tool-pair");
+        }
+    }
+    return req;
+}
+/**
+ * Resolve one contradiction pair. Returns the loser id, or `null` when the pair
+ * is an unresolved tie.
+ *
+ * Precedence (CONTRACTS §plan and closure):
+ *   1. An explicit resolution event naming the loser wins outright.
+ *   2. Otherwise the LATER exact source resolution supersedes the earlier claim.
+ *      "Exact" is required: a semantic node never supersedes an exact one, since
+ *      semantic vectors never claim to recover exact text (RESIDUAL_CODEC).
+ *   3. Equal timestamps, missing timestamps, or two non-exact claims are
+ *      UNORDERED — keep both and reject live use.
+ */
+function resolveContradiction(a, b, explicit) {
+    // 1. Explicit resolution event names the loser directly.
+    const aLoses = explicit.get(a.id);
+    if (aLoses === b.id)
+        return a.id;
+    const bLoses = explicit.get(b.id);
+    if (bLoses === a.id)
+        return b.id;
+    // 2. Later EXACT source resolution supersedes the earlier claim. Both sides
+    //    must be exact and both must carry a source resolution time.
+    const aExact = a.kind === "exact";
+    const bExact = b.kind === "exact";
+    const aAt = a.resolvedAtMs;
+    const bAt = b.resolvedAtMs;
+    if (aExact && bExact && aAt !== undefined && bAt !== undefined && aAt !== bAt) {
+        return aAt < bAt ? a.id : b.id;
+    }
+    // 3. Equal / unordered / non-exact — unresolved tie.
+    return null;
+}
+/**
+ * Close a selection conservatively to a fixed point (task 2 + 3).
+ *
+ * Algorithm: seed the worklist with the requested ids (plus the anchor floor,
+ * which is always mandatory), then repeatedly pop the smallest id and add every
+ * node it requires. A `visited` set makes each node expand exactly once, so a
+ * cycle (`a depends b`, `b depends a`) terminates at the fixed point rather than
+ * recursing forever. Contradictions among the CLOSED set are then resolved; an
+ * unresolved tie fails the closure.
+ */
+export function closeSelection(input) {
+    const { graph, seeds } = input;
+    const byId = indexNodes(graph);
+    const failures = [];
+    // Structural validation: every edge endpoint and every seed must exist.
+    for (const e of graph.edges) {
+        if (!byId.has(e.from) || !byId.has(e.to)) {
+            if (!failures.includes("CLO_MISSING_NODE"))
+                failures.push("CLO_MISSING_NODE");
+        }
+    }
+    for (const s of seeds) {
+        if (!byId.has(s)) {
+            if (!failures.includes("CLO_UNKNOWN_SEED"))
+                failures.push("CLO_UNKNOWN_SEED");
+        }
+    }
+    if (failures.length > 0) {
+        return {
+            ok: false,
+            selected: [],
+            addedDependencies: [],
+            removedContradictions: [],
+            unresolved: [],
+            proof: [],
+            failures,
+            mandatoryTokenEstimate: 0,
+        };
+    }
+    const requirements = buildRequirements(graph.edges);
+    const selected = new Set();
+    const proof = [];
+    const seedSet = new Set(seeds);
+    // The anchor floor is ALWAYS mandatory: an anchor is never dropped by closure
+    // (PREVENT-PI-001's anchor-floor discipline restated for the closed prompt).
+    const anchorIds = graph.nodes.filter((n) => n.anchor === true).map((n) => n.id);
+    // Seed the worklist deterministically (sorted), anchors after explicit seeds
+    // so the proof reads "what was asked for, then what the floor forced".
+    const worklist = [];
+    for (const id of sortedIds(seedSet)) {
+        if (selected.has(id))
+            continue;
+        selected.add(id);
+        proof.push({ added: id, rule: "seed" });
+        worklist.push(id);
+    }
+    for (const id of sortedIds(anchorIds)) {
+        if (selected.has(id))
+            continue;
+        selected.add(id);
+        proof.push({ added: id, rule: "anchor-floor" });
+        worklist.push(id);
+    }
+    // ── Worklist recursion to a FIXED POINT (visited = `selected`) ─────────────
+    // Each id is expanded at most once because it can only enter the worklist at
+    // the moment it is inserted into `selected`. A cyclic graph therefore
+    // terminates: the second traversal of the cycle finds every node already
+    // selected and adds nothing.
+    while (worklist.length > 0) {
+        // Drain in sorted order so the proof is deterministic across input orders.
+        worklist.sort((a, b) => (a < b ? -1 : a > b ? 1 : 0));
+        const current = worklist.shift();
+        if (current === undefined)
+            break;
+        const required = requirements.get(current) ?? [];
+        // Sort the requirements of one node so sibling additions are ordered too.
+        const ordered = [...required].sort((x, y) => x.id < y.id ? -1 : x.id > y.id ? 1 : x.rule < y.rule ? -1 : x.rule > y.rule ? 1 : 0);
+        for (const { id, rule } of ordered) {
+            if (selected.has(id))
+                continue; // already at the fixed point for this node
+            selected.add(id);
+            proof.push({ added: id, requiredBy: current, rule });
+            worklist.push(id);
+        }
+    }
+    // ── Contradiction resolution over the CLOSED set (task 3) ─────────────────
+    const explicit = new Map();
+    for (const r of graph.resolutions ?? [])
+        explicit.set(r.loserId, r.winnerId);
+    const removed = new Set();
+    const unresolved = new Set();
+    for (const e of graph.edges) {
+        if (e.kind !== "contradicts")
+            continue;
+        // Only contradictions BETWEEN TWO SELECTED nodes matter: an unselected claim
+        // cannot contradict the prompt that is actually being built.
+        if (!selected.has(e.from) || !selected.has(e.to))
+            continue;
+        const a = byId.get(e.from);
+        const b = byId.get(e.to);
+        if (a === undefined || b === undefined)
+            continue;
+        // A pair already decided by an earlier edge (duplicate contradiction) is
+        // skipped so one resolution is not re-litigated into a false tie.
+        if (removed.has(a.id) || removed.has(b.id))
+            continue;
+        const loser = resolveContradiction(a, b, explicit);
+        if (loser === null) {
+            unresolved.add(a.id);
+            unresolved.add(b.id);
+            continue;
+        }
+        removed.add(loser);
+    }
+    // A node that lost a contradiction leaves the selection. An unresolved tie
+    // keeps BOTH (CONTRACTS: "ties keep both and reject live use") and fails.
+    for (const id of removed)
+        selected.delete(id);
+    const selectedIds = sortedIds(selected);
+    const addedDependencies = selectedIds.filter((id) => !seedSet.has(id));
+    const mandatoryTokenEstimate = selectedIds.reduce((sum, id) => sum + (byId.get(id)?.tokenEstimate ?? 0), 0);
+    const ok = unresolved.size === 0;
+    return {
+        ok,
+        selected: selectedIds,
+        addedDependencies,
+        removedContradictions: sortedIds(removed),
+        unresolved: sortedIds(unresolved),
+        proof,
+        failures: ok ? [] : ["CLO_CONTRADICTION_UNRESOLVED"],
+        mandatoryTokenEstimate,
+    };
+}
+/**
+ * Whether a closure result is a genuine fixed point: re-running the closure over
+ * its own output adds nothing. Used by the acceptance invariant ("closure reaches
+ * a fixed point") — an independent CHECK rather than a restatement of the loop.
+ */
+export function isFixedPoint(graph, result) {
+    if (!result.ok)
+        return true; // a rejected closure is not required to be closed
+    const again = closeSelection({ graph, seeds: result.selected });
+    if (!again.ok)
+        return false;
+    return (again.selected.length === result.selected.length &&
+        again.selected.every((id, i) => id === result.selected[i]));
+}
+/**
+ * Mode B: a GREEDY EXACT-ONLY closure, forced when semantic validation fails.
+ * Independent of mode A by construction — it consults no semantic node and no
+ * semantic index, deriving purely from the exact/event source tiers
+ * (TRIAD_RESILIENCE: A/B must not share the same algorithm or index).
+ */
+export function closeExactOnly(input) {
+    const exactGraph = {
+        sessionId: input.graph.sessionId,
+        nodes: input.graph.nodes.filter((n) => n.kind !== "semantic"),
+        edges: input.graph.edges.filter((e) => {
+            const kinds = new Map(input.graph.nodes.map((n) => [n.id, n.kind]));
+            return kinds.get(e.from) !== "semantic" && kinds.get(e.to) !== "semantic";
+        }),
+        resolutions: input.graph.resolutions,
+    };
+    const seeds = input.seeds.filter((id) => exactGraph.nodes.some((n) => n.id === id));
+    return closeSelection({ graph: exactGraph, seeds });
+}

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

@@ -0,0 +1,46 @@
+/**
+ * vector-cortex/reconstruct/types.ts — conservative closure + reconstruction
+ * fidelity contract (VC4C).
+ *
+ * Owns `ClosureResult` / `ReconstructionV1` — the contract of the sprint failure
+ * triad:
+ *
+ *   A = closed semantic + exact/residual reconstruction (the normal path);
+ *   B = greedy EXACT-only closure, forced when semantic validation fails;
+ *   C = legacy prompt, forced by an unresolved contradiction (states its loss of
+ *       old semantic context — TRIAD_RESILIENCE: C is continuity, NOT semantic
+ *       completeness).
+ *
+ * Closure is MANDATORY before VC5 (CONTRACTS §plan and closure): recursively add
+ * every `depends`/tool-pair predecessor until a fixed point; for contradictions
+ * keep the LATER exact source resolution unless an explicit resolution event
+ * names the loser; ties keep both and reject live use
+ * (`CLO_CONTRADICTION_UNRESOLVED`). The anchor floor is preserved, and the closed
+ * mandatory node set is returned with its deterministic token estimate.
+ *
+ * OWNERSHIP BOUNDARY (CONTRACTS §plan and closure): `mandatoryTokenEstimate`
+ * counts CONTENT ONLY — no prompt framing, no role tags, no separators, no
+ * budget admission. VC5A exclusively owns framing/budget: it adds framing cost
+ * to this estimate and returns `MANDATORY_CLOSURE_OVER_BUDGET` if the mandatory
+ * cost exceeds its `tokenBudget`. VC4C therefore NEVER truncates a mandatory
+ * node and never reasons about a budget.
+ *
+ * Consumes only reviewer-accepted predecessor contracts (VC1A `EventV2` byte
+ * authority, VC4A `ShardRange`/`ExactShardV1`, VC4B `ParityShardV1` residual
+ * decode) and the common contracts. Pure types + registered conformance IDs: no
+ * storage, no console, no network (PREVENT-PI-004 / PREVENT-011).
+ */
+/**
+ * Registered CLO conformance ID range (CLO-001..030). The acceptance test reads
+ * these rows from the v2 manifest and asserts each returns its manifest
+ * `ok`/`code`.
+ */
+export const CLO_IDS = Array.from({ length: 30 }, (_v, i) => `CLO-${String(i + 1).padStart(3, "0")}`);
+/** Registered REC conformance ID range (REC-001..030). */
+export const REC_IDS = Array.from({ length: 30 }, (_v, i) => `REC-${String(i + 1).padStart(3, "0")}`);
+/** Named VC4C conformance assertions (the sprint's headline rows). */
+export const RECONSTRUCT_NAMED_IDS = [
+    "CLO-TRANSITIVE-001",
+    "CLO-CONTRA-002",
+    "REC-ORDER-003",
+];

package/dist/vector-cortex/reconstruct/validate.js

@@ -0,0 +1,152 @@
+/**
+ * vector-cortex/reconstruct/validate.ts — reconstruction validation (VC4C).
+ *
+ * Task 5: a validator that rejects a closed selection that would corrupt a live
+ * prompt and emits exactly two events:
+ *   - `vector_cortex_reconstruction_validated`  (the good outcome)
+ *   - `vector_cortex_closure_rejected`          (a rejected/cancelled closure)
+ *
+ * Rejection reasons (the failure codes are the ONLY externally-visible detail):
+ *   - REC_ANCHOR_MISSING          an anchor-floor node is absent from the closure
+ *   - REC_TOOL_PAIR_SPLIT         a tool-pair is not contiguous (PREVENT-PI-002)
+ *   - REC_DIGEST_MISMATCH         a decoded shard's bytes disagree with its digest
+ *   - REC_CONTRADICTION_UNRESOLVED an unresolved tie (closure already failed)
+ *   - REC_SOURCE_UNAVAILABLE      a required shard is missing/erased (failure inj.)
+ *   - REC_SPAN_OVERLAP            two spans intersect in source byte space
+ *
+ * The validator NEVER emits content; it exposes only a `ReconstructionSummary`
+ * (counts + digest + token estimate) or the failure `codes`. Assembly/closure
+ * errors are surfaced but the validator is the authoritative last gate.
+ *
+ * OWNERSHIP: this is a PURE function over its inputs — no storage, no network,
+ * no console. The dashboard/seams that consume it live in extensions/, which may
+ * emit observability; this module stays silent (structured logging contract).
+ */
+import { createHash } from "node:crypto";
+import { assembleSourceOrder } from "./assemble.js";
+/** Flag-gated reporter — mirrors the VC4B residual reporter pattern. */
+export function createReconstructReporter(emit) {
+    const fire = (event, fields) => {
+        if (!emit)
+            return;
+        try {
+            emit(event, fields);
+        }
+        catch {
+            /* non-fatal observability — never break the agent loop */
+        }
+    };
+    return {
+        reconstructionValidated: (fields) => fire("vector_cortex_reconstruction_validated", fields),
+        closureRejected: (fields) => fire("vector_cortex_closure_rejected", fields),
+    };
+}
+/** Sync SHA-256 hex (validator is sync except for assembly's concat digest). */
+function sha256HexSync(bytes) {
+    return createHash("sha256").update(bytes).digest("hex");
+}
+/** Verify each decoded shard's bytes hash to its declared digest (REC_DIGEST_MISMATCH). */
+function findDigestMismatch(shards) {
+    for (const s of shards) {
+        // A pinned digest of "0" is a placeholder: the source tier did not compute a
+        // per-shard digest, so the only guarantee is the post-assembly concatenation
+        // digest. Any other digest is a real pin that must match exactly.
+        if (s.digest === "0")
+            continue;
+        const computed = sha256HexSync(s.bytes);
+        if (computed !== s.digest)
+            return "REC_DIGEST_MISMATCH";
+    }
+    return null;
+}
+/**
+ * Validate a closed selection and, on success, assemble it into source order.
+ * Returns the discriminated `ReconstructionValidation`: ok -> summary only;
+ * fail -> failure codes only. Emits exactly one of the two events.
+ */
+export async function validateAndAssemble(input) {
+    const { graph, closure, nodes, edges, shards, emit } = input;
+    const reporter = createReconstructReporter(emit);
+    // 1. A closure that failed its own contradiction resolution cannot go live.
+    if (!closure.ok) {
+        const codes = ["REC_CONTRADICTION_UNRESOLVED"];
+        reporter.closureRejected({ sessionId: graph.sessionId, codes, reason: "closure-not-ok" });
+        return {
+            validation: { ok: false, codes },
+            reconstruction: null,
+        };
+    }
+    // 2. Anchor-floor discipline (PREVENT-PI-001 restated): every anchor node must
+    //    be present in the closed set, or the closure silently dropped a floor
+    //    item and must be rejected.
+    const anchorMissing = nodes.some((n) => n.anchor === true && !closure.selected.includes(n.id));
+    if (anchorMissing) {
+        reporter.closureRejected({ sessionId: graph.sessionId, codes: ["REC_ANCHOR_MISSING"], reason: "anchor-missing" });
+        return {
+            validation: { ok: false, codes: ["REC_ANCHOR_MISSING"] },
+            reconstruction: null,
+        };
+    }
+    // 3. Unresolved contradiction present in the closed set.
+    if (closure.unresolved.length > 0) {
+        const codes = ["REC_CONTRADICTION_UNRESOLVED"];
+        reporter.closureRejected({ sessionId: graph.sessionId, codes, reason: "unresolved-contradiction" });
+        return {
+            validation: { ok: false, codes },
+            reconstruction: null,
+        };
+    }
+    // 4. Per-shard digest pre-check hook (REC_DIGEST_MISMATCH path preserved).
+    const digestCode = findDigestMismatch(shards);
+    if (digestCode !== null) {
+        reporter.closureRejected({ sessionId: graph.sessionId, codes: [digestCode], reason: "digest-mismatch" });
+        return {
+            validation: { ok: false, codes: [digestCode] },
+            reconstruction: null,
+        };
+    }
+    // 5. Assembly: missing source (REC_SOURCE_UNAVAILABLE) / split pair
+    //    (REC_TOOL_PAIR_SPLIT) / overlap (REC_SPAN_OVERLAP) all surface here.
+    const assembled = await assembleSourceOrder({
+        sessionId: graph.sessionId,
+        selected: closure.selected,
+        nodes,
+        edges,
+        shards,
+        mandatoryTokenEstimate: closure.mandatoryTokenEstimate,
+    });
+    if (assembled.code !== null || assembled.reconstruction === null) {
+        const code = assembled.code ?? "REC_DIGEST_MISMATCH";
+        reporter.closureRejected({ sessionId: graph.sessionId, codes: [code], reason: "assembly-failed" });
+        return {
+            validation: { ok: false, codes: [code] },
+            reconstruction: null,
+        };
+    }
+    const rec = assembled.reconstruction;
+    const summary = buildSummary(rec);
+    reporter.reconstructionValidated({
+        sessionId: rec.sessionId,
+        spanCount: summary.spanCount,
+        protectedSpanCount: summary.protectedSpanCount,
+        byteTotal: summary.byteTotal,
+        mandatoryTokenEstimate: summary.mandatoryTokenEstimate,
+        digest: summary.digest,
+        bySource: summary.bySource,
+    });
+    return { validation: { ok: true, summary }, reconstruction: rec };
+}
+function buildSummary(rec) {
+    const exact = rec.spans.filter((s) => s.source === "exact").length;
+    const residual = rec.spans.filter((s) => s.source === "residual").length;
+    const semantic = rec.spans.filter((s) => s.source === "semantic").length;
+    return {
+        sessionId: rec.sessionId,
+        spanCount: rec.spans.length,
+        protectedSpanCount: rec.spans.filter((s) => s.protectedSpan).length,
+        byteTotal: rec.byteTotal,
+        mandatoryTokenEstimate: rec.mandatoryTokenEstimate,
+        digest: rec.digest,
+        bySource: { exact, residual, semantic },
+    };
+}

package/extensions/dashboard-client/dist/assets/{AreaChart-n4z5w9Ox.js → AreaChart-Cam9-nhT.js}

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