@umriss-ui/calculation 0.6.0 → 0.7.0

package/dist/calculation.js

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