@umriss-ui/calculation 0.34.0 → 0.36.0

package/CHANGELOG.md

@@ -12,6 +12,25 @@ From 0.34.0 all five packages share one number: they are released together, and
 
 ---
 
+## 0.36.0 – No change of its own (Oct. 2026)
+
+Needs `@umriss-ui/core` 0.36; the peer range is `^0.36.0`. No change of its
+own.
+
+## 0.35.0 – React 19 is the floor (Oct. 2026)
+
+Needs `@umriss-ui/core` 0.35; the peer range is `^0.35.0`.
+
+### Changed
+
+- **React 19 is required.** The peers `react` and `react-dom` are `>=19`; `0.34.0` is the last version that serves React 18.
+
+- **The package ships ES2022 syntax.** An application that serves older browsers transpiles it itself.
+
+No other change of its own.
+
+---
+
 ## 0.34.0 – One number for all five packages (Oct. 2026)
 
 From this version all five packages carry one number and are released

package/README.md

@@ -15,8 +15,11 @@ pnpm add @umriss-ui/calculation @umriss-ui/core
 ```
 
 `@umriss-ui/core` is a **peer dependency**: the calculation takes its styling
-regime, formats, wording, assessment and freshness from there. React 18 or 19
-as a peer as well; the unit tests run against 18.3 and 19 in CI.
+regime, formats, wording, assessment and freshness from there. React 19 or newer
+as a peer as well.
+
+The package ships ES2022 syntax; an application that serves older browsers
+transpiles it itself.
 
 Every entry begins with `"use client"`, the directive a framework
 with Server Components reads to treat a module as client code. No test runs

package/dist/calculation.js

@@ -1,74 +1,73 @@
 "use client";
 import "./calculation.css";
-import { jsx as g, jsxs as R } from "react/jsx-runtime";
-import { Children as ke, isValidElement as K, Fragment as Me, useId as Te, useState as re, useRef as Ee, useCallback as Ae, useLayoutEffect as Re, useEffect as De } from "react";
-import { assess as Ie, verdictWeight as se, useDensityFor as Pe, useFormats as Oe, useWording as Se, VisuallyHidden as je, AngleGlyph as Be, Badge as le, useFreshness as Le, Tooltip as Fe } from "@umriss-ui/core";
-function We(t) {
-  return t.decimals !== void 0 ? t.decimals : t.format === "percent" ? 1 : t.given ? void 0 : 2;
+import { jsx as $, jsxs as E } from "react/jsx-runtime";
+import { Children as ke, isValidElement as H, Fragment as Me, useId as Te, useState as re, useRef as Ee, useCallback as Ae, useLayoutEffect as Re, useEffect as De } from "react";
+import { assess as Ie, verdictWeight as oe, useDensityFor as Pe, useFormats as Oe, useWording as Se, VisuallyHidden as je, AngleGlyph as Be, Badge as le, useFreshness as Le, Tooltip as Fe } from "@umriss-ui/core";
+function We(e) {
+  return e.decimals !== void 0 ? e.decimals : e.format === "percent" ? 1 : e.given ? void 0 : 2;
 }
-function Ue(t, e) {
-  return e === void 0 ? t : Math.sign(t) * Number(Math.abs(t).toFixed(e)) || 0;
+function Ue(e, t) {
+  return t === void 0 ? e : Math.sign(e) * Number(Math.abs(e).toFixed(t)) || 0;
 }
-function ae(t, e) {
-  return Ue(t.format === "percent" ? e * 100 : e, We(t));
+function ae(e, t) {
+  return Ue(e.format === "percent" ? t * 100 : t, We(e));
 }
-const Qe = (t, e) => t.format === "percent" ? e / 100 : e;
-function be(t, e, p) {
-  const [s, ...i] = e;
-  switch (t) {
+const Qe = (e, t) => e.format === "percent" ? t / 100 : t;
+function be(e, t, m) {
+  const [o, ...r] = t;
+  switch (e) {
     case "sum":
-      return e.reduce((n, c, S) => p[S] ? n - c : n + c, 0);
+      return t.reduce((n, c, O) => m[O] ? n - c : n + c, 0);
     case "difference":
-      return i.reduce((n, c) => n - c, s);
+      return r.reduce((n, c) => n - c, o);
     case "product":
-      return i.reduce((n, c) => n * c, s);
+      return r.reduce((n, c) => n * c, o);
     case "quotient":
-      return s / i[0];
+      return o / r[0];
   }
 }
-const ge = (t, e) => e === void 0 || t !== void 0 && se(t) >= se(e) ? t : e;
-function Ve(t) {
-  const e = /* @__PURE__ */ new Map(), p = (s) => {
-    var r, u, $;
-    const i = e.get(s);
-    if (i) return i;
-    const n = t.quantities.get(s);
-    let c = null, S, l = !1, y;
+const ge = (e, t) => t === void 0 || e !== void 0 && oe(e) >= oe(t) ? e : t;
+function Ve(e) {
+  const t = /* @__PURE__ */ new Map(), m = (o) => {
+    const r = t.get(o);
+    if (r) return r;
+    const n = e.quantities.get(o);
+    let c = null, O, l = !1, y;
     if (n.given) {
       const a = n.given.value;
-      typeof a == "number" && Number.isFinite(a) ? c = a : S = { kind: "missing", label: n.label };
+      typeof a == "number" && Number.isFinite(a) ? c = a : O = { kind: "missing", label: n.label };
     } else {
-      const a = n.operands.map((v) => ({ operand: v, ...p(v.key) }));
-      for (const { operand: v, verdict: k, worst: M } of a) {
-        const x = v.reference ? k : ge(k, M);
-        y = ge(y, x);
+      const a = n.operands.map((f) => ({ operand: f, ...m(f.key) }));
+      for (const { operand: f, verdict: i, worst: g } of a) {
+        const w = f.reference ? i : ge(i, g);
+        y = ge(y, w);
       }
-      S = (r = a.find((v) => v.absence)) == null ? void 0 : r.absence;
-      const w = a[1];
-      if (!S && n.operator === "quotient" && w.value === 0 && (S = { kind: "zero", label: t.quantities.get(w.operand.key).label }), !S) {
-        const v = n.operands.map((M) => M.negated === !0);
-        c = be(n.operator, a.map((M) => M.value), v);
-        const k = be(
+      O = a.find((f) => f.absence)?.absence;
+      const u = a[1];
+      if (!O && n.operator === "quotient" && u.value === 0 && (O = { kind: "zero", label: e.quantities.get(u.operand.key).label }), !O) {
+        const f = n.operands.map((g) => g.negated === !0);
+        c = be(n.operator, a.map((g) => g.value), f);
+        const i = be(
           n.operator,
-          a.map((M) => Qe(t.quantities.get(M.operand.key), M.shown)),
-          v
+          a.map((g) => Qe(e.quantities.get(g.operand.key), g.shown)),
+          f
         );
-        l = ae(n, k) !== ae(n, c);
+        l = ae(n, i) !== ae(n, c);
       }
     }
-    const A = { target: n.target, limits: n.limits }, L = n.target !== void 0 || (((u = n.limits) == null ? void 0 : u.length) ?? 0) > 0 ? Ie(c, A) : void 0, V = ((($ = n.limits) == null ? void 0 : $.length) ?? 0) > 0 ? L.verdict : c === null ? "unknown" : void 0, F = {
+    const T = { target: n.target, limits: n.limits }, B = n.target !== void 0 || (n.limits?.length ?? 0) > 0 ? Ie(c, T) : void 0, U = (n.limits?.length ?? 0) > 0 ? B.verdict : c === null ? "unknown" : void 0, L = {
       value: c,
-      absence: S,
+      absence: O,
       shown: c === null ? null : ae(n, c),
       approximate: l,
-      assessment: L,
-      verdict: V,
+      assessment: B,
+      verdict: U,
       worst: y
     };
-    return e.set(s, F), F;
+    return t.set(o, L), L;
   };
-  for (const s of t.quantities.keys()) p(s);
-  return e;
+  for (const o of e.quantities.keys()) m(o);
+  return t;
 }
 const ze = () => null, Ge = () => null, He = () => null, Ke = () => null, Ye = () => null, $e = () => null, Je = () => null, Ze = () => null, Xe = () => null, et = () => null, tt = () => null, ce = () => null, nt = /* @__PURE__ */ new Map([
   [Ge, "sum"],
@@ -86,144 +85,144 @@ const ze = () => null, Ge = () => null, He = () => null, Ke = () => null, Ye = (
   [et, { name: "Times", operator: "product" }],
   [tt, { name: "DividedBy", operator: "quotient" }]
 ]), de = "<Given>, <Sum>, <Difference>, <Product>, <Quotient> or <Chain>", ye = "a calculation with metrics only adds and subtracts - <Sum>, <Difference>, <Plus>, <Minus>.", at = ["unit", "format", "decimals"];
-function O(t) {
-  throw new Error(`@umriss-ui/calculation: ${t}`);
+function N(e) {
+  throw new Error(`@umriss-ui/calculation: ${e}`);
 }
-function ee(t) {
-  return ke.toArray(t).flatMap(
-    (e) => K(e) && e.type === Me ? ee(e.props.children) : [e]
+function ee(e) {
+  return ke.toArray(e).flatMap(
+    (t) => H(t) && t.type === Me ? ee(t.props.children) : [t]
   );
 }
-function ne(t) {
-  if (!K(t)) return JSON.stringify(t);
-  const e = t.type;
-  return typeof e == "string" ? `<${e}>` : `<${e.displayName ?? e.name ?? "anonymous"}>`;
+function ne(e) {
+  if (!H(e)) return JSON.stringify(e);
+  const t = e.type;
+  return typeof t == "string" ? `<${t}>` : `<${t.displayName ?? t.name ?? "anonymous"}>`;
 }
-const fe = (t, e, p) => `${t}/${K(e) && e.key || p}`;
-function ot(t, e) {
-  const p = ee(t);
-  if (p.length !== 1 && O(`<Calculation> takes exactly one child, the result; it was given ${p.length}.`), e !== void 0) {
-    e.length === 0 && O("<Calculation>: metrics is empty; leave it out for a calculation with one number per quantity.");
-    const r = /* @__PURE__ */ new Set();
-    for (const { id: u } of e)
-      r.has(u) && O(`<Calculation>: the metric id "${u}" is used twice.`), r.add(u);
+const fe = (e, t, m) => `${e}/${H(t) && t.key || m}`;
+function st(e, t) {
+  const m = ee(e);
+  if (m.length !== 1 && N(`<Calculation> takes exactly one child, the result; it was given ${m.length}.`), t !== void 0) {
+    t.length === 0 && N("<Calculation>: metrics is empty; leave it out for a calculation with one number per quantity.");
+    const a = /* @__PURE__ */ new Set();
+    for (const { id: u } of t)
+      a.has(u) && N(`<Calculation>: the metric id "${u}" is used twice.`), a.add(u);
   }
-  const s = e == null ? void 0 : e.map((r) => `"${r.id}"`).join(", "), i = (r, u) => {
-    const $ = typeof r == "object" && r !== null;
-    if (e === void 0) {
-      $ && O(`${u}: value is an object by metric, but the calculation has no metrics.`);
+  const o = t?.map((a) => `"${a.id}"`).join(", "), r = (a, u) => {
+    const f = typeof a == "object" && a !== null;
+    if (t === void 0) {
+      f && N(`${u}: value is an object by metric, but the calculation has no metrics.`);
       return;
     }
-    $ || O(`${u}: with metrics, value is an object with a number for each metric - ${s}.`);
-    for (const { id: a } of e)
-      a in r || O(`${u}: value has no number for the metric "${a}"; write null where it is absent. The metrics: ${s}.`);
-    for (const a of Object.keys(r))
-      e.some((w) => w.id === a) || O(`${u}: value has a number for "${a}", which is no metric. The metrics: ${s}.`);
-  }, n = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Map(), S = [], l = (r, u, $) => {
-    const { id: a, ...w } = u;
-    if (e !== void 0) {
-      for (const k of at)
-        u[k] !== void 0 && O(`${$}: ${k} belongs to the metric once the calculation has metrics, not to a quantity.`);
-      (u.target !== void 0 || u.limits !== void 0) && O(`${$}: target and limits are not assessed in a calculation with metrics.`);
+    f || N(`${u}: with metrics, value is an object with a number for each metric - ${o}.`);
+    for (const { id: i } of t)
+      i in a || N(`${u}: value has no number for the metric "${i}"; write null where it is absent. The metrics: ${o}.`);
+    for (const i of Object.keys(a))
+      t.some((g) => g.id === i) || N(`${u}: value has a number for "${i}", which is no metric. The metrics: ${o}.`);
+  }, n = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Map(), O = [], l = (a, u, f) => {
+    const { id: i, ...g } = u;
+    if (t !== void 0) {
+      for (const A of at)
+        u[A] !== void 0 && N(`${f}: ${A} belongs to the metric once the calculation has metrics, not to a quantity.`);
+      (u.target !== void 0 || u.limits !== void 0) && N(`${f}: target and limits are not assessed in a calculation with metrics.`);
     }
-    a !== void 0 && (c.has(a) && O(`${$}: the id "${a}" is used twice.`), c.set(a, r));
-    const v = { ...w, key: r, id: a, operands: [] };
-    return n.set(r, v), v;
-  }, y = (r, u, $) => {
-    if (K(r) && r.type === $e) {
-      const a = { key: "", reference: !0 };
-      return S.push({ operand: a, to: r.props.to, where: $ }), a;
+    i !== void 0 && (c.has(i) && N(`${f}: the id "${i}" is used twice.`), c.set(i, a));
+    const w = { ...g, key: a, id: i, operands: [] };
+    return n.set(a, w), w;
+  }, y = (a, u, f) => {
+    if (H(a) && a.type === $e) {
+      const i = { key: "", reference: !0 };
+      return O.push({ operand: i, to: a.props.to, where: f }), i;
     }
-    return { key: A(r, u, $), reference: !1 };
-  }, A = (r, u, $) => {
-    if ((!K(r) || r.type === $e || ue.has(r.type) || r.type === ce) && O(`${$}: ${ne(r)} cannot stand here; a quantity must be ${de}.`), r.type === Je) return L(r.props.children, u, $);
-    const a = nt.get(r.type);
-    r.type !== ze && a === void 0 && O(
-      `${$}: ${ne(r)} is not an element of the calculation. A calculation reads its children's props and cannot look inside a component of your own; write ${de} or <Ref> directly, or return them from .map.`
+    return { key: T(a, u, f), reference: !1 };
+  }, T = (a, u, f) => {
+    if ((!H(a) || a.type === $e || ue.has(a.type) || a.type === ce) && N(`${f}: ${ne(a)} cannot stand here; a quantity must be ${de}.`), a.type === Je) return B(a.props.children, u, f);
+    const i = nt.get(a.type);
+    a.type !== ze && i === void 0 && N(
+      `${f}: ${ne(a)} is not an element of the calculation. A calculation reads its children's props and cannot look inside a component of your own; write ${de} or <Ref> directly, or return them from .map.`
     );
-    const { children: w, value: v, source: k, asOf: M, ages: x, ...D } = r.props, b = `${$} › ${D.label}`;
-    e !== void 0 && (a === "product" || a === "quotient") && O(`${b}: <${_e[a]}> - ${ye}`);
-    const C = l(u, D, b);
-    if (a === void 0)
-      return i(v, b), C.given = { value: v, source: k, asOf: M, ages: x }, u;
-    C.operator = a;
-    const _ = ee(w), N = _.length;
-    return (a === "quotient" ? N !== 2 : a !== "sum" && N < 2) && O(
-      `${b}: <${_e[a]}> takes ${a === "quotient" ? "exactly two operands" : "two or more operands"}; it was given ${N}.`
-    ), C.operands = _.map((o, d) => y(o, fe(u, o, d), b)), u;
-  }, L = (r, u, $) => {
-    const a = `${$} › <Chain>`, [w, ...v] = ee(r);
-    (w === void 0 || K(w) && (ue.has(w.type) || w.type === ce)) && O(`${a}: a chain starts with a quantity that has no operator - ${de} or <Ref>.`);
-    let k = y(w, fe(u, w, 0), a), M = ne(w), x = [], D;
-    return v.forEach((b, C) => {
+    const { children: g, value: w, source: A, asOf: Q, ages: k, ...R } = a.props, b = `${f} › ${R.label}`;
+    t !== void 0 && (i === "product" || i === "quotient") && N(`${b}: <${_e[i]}> - ${ye}`);
+    const C = l(u, R, b);
+    if (i === void 0)
+      return r(w, b), C.given = { value: w, source: A, asOf: Q, ages: k }, u;
+    C.operator = i;
+    const _ = ee(g), S = _.length;
+    return (i === "quotient" ? S !== 2 : i !== "sum" && S < 2) && N(
+      `${b}: <${_e[i]}> takes ${i === "quotient" ? "exactly two operands" : "two or more operands"}; it was given ${S}.`
+    ), C.operands = _.map((s, d) => y(s, fe(u, s, d), b)), u;
+  }, B = (a, u, f) => {
+    const i = `${f} › <Chain>`, [g, ...w] = ee(a);
+    (g === void 0 || H(g) && (ue.has(g.type) || g.type === ce)) && N(`${i}: a chain starts with a quantity that has no operator - ${de} or <Ref>.`);
+    let A = y(g, fe(u, g, 0), i), Q = ne(g), k = [], R;
+    return w.forEach((b, C) => {
       const _ = fe(u, b, C + 1);
-      if (K(b) && b.type === ce) {
-        const U = b.props, G = `${a} › ${U.label}`;
-        x.length === 0 && O(`${G}: an <Interim> needs an operand since the named value before it, ${M}.`);
-        const H = l(_, U, G);
-        H.interim = !0, H.operator = x[0].line.operator, H.operands = [k, ...x.map((te) => te.operand)], k = { key: _, reference: !1, previous: !0 }, M = `<Interim label="${U.label}">`, x = [], D = _;
+      if (H(b) && b.type === ce) {
+        const W = b.props, z = `${i} › ${W.label}`;
+        k.length === 0 && N(`${z}: an <Interim> needs an operand since the named value before it, ${Q}.`);
+        const G = l(_, W, z);
+        G.interim = !0, G.operator = k[0].line.operator, G.operands = [A, ...k.map((te) => te.operand)], A = { key: _, reference: !1, previous: !0 }, Q = `<Interim label="${W.label}">`, k = [], R = _;
         return;
       }
-      const N = K(b) ? ue.get(b.type) : void 0;
-      N === void 0 && O(`${a}: ${ne(b)} needs an operator in a chain - <Plus>, <Minus>, <Times> or <DividedBy> - or is an <Interim>.`), e !== void 0 && N.operator !== "sum" && O(`${a}: <${N.name}> - ${ye}`);
-      const o = N.operator !== "sum", d = x.find((U) => U.line.operator !== "sum");
-      (o && x.length > 0 || d) && O(
-        `${a}: <${(d ?? { line: N }).line.name}> stands alone between two named values - directly after the first quantity or an <Interim>, and directly before an <Interim>.`
+      const S = H(b) ? ue.get(b.type) : void 0;
+      S === void 0 && N(`${i}: ${ne(b)} needs an operator in a chain - <Plus>, <Minus>, <Times> or <DividedBy> - or is an <Interim>.`), t !== void 0 && S.operator !== "sum" && N(`${i}: <${S.name}> - ${ye}`);
+      const s = S.operator !== "sum", d = k.find((W) => W.line.operator !== "sum");
+      (s && k.length > 0 || d) && N(
+        `${i}: <${(d ?? { line: S }).line.name}> stands alone between two named values - directly after the first quantity or an <Interim>, and directly before an <Interim>.`
       );
-      const { children: h, ...T } = b.props, f = ee(h), I = () => O(`${a}: <${N.name}> takes either a label and a value, or exactly one quantity as its child.`);
-      if (f.length > 0) {
-        (f.length > 1 || Object.values(T).some((G) => G !== void 0)) && I();
-        const U = y(f[0], _, a);
-        U.negated = N.negated, x.push({ operand: U, line: N });
+      const { children: v, ...q } = b.props, p = ee(v), D = () => N(`${i}: <${S.name}> takes either a label and a value, or exactly one quantity as its child.`);
+      if (p.length > 0) {
+        (p.length > 1 || Object.values(q).some((z) => z !== void 0)) && D();
+        const W = y(p[0], _, i);
+        W.negated = S.negated, k.push({ operand: W, line: S });
         return;
       }
-      T.label === void 0 && I();
-      const { value: P, source: E, asOf: j, ages: Y, ...z } = T, B = `${a} › ${T.label}`, W = l(_, { ...z, label: T.label }, B);
-      i(P, B), W.given = { value: P, source: E, asOf: j, ages: Y }, x.push({ operand: { key: _, reference: !1, negated: N.negated }, line: N });
-    }), (x.length > 0 || D === void 0) && O(`${a}: a chain ends with an <Interim>, which names its value.`), D;
-  }, V = A(p[0], "0", "<Calculation>"), F = n.get(V);
-  (F.emphasis !== void 0 || F.rule !== void 0) && O(`<Calculation> › ${F.label}: emphasis and rule do not stand on the Result, which is already the heaviest line.`);
-  for (const { operand: r, to: u, where: $ } of S) {
-    const a = c.get(u);
-    if (a === void 0) {
-      const w = [...c.keys()].map((v) => `"${v}"`).join(", ");
-      O(`${$}: <Ref to="${u}"> names no quantity. ${w ? `The ids that exist: ${w}.` : "No quantity has an id."}`);
+      q.label === void 0 && D();
+      const { value: I, source: M, asOf: P, ages: K, ...V } = q, j = `${i} › ${q.label}`, F = l(_, { ...V, label: q.label }, j);
+      r(I, j), F.given = { value: I, source: M, asOf: P, ages: K }, k.push({ operand: { key: _, reference: !1, negated: S.negated }, line: S });
+    }), (k.length > 0 || R === void 0) && N(`${i}: a chain ends with an <Interim>, which names its value.`), R;
+  }, U = T(m[0], "0", "<Calculation>"), L = n.get(U);
+  (L.emphasis !== void 0 || L.rule !== void 0) && N(`<Calculation> › ${L.label}: emphasis and rule do not stand on the Result, which is already the heaviest line.`);
+  for (const { operand: a, to: u, where: f } of O) {
+    const i = c.get(u);
+    if (i === void 0) {
+      const g = [...c.keys()].map((w) => `"${w}"`).join(", ");
+      N(`${f}: <Ref to="${u}"> names no quantity. ${g ? `The ids that exist: ${g}.` : "No quantity has an id."}`);
     }
-    r.key = a;
+    a.key = i;
   }
-  return it(n), { result: V, quantities: n, metrics: e };
+  return it(n), { result: U, quantities: n, metrics: t };
 }
-function st(t) {
-  return t.metrics ? t.metrics.map((e) => {
-    const p = /* @__PURE__ */ new Map();
-    for (const [s, i] of t.quantities) {
-      const n = i.given && { ...i.given, value: i.given.value[e.id] };
-      p.set(s, { ...i, unit: e.unit, decimals: e.decimals, given: n });
+function ot(e) {
+  return e.metrics ? e.metrics.map((t) => {
+    const m = /* @__PURE__ */ new Map();
+    for (const [o, r] of e.quantities) {
+      const n = r.given && { ...r.given, value: r.given.value[t.id] };
+      m.set(o, { ...r, unit: t.unit, decimals: t.decimals, given: n });
     }
-    return { result: t.result, quantities: p };
-  }) : [t];
+    return { result: e.result, quantities: m };
+  }) : [e];
 }
-function it(t) {
-  const e = /* @__PURE__ */ new Set(), p = [], s = (i) => {
-    if (e.has(i)) return;
-    const n = p.indexOf(i);
+function it(e) {
+  const t = /* @__PURE__ */ new Set(), m = [], o = (r) => {
+    if (t.has(r)) return;
+    const n = m.indexOf(r);
     if (n !== -1) {
-      const c = [...p.slice(n), i].map((S) => t.get(S).label);
-      O(`the calculation goes round in a circle through references: ${c.join(" → ")}.`);
+      const c = [...m.slice(n), r].map((O) => e.get(O).label);
+      N(`the calculation goes round in a circle through references: ${c.join(" → ")}.`);
     }
-    p.push(i);
-    for (const c of t.get(i).operands) s(c.key);
-    p.pop(), e.add(i);
+    m.push(r);
+    for (const c of e.get(r).operands) o(c.key);
+    m.pop(), t.add(r);
   };
-  for (const i of t.keys()) s(i);
+  for (const r of e.keys()) o(r);
 }
 const we = 4;
-function rt(t, e, p) {
-  const s = t.operands[e];
-  if (s.previous) return;
-  const i = t.operator, n = e === 0;
-  if (i !== "sum" && i !== "difference") return n ? void 0 : { operator: i, negated: !1 };
-  const c = i === "difference" ? !n : s.negated === !0, S = new Set(p.filter((y) => y !== null && y !== 0).map(Math.sign)), l = S.size === 1 ? { operator: "sum", negated: c !== S.has(-1), unsigned: !0 } : { operator: "sum", negated: c };
+function rt(e, t, m) {
+  const o = e.operands[t];
+  if (o.previous) return;
+  const r = e.operator, n = t === 0;
+  if (r !== "sum" && r !== "difference") return n ? void 0 : { operator: r, negated: !1 };
+  const c = r === "difference" ? !n : o.negated === !0, O = new Set(m.filter((y) => y !== null && y !== 0).map(Math.sign)), l = O.size === 1 ? { operator: "sum", negated: c !== O.has(-1), unsigned: !0 } : { operator: "sum", negated: c };
   return n && !l.negated ? void 0 : l;
 }
 const lt = {
@@ -237,68 +236,67 @@ const lt = {
   product: "calculationProductWord",
   quotient: "calculationQuotientWord"
 };
-function oe(t, e) {
-  switch (t) {
+function se(e, t) {
+  switch (e) {
     case "alarm":
-      return e.verdictAlarm;
+      return t.verdictAlarm;
     case "warning":
-      return e.verdictWarning;
+      return t.verdictWarning;
     case "unknown":
-      return e.verdictUnknown;
+      return t.verdictUnknown;
     default:
-      return e.verdictOk;
+      return t.verdictOk;
   }
 }
-function ie(t, e, p) {
-  const s = t.negated ? "difference" : t.operator;
-  return p[(e ? ct : lt)[s]];
+function ie(e, t, m) {
+  const o = e.negated ? "difference" : e.operator;
+  return m[(t ? ct : lt)[o]];
 }
-function ut(t, e) {
-  return t.kind === "missing" ? e.calculationMissing(t.label) : e.calculationDivisionByZero(t.label);
+function ut(e, t) {
+  return e.kind === "missing" ? t.calculationMissing(e.label) : t.calculationDivisionByZero(e.label);
 }
-function Ne(t, e, p, s) {
-  const i = t.format === "percent" ? s : t.unit, n = p.number(e, t.decimals);
-  return i ? `${n} ${i}` : n;
+function Ne(e, t, m, o) {
+  const r = e.format === "percent" ? o : e.unit, n = m.number(t, e.decimals);
+  return r ? `${n} ${r}` : n;
 }
-function dt(t, e, p, s, i, n, c, S = () => {
+function dt(e, t, m, o, r, n, c, O = () => {
 }) {
-  const l = t.quantities.get(p), y = e.get(p), A = (b, C) => b.shown !== null && (C != null && C.unsigned) ? Math.abs(b.shown) : b.shown, L = (b, C, _, N) => {
-    const o = A(C, N);
-    return o === null ? _ ? n.verdictUnknown : n.statAbsentValue : Ne(b, o, i, _ ? n.calculationPercent : "%");
-  }, V = (b) => {
-    if (s || !l.operator) return {};
+  const l = e.quantities.get(m), y = t.get(m), T = (b, C) => b.shown !== null && C?.unsigned ? Math.abs(b.shown) : b.shown, B = (b, C, _, S) => {
+    const s = T(C, S);
+    return s === null ? _ ? n.verdictUnknown : n.statAbsentValue : Ne(b, s, r, _ ? n.calculationPercent : "%");
+  }, U = (b) => {
+    if (o || !l.operator) return {};
     if (l.operands.length === 0) return { names: n.calculationNoOperands };
     if (!b && l.operands.length > we)
       return { names: n.calculationOperandCount(l.operands.length) };
-    const C = (_) => l.operands.map((N, o) => {
-      const d = t.quantities.get(N.key), h = S(o);
-      return h ? `${ie(h, b, n)} ${_(d, h)}` : _(d);
+    const C = (_) => l.operands.map((S, s) => {
+      const d = e.quantities.get(S.key), v = O(s);
+      return v ? `${ie(v, b, n)} ${_(d, v)}` : _(d);
     }).join(" ");
     return {
       names: C((_) => _.label),
-      numbers: C((_, N) => L(_, e.get(_.key), b, N))
+      numbers: C((_, S) => B(_, t.get(_.key), b, S))
     };
-  }, F = (b) => {
-    var N;
-    const C = (N = y.assessment) == null ? void 0 : N.deviation;
+  }, L = (b) => {
+    const C = y.assessment?.deviation;
     if (C === void 0 || l.target === void 0) return;
-    const _ = Ne(l, ae(l, l.target), i, b ? n.calculationPercent : "%");
+    const _ = Ne(l, ae(l, l.target), r, b ? n.calculationPercent : "%");
     return C > 0 ? n.calculationAboveTarget(_) : C < 0 ? n.calculationBelowTarget(_) : n.calculationOnTarget(_);
-  }, r = V(!1).names, u = r === void 0 || l.operands.length === 0 || l.operands.length > we ? r : `= ${r}`, $ = V(!0), a = y.absence ? ut(y.absence, n) : void 0, w = ` ${n.calculationEquals} `, v = y.approximate ? `${n.calculationApproximately} ${L(l, y, !0, c)}` : L(l, y, !0, c), M = [
-    (c ? `${ie(c, !0, n)} ` : "") + l.label + w + [$.names, $.numbers, v].filter(Boolean).join(`,${w}`),
-    y.verdict !== void 0 && y.verdict !== "unknown" ? oe(y.verdict, n) : void 0,
-    F(!0),
-    a
-  ].filter(Boolean).join(", "), x = y.shown === null ? void 0 : l.format === "percent" ? "%" : l.unit, D = (b) => b === null ? n.statAbsentValue : i.number(b, l.decimals);
-  return { amount: D(A(y, c)), ownAmount: D(y.shown), unit: x, names: u, target: F(!1), reason: a, sentence: M, spokenNames: $.names, spokenNumber: v };
+  }, a = U(!1).names, u = a === void 0 || l.operands.length === 0 || l.operands.length > we ? a : `= ${a}`, f = U(!0), i = y.absence ? ut(y.absence, n) : void 0, g = ` ${n.calculationEquals} `, w = y.approximate ? `${n.calculationApproximately} ${B(l, y, !0, c)}` : B(l, y, !0, c), Q = [
+    (c ? `${ie(c, !0, n)} ` : "") + l.label + g + [f.names, f.numbers, w].filter(Boolean).join(`,${g}`),
+    y.verdict !== void 0 && y.verdict !== "unknown" ? se(y.verdict, n) : void 0,
+    L(!0),
+    i
+  ].filter(Boolean).join(", "), k = y.shown === null ? void 0 : l.format === "percent" ? "%" : l.unit, R = (b) => b === null ? n.statAbsentValue : r.number(b, l.decimals);
+  return { amount: R(T(y, c)), ownAmount: R(y.shown), unit: k, names: u, target: L(!1), reason: i, sentence: Q, spokenNames: f.names, spokenNumber: w };
 }
-function ft(t, e, p, s, i) {
-  const n = i ? `${ie(i, !0, s)} ` : "", c = e[0].spokenNames, S = n + t + (c === void 0 ? "" : ` ${s.calculationEquals} ${c}`), l = p.map(
-    (y, A) => [`${y.label} ${e[A].spokenNumber}`, e[A].reason].filter(Boolean).join(", ")
+function ft(e, t, m, o, r) {
+  const n = r ? `${ie(r, !0, o)} ` : "", c = t[0].spokenNames, O = n + e + (c === void 0 ? "" : ` ${o.calculationEquals} ${c}`), l = m.map(
+    (y, T) => [`${y.label} ${t[T].spokenNumber}`, t[T].reason].filter(Boolean).join(", ")
   );
-  return `${S}: ${l.join("; ")}`;
+  return `${O}: ${l.join("; ")}`;
 }
-const pt = "_frame_abb5t_24 _text_18806_22", mt = "_calculation_abb5t_51", ht = "_line_abb5t_86", vt = "_assessment_abb5t_98", bt = "_disclosure_abb5t_107", gt = "_amount_abb5t_90", $t = "_list_abb5t_128", _t = "_item_abb5t_129", yt = "_derivation_abb5t_130", wt = "_labelCell_abb5t_90", Nt = "_names_abb5t_90", Ot = "_operator_abb5t_90", St = "_unit_abb5t_90", Ct = "_label_abb5t_90", qt = "_approximate_abb5t_345", xt = "_target_abb5t_102", kt = "_worst_abb5t_102", Mt = "_head_abb5t_497", Tt = "_headCell_abb5t_504", Et = "_headUnit_abb5t_517", At = "_notes_abb5t_524", Rt = "_freshness_abb5t_538", Dt = "_headLabel_abb5t_568", m = {
+const pt = "_frame_abb5t_24 _text_18806_22", mt = "_calculation_abb5t_51", ht = "_line_abb5t_86", vt = "_assessment_abb5t_98", bt = "_disclosure_abb5t_107", gt = "_amount_abb5t_90", $t = "_list_abb5t_128", _t = "_item_abb5t_129", yt = "_derivation_abb5t_130", wt = "_labelCell_abb5t_90", Nt = "_names_abb5t_90", Ot = "_operator_abb5t_90", St = "_unit_abb5t_90", Ct = "_label_abb5t_90", qt = "_approximate_abb5t_345", xt = "_target_abb5t_102", kt = "_worst_abb5t_102", Mt = "_head_abb5t_497", Tt = "_headCell_abb5t_504", Et = "_headUnit_abb5t_517", At = "_notes_abb5t_524", Rt = "_freshness_abb5t_538", Dt = "_headLabel_abb5t_568", h = {
   frame: pt,
   calculation: mt,
   line: ht,
@@ -322,222 +320,221 @@ const pt = "_frame_abb5t_24 _text_18806_22", mt = "_calculation_abb5t_51", ht =
   notes: At,
   freshness: Rt,
   headLabel: Dt
-}, It = 10, X = (t) => 4 + 2 * t, Pt = (t) => 5 + 2 * t, jt = { ok: "success", unknown: "neutral", warning: "warning", alarm: "danger" }, Bt = (...t) => t.filter(Boolean).join(" ");
-function Lt({ asOf: t, ages: e }) {
-  const p = Oe(), s = Se(), i = Le(t, e), n = i.freshness === "lost" ? s.freshnessDisconnected : i.freshness === "stale" ? s.freshnessStale : s.freshnessFresh;
-  return /* @__PURE__ */ R("span", { className: m.freshness, "data-freshness": i.freshness, children: [
+}, It = 10, X = (e) => 4 + 2 * e, Pt = (e) => 5 + 2 * e, jt = { ok: "success", unknown: "neutral", warning: "warning", alarm: "danger" }, Bt = (...e) => e.filter(Boolean).join(" ");
+function Lt({ asOf: e, ages: t }) {
+  const m = Oe(), o = Se(), r = Le(e, t), n = r.freshness === "lost" ? o.freshnessDisconnected : r.freshness === "stale" ? o.freshnessStale : o.freshnessFresh;
+  return /* @__PURE__ */ E("span", { className: h.freshness, "data-freshness": r.freshness, children: [
     n,
-    i.age !== null && ` · ${p.relative(i.age)}`
+    r.age !== null && ` · ${m.relative(r.age)}`
   ] });
 }
-function Qt({ children: t, className: e, style: p, metrics: s, density: i, ...n }) {
-  const c = Pe(i, "regular") === "compact", S = Oe(), l = Se(), y = Te(), A = ot(t, s), L = st(A).map((o) => ({ view: o, results: Ve(o) })), [V, F] = re(() => /* @__PURE__ */ new Set()), [r, u] = re(null), $ = Ee(null), [a, w] = re(!1), v = (s == null ? void 0 : s.length) ?? 0, k = Ae(() => {
-    const o = $.current, d = o && v > 0 ? getComputedStyle(o.firstElementChild).gridTemplateColumns.split(" ").map(parseFloat) : [], h = X(v) - 1;
-    if (!o || d.length <= h || d.some((E) => !Number.isFinite(E))) {
-      w(!1);
+function Qt({ children: e, className: t, style: m, metrics: o, density: r, ...n }) {
+  const c = Pe(r, "regular") === "compact", O = Oe(), l = Se(), y = Te(), T = st(e, o), B = ot(T).map((s) => ({ view: s, results: Ve(s) })), [U, L] = re(() => /* @__PURE__ */ new Set()), [a, u] = re(null), f = Ee(null), [i, g] = re(!1), w = o?.length ?? 0, A = Ae(() => {
+    const s = f.current, d = s && w > 0 ? getComputedStyle(s.firstElementChild).gridTemplateColumns.split(" ").map(parseFloat) : [], v = X(w) - 1;
+    if (!s || d.length <= v || d.some((M) => !Number.isFinite(M))) {
+      g(!1);
       return;
     }
-    const T = d.slice(2, h).reduce((E, j) => E + j, 0);
-    let f = 0;
-    const I = document.createRange();
-    for (const E of o.querySelectorAll(`.${m.label}`)) {
-      I.selectNodeContents(E);
-      const j = [...I.getClientRects()].reduce((B, W) => B + W.width, 0);
-      if (j === 0) continue;
-      const Y = E.parentElement, z = E.getBoundingClientRect().left - Y.getBoundingClientRect().left;
-      f = Math.max(f, z + j + parseFloat(getComputedStyle(Y).paddingRight));
+    const q = d.slice(2, v).reduce((M, P) => M + P, 0);
+    let p = 0;
+    const D = document.createRange();
+    for (const M of s.querySelectorAll(`.${h.label}`)) {
+      D.selectNodeContents(M);
+      const P = [...D.getClientRects()].reduce((j, F) => j + F.width, 0);
+      if (P === 0) continue;
+      const K = M.parentElement, V = M.getBoundingClientRect().left - K.getBoundingClientRect().left;
+      p = Math.max(p, V + P + parseFloat(getComputedStyle(K).paddingRight));
     }
-    const P = parseFloat(getComputedStyle(document.documentElement).fontSize);
-    w(o.clientWidth - T < Math.min(f, It * P));
-  }, [v]);
-  Re(() => k()), De(() => {
-    const o = $.current;
-    if (!o || v === 0) return;
-    const d = new ResizeObserver(() => k());
-    return d.observe(o), () => d.disconnect();
-  }, [k, v]);
-  const M = (o) => F((d) => {
-    const h = new Set(d);
-    return h.delete(o) || h.add(o), h;
-  }), x = (o, d) => rt(
-    o,
+    const I = parseFloat(getComputedStyle(document.documentElement).fontSize);
+    g(s.clientWidth - q < Math.min(p, It * I));
+  }, [w]);
+  Re(() => A()), De(() => {
+    const s = f.current;
+    if (!s || w === 0) return;
+    const d = new ResizeObserver(() => A());
+    return d.observe(s), () => d.disconnect();
+  }, [A, w]);
+  const Q = (s) => L((d) => {
+    const v = new Set(d);
+    return v.delete(s) || v.add(s), v;
+  }), k = (s, d) => rt(
+    s,
     d,
-    L.map(({ results: h }) => h.get(o.operands[d].key).shown)
+    B.map(({ results: v }) => v.get(s.operands[d].key).shown)
   );
-  let D = !1;
-  const b = (o, d) => o.map(({ own: h, text: T }, f) => [
-    /* @__PURE__ */ R(
+  let R = !1;
+  const b = (s, d) => s.map(({ own: v, text: q }, p) => [
+    /* @__PURE__ */ E(
       "span",
       {
-        className: m.amount,
+        className: h.amount,
         "aria-hidden": "true",
-        "data-verdict": h.verdict,
-        "data-later": f > 0 ? "" : void 0,
-        style: s ? { "--column": X(f) } : void 0,
+        "data-verdict": v.verdict,
+        "data-later": p > 0 ? "" : void 0,
+        style: o ? { "--column": X(p) } : void 0,
         children: [
-          h.approximate && /* @__PURE__ */ g(Fe, { content: l.calculationApproximateNote, children: /* @__PURE__ */ g("span", { className: m.approximate, children: "≈" }) }),
-          d ? T.ownAmount : T.amount
+          v.approximate && /* @__PURE__ */ $(Fe, { content: l.calculationApproximateNote, children: /* @__PURE__ */ $("span", { className: h.approximate, children: "≈" }) }),
+          d ? q.ownAmount : q.amount
         ]
       },
-      `amount-${f}`
+      `amount-${p}`
     ),
-    /* @__PURE__ */ g(
+    /* @__PURE__ */ $(
       "span",
       {
-        className: m.unit,
+        className: h.unit,
         "aria-hidden": "true",
-        style: s ? { "--column": Pt(f) } : void 0,
-        "data-last": s && f === o.length - 1 ? "" : void 0,
-        children: s && !d ? void 0 : T.unit
+        style: o ? { "--column": Pt(p) } : void 0,
+        "data-last": o && p === s.length - 1 ? "" : void 0,
+        children: o && !d ? void 0 : q.unit
       },
-      `unit-${f}`
+      `unit-${p}`
     )
-  ]), C = (o, d) => r === null ? void 0 : o === r ? "use" : d === r ? "operand" : void 0, _ = (o, d, h, T) => {
-    const f = A.quantities.get(o), I = L.map(({ view: q, results: J }) => ({
-      own: J.get(o),
-      text: dt(q, J, o, d, S, l, h.position, (xe) => x(f, xe))
-    })), { own: P, text: E } = I[0], j = f.operator !== void 0 && !d, Y = o === A.result && !d, z = j && f.operands.length > 0 && (f.interim ? h.flat : Y), B = j && !z && f.operands.length > 0, W = B && V.has(o);
-    D || (D = B);
-    const U = `${y}-${o}`, G = { depth: z ? h.depth : h.depth + 1, flat: !1, parent: o }, H = j ? f.operands.find((q) => q.previous) : void 0, te = H && h.flat ? _(H.key, !1, { ...h, parent: o, position: void 0 }, `${T}-c`) : [], Ce = H && !h.flat ? _(H.key, !1, { ...G, flat: !0 }, `${T}-c`) : [], pe = j ? f.operands.map(
-      (q, J) => q.previous ? null : _(q.key, q.reference, { ...G, position: x(f, J) }, `${T}-${J}`)
-    ) : [], Z = B && !W && P.worst !== void 0 && se(P.worst) > se(P.verdict ?? "ok") ? P.worst : void 0, Q = d ? void 0 : f.given, qe = h.position ? ie(h.position, !1, l) : void 0, me = [
-      !d && f.explanation !== void 0 && /* @__PURE__ */ g("span", { children: f.explanation }, "explanation"),
-      (Q == null ? void 0 : Q.source) !== void 0 && /* @__PURE__ */ g("span", { children: l.calculationSource(Q.source) }, "source"),
-      (Q == null ? void 0 : Q.asOf) !== void 0 && (Q.ages !== void 0 ? /* @__PURE__ */ g(Lt, { asOf: Q.asOf, ages: Q.ages }, "asOf") : /* @__PURE__ */ g("span", { children: l.asOfAgo(S.dateTime(new Date(Q.asOf), !1)) }, "asOf")),
-      !d && f.aside !== void 0 && /* @__PURE__ */ g("span", { children: f.aside }, "aside")
-    ].filter(Boolean), he = Y ? "result" : f.interim && !d && h.flat ? "interim" : void 0, ve = /* @__PURE__ */ R(
+  ]), C = (s, d) => a === null ? void 0 : s === a ? "use" : d === a ? "operand" : void 0, _ = (s, d, v, q) => {
+    const p = T.quantities.get(s), D = B.map(({ view: x, results: J }) => ({
+      own: J.get(s),
+      text: dt(x, J, s, d, O, l, v.position, (xe) => k(p, xe))
+    })), { own: I, text: M } = D[0], P = p.operator !== void 0 && !d, K = s === T.result && !d, V = P && p.operands.length > 0 && (p.interim ? v.flat : K), j = P && !V && p.operands.length > 0, F = j && U.has(s);
+    R ||= j;
+    const W = `${y}-${s}`, z = { depth: V ? v.depth : v.depth + 1, flat: !1, parent: s }, G = P ? p.operands.find((x) => x.previous) : void 0, te = G && v.flat ? _(G.key, !1, { ...v, parent: s, position: void 0 }, `${q}-c`) : [], Ce = G && !v.flat ? _(G.key, !1, { ...z, flat: !0 }, `${q}-c`) : [], pe = P ? p.operands.map(
+      (x, J) => x.previous ? null : _(x.key, x.reference, { ...z, position: k(p, J) }, `${q}-${J}`)
+    ) : [], Z = j && !F && I.worst !== void 0 && oe(I.worst) > oe(I.verdict ?? "ok") ? I.worst : void 0, Y = d ? void 0 : p.given, qe = v.position ? ie(v.position, !1, l) : void 0, me = [
+      !d && p.explanation !== void 0 && /* @__PURE__ */ $("span", { children: p.explanation }, "explanation"),
+      Y?.source !== void 0 && /* @__PURE__ */ $("span", { children: l.calculationSource(Y.source) }, "source"),
+      Y?.asOf !== void 0 && (Y.ages !== void 0 ? /* @__PURE__ */ $(Lt, { asOf: Y.asOf, ages: Y.ages }, "asOf") : /* @__PURE__ */ $("span", { children: l.asOfAgo(O.dateTime(new Date(Y.asOf), !1)) }, "asOf")),
+      !d && p.aside !== void 0 && /* @__PURE__ */ $("span", { children: p.aside }, "aside")
+    ].filter(Boolean), he = K ? "result" : p.interim && !d && v.flat ? "interim" : void 0, ve = /* @__PURE__ */ E(
       "div",
       {
-        className: m.line,
-        style: { "--depth": h.depth },
-        "data-inner": h.depth > 0 ? "" : void 0,
+        className: h.line,
+        style: { "--depth": v.depth },
+        "data-inner": v.depth > 0 ? "" : void 0,
         "data-kind": he,
-        "data-foldable": B ? "" : void 0,
+        "data-foldable": j ? "" : void 0,
         "data-reference": d ? "" : void 0,
-        "data-emphasis": d ? void 0 : f.emphasis,
-        "data-rule": !d && f.rule ? "" : void 0,
-        "data-mark": C(o, h.parent),
-        onPointerEnter: () => u(o),
+        "data-emphasis": d ? void 0 : p.emphasis,
+        "data-rule": !d && p.rule ? "" : void 0,
+        "data-mark": C(s, v.parent),
+        onPointerEnter: () => u(s),
         onPointerLeave: () => u(null),
-        onFocus: () => u(o),
+        onFocus: () => u(s),
         onBlur: () => u(null),
-        onClick: B ? () => {
-          var q;
-          (q = window.getSelection()) != null && q.toString() || M(o);
+        onClick: j ? () => {
+          window.getSelection()?.toString() || Q(s);
         } : void 0,
         children: [
-          /* @__PURE__ */ g(je, { children: [
-            s ? ft(f.label, I.map((q) => q.text), s, l, h.position) : E.sentence,
-            I.some((q) => q.own.approximate) && l.calculationApproximateNote,
-            Z !== void 0 && l.calculationWorstInside(oe(Z, l))
+          /* @__PURE__ */ $(je, { children: [
+            o ? ft(p.label, D.map((x) => x.text), o, l, v.position) : M.sentence,
+            D.some((x) => x.own.approximate) && l.calculationApproximateNote,
+            Z !== void 0 && l.calculationWorstInside(se(Z, l))
           ].filter(Boolean).join(". ") }),
-          /* @__PURE__ */ R("span", { className: m.labelCell, children: [
-            B ? /* @__PURE__ */ g(
+          /* @__PURE__ */ E("span", { className: h.labelCell, children: [
+            j ? /* @__PURE__ */ $(
               "button",
               {
                 type: "button",
-                className: m.disclosure,
-                "aria-expanded": W,
-                "aria-controls": U,
-                "aria-label": (W ? l.calculationHideDerivation : l.calculationShowDerivation)(f.label),
-                children: /* @__PURE__ */ g(Be, { "data-open": W ? "" : void 0 })
+                className: h.disclosure,
+                "aria-expanded": F,
+                "aria-controls": W,
+                "aria-label": (F ? l.calculationHideDerivation : l.calculationShowDerivation)(p.label),
+                children: /* @__PURE__ */ $(Be, { "data-open": F ? "" : void 0 })
               }
-            ) : /* @__PURE__ */ g("span", { className: m.disclosure, "aria-hidden": "true" }),
-            /* @__PURE__ */ g("span", { className: m.label, "aria-hidden": "true", children: f.label })
+            ) : /* @__PURE__ */ $("span", { className: h.disclosure, "aria-hidden": "true" }),
+            /* @__PURE__ */ $("span", { className: h.label, "aria-hidden": "true", children: p.label })
           ] }),
-          /* @__PURE__ */ g("span", { className: m.names, "aria-hidden": "true", children: j && !z && !W ? E.names : void 0 }),
-          /* @__PURE__ */ g("span", { className: m.operator, "aria-hidden": "true", children: qe }),
-          b(I, he !== void 0),
-          /* @__PURE__ */ R("span", { className: m.assessment, "aria-hidden": "true", children: [
-            s ? (
+          /* @__PURE__ */ $("span", { className: h.names, "aria-hidden": "true", children: P && !V && !F ? M.names : void 0 }),
+          /* @__PURE__ */ $("span", { className: h.operator, "aria-hidden": "true", children: qe }),
+          b(D, he !== void 0),
+          /* @__PURE__ */ E("span", { className: h.assessment, "aria-hidden": "true", children: [
+            o ? (
               /* Short: which metric. The sentence carries the full reason. */
-              s.map(
-                (q, J) => I[J].own.absence && /* @__PURE__ */ g(le, { children: l.calculationMissing(q.unit ?? q.label) }, q.id)
+              o.map(
+                (x, J) => D[J].own.absence && /* @__PURE__ */ $(le, { children: l.calculationMissing(x.unit ?? x.label) }, x.id)
               )
-            ) : E.reason !== void 0 ? /* @__PURE__ */ g(le, { children: E.reason }) : P.verdict !== void 0 && /* @__PURE__ */ g(le, { tone: jt[P.verdict], children: oe(P.verdict, l) }),
-            E.target !== void 0 && /* @__PURE__ */ g("span", { className: m.target, children: E.target }),
-            Z !== void 0 && /* @__PURE__ */ g("span", { className: m.worst, "data-verdict": Z, children: l.calculationWorstInside(oe(Z, l)) })
+            ) : M.reason !== void 0 ? /* @__PURE__ */ $(le, { children: M.reason }) : I.verdict !== void 0 && /* @__PURE__ */ $(le, { tone: jt[I.verdict], children: se(I.verdict, l) }),
+            M.target !== void 0 && /* @__PURE__ */ $("span", { className: h.target, children: M.target }),
+            Z !== void 0 && /* @__PURE__ */ $("span", { className: h.worst, "data-verdict": Z, children: l.calculationWorstInside(se(Z, l)) })
           ] }),
           me.length > 0 && /* A click here - on a link in the aside, on a sparkline - is the
           caller's, not a fold. */
-          /* @__PURE__ */ g("span", { className: m.notes, onClick: (q) => q.stopPropagation(), children: me })
+          /* @__PURE__ */ $("span", { className: h.notes, onClick: (x) => x.stopPropagation(), children: me })
         ]
       }
     );
-    return z ? [
+    return V ? [
       ...te,
-      /* @__PURE__ */ R("li", { className: m.item, children: [
-        /* @__PURE__ */ g("ul", { className: m.list, children: pe }),
+      /* @__PURE__ */ E("li", { className: h.item, children: [
+        /* @__PURE__ */ $("ul", { className: h.list, children: pe }),
         ve
-      ] }, T)
+      ] }, q)
     ] : [
       ...te,
-      /* @__PURE__ */ R("li", { className: m.item, "data-open": W ? "" : void 0, style: { "--depth": h.depth }, children: [
+      /* @__PURE__ */ E("li", { className: h.item, "data-open": F ? "" : void 0, style: { "--depth": v.depth }, children: [
         ve,
-        B && /* @__PURE__ */ R("ul", { id: U, className: m.derivation, hidden: !W, children: [
+        j && /* @__PURE__ */ E("ul", { id: W, className: h.derivation, hidden: !F, children: [
           Ce,
           pe,
-          /* @__PURE__ */ g("li", { className: m.item, "aria-hidden": "true", children: /* @__PURE__ */ R(
+          /* @__PURE__ */ $("li", { className: h.item, "aria-hidden": "true", children: /* @__PURE__ */ E(
             "div",
             {
-              className: m.line,
-              style: { "--depth": G.depth },
+              className: h.line,
+              style: { "--depth": z.depth },
               "data-inner": "",
               "data-closing": "",
-              "data-mark": r === o ? "use" : void 0,
+              "data-mark": a === s ? "use" : void 0,
               children: [
-                /* @__PURE__ */ R("span", { className: m.labelCell, children: [
-                  /* @__PURE__ */ g("span", { className: m.disclosure }),
-                  /* @__PURE__ */ R("span", { className: m.label, children: [
+                /* @__PURE__ */ E("span", { className: h.labelCell, children: [
+                  /* @__PURE__ */ $("span", { className: h.disclosure }),
+                  /* @__PURE__ */ E("span", { className: h.label, children: [
                     "= ",
-                    f.label
+                    p.label
                   ] })
                 ] }),
-                /* @__PURE__ */ g("span", { className: m.names }),
-                /* @__PURE__ */ g("span", { className: m.operator }),
-                b(I, !0)
+                /* @__PURE__ */ $("span", { className: h.names }),
+                /* @__PURE__ */ $("span", { className: h.operator }),
+                b(D, !0)
               ]
             }
           ) })
         ] })
-      ] }, T)
+      ] }, q)
     ];
-  }, N = _(A.result, !1, { depth: 0, flat: !0, parent: null }, "r");
+  }, S = _(T.result, !1, { depth: 0, flat: !0, parent: null }, "r");
   return (
     /* The frame is the surface and the container the layout measures itself
        against; the list inside it is the statement. */
-    /* @__PURE__ */ g(
+    /* @__PURE__ */ $(
       "div",
       {
-        ref: $,
-        className: Bt(m.frame, e),
-        style: s ? {
-          "--figure-tracks": Array(v * 2).fill("auto").join(" "),
-          "--figures-end": X(v),
-          "--assessment-column": X(v),
-          ...p
-        } : p,
-        "data-still": D ? void 0 : "",
-        "data-metrics": s ? v : void 0,
-        "data-two-lines": a ? "" : void 0,
+        ref: f,
+        className: Bt(h.frame, t),
+        style: o ? {
+          "--figure-tracks": Array(w * 2).fill("auto").join(" "),
+          "--figures-end": X(w),
+          "--assessment-column": X(w),
+          ...m
+        } : m,
+        "data-still": R ? void 0 : "",
+        "data-metrics": o ? w : void 0,
+        "data-two-lines": i ? "" : void 0,
         "data-compact": c ? "" : void 0,
-        children: /* @__PURE__ */ R("ul", { className: m.calculation, ...n, children: [
-          s && /* The head names each metric and its unit above its column. Every
+        children: /* @__PURE__ */ E("ul", { className: h.calculation, ...n, children: [
+          o && /* The head names each metric and its unit above its column. Every
           row's sentence names them too, so the head is for the eye. */
-          /* @__PURE__ */ g("li", { className: m.item, "aria-hidden": "true", children: /* @__PURE__ */ g("div", { className: m.head, children: s.map((o, d) => /* @__PURE__ */ R(
+          /* @__PURE__ */ $("li", { className: h.item, "aria-hidden": "true", children: /* @__PURE__ */ $("div", { className: h.head, children: o.map((s, d) => /* @__PURE__ */ E(
             "span",
             {
-              className: m.headCell,
-              "data-unit": o.unit === void 0 ? void 0 : "",
+              className: h.headCell,
+              "data-unit": s.unit === void 0 ? void 0 : "",
               style: { "--column": X(d) },
               children: [
-                /* @__PURE__ */ g("span", { className: m.headLabel, children: o.label }),
-                o.unit !== void 0 && /* @__PURE__ */ g("span", { className: m.headUnit, children: o.unit })
+                /* @__PURE__ */ $("span", { className: h.headLabel, children: s.label }),
+                s.unit !== void 0 && /* @__PURE__ */ $("span", { className: h.headUnit, children: s.unit })
               ]
             },
-            o.id
+            s.id
           )) }) }),
-          N
+          S
         ] })
       }
     )

package/docs/llms-full.md

@@ -1,4 +1,4 @@
-# @umriss-ui/calculation 0.34.0
+# @umriss-ui/calculation 0.36.0
 
 > React calculation view for data-dense applications - a derivation written as it is shown, evaluated by the library, folded and read line by line.
 
@@ -1005,7 +1005,7 @@ npm install @umriss-ui/calculation @umriss-ui/core
 
 Demo page: https://romanhaendler.github.io/umriss-ui/calculation/installation/
 
-The command brings the core package along, a peer dependency: it gives the calculation its formats, its wording and the assessment of targets and limits. React 18 or 19 is a peer as well and stays the application's own.
+The command brings the core package along, a peer dependency: it gives the calculation its formats, its wording and the assessment of targets and limits. React 19 or newer is a peer as well and stays the application's own.
 
 The stylesheet loads itself: the package imports it and marks CSS as a side effect, so a bundler keeps it. `@umriss-ui/calculation/styles.css` stays exported for setups that link stylesheets by hand.
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@umriss-ui/calculation",
-  "version": "0.34.0",
+  "version": "0.36.0",
   "description": "React calculation view for data-dense applications - a derivation written as it is shown, evaluated by the library, folded and read line by line.",
   "license": "MIT",
   "author": "Roman Händler",
@@ -45,9 +45,9 @@
     "./styles.css": "./dist/calculation.css"
   },
   "peerDependencies": {
-    "react": ">=18",
-    "react-dom": ">=18",
-    "@umriss-ui/core": "^0.34.0"
+    "react": ">=19",
+    "react-dom": ">=19",
+    "@umriss-ui/core": "^0.36.0"
   },
   "devDependencies": {
     "@fontsource/geist-mono": "^5.3.0",
@@ -61,7 +61,7 @@
     "typescript": "^5.6.3",
     "vite": "^6.0.0",
     "vite-plugin-dts": "^4.3.0",
-    "@umriss-ui/core": "0.34.0",
+    "@umriss-ui/core": "0.36.0",
     "@umriss-ui/demo": "0.0.0"
   },
   "scripts": {