@belonguniverseai/react-sdk 0.6.2 → 0.6.3

package/dist/component/vennDiagram-T6HMQDX7-DYZl8srI.js

@@ -0,0 +1,1581 @@
+import { b7 as Wt, s as Kt, g as Ht, p as Yt, o as Xt, a as Zt, b as Jt, _ as w, z as wt, G as Qt, d as ot, ao as $t, ad as te, ae as ee, af as ne, e as se, q as ie, D as oe, E as re } from "./mermaid-GHXKKRXX-BaBCeViM.js";
+globalThis.process = globalThis.process || { env: {} };
+globalThis.global = globalThis.global || globalThis;
+const kt = (t, n) => Wt(t, "a", -n), _t = 1e-10;
+function st(t, n) {
+  const s = le(t), e = s.filter((l) => ae(l, t));
+  let i = 0, o = 0;
+  const r = [];
+  if (e.length > 1) {
+    const l = Et(e);
+    for (let u = 0; u < e.length; ++u) {
+      const a = e[u];
+      a.angle = Math.atan2(a.x - l.x, a.y - l.y);
+    }
+    e.sort((u, a) => a.angle - u.angle);
+    let f = e[e.length - 1];
+    for (let u = 0; u < e.length; ++u) {
+      const a = e[u];
+      o += (f.x + a.x) * (a.y - f.y);
+      const y = { x: (a.x + f.x) / 2, y: (a.y + f.y) / 2 };
+      let h = null;
+      for (let b = 0; b < a.parentIndex.length; ++b)
+        if (f.parentIndex.includes(a.parentIndex[b])) {
+          const p = t[a.parentIndex[b]], M = Math.atan2(a.x - p.x, a.y - p.y), E = Math.atan2(f.x - p.x, f.y - p.y);
+          let _ = E - M;
+          _ < 0 && (_ += 2 * Math.PI);
+          const S = E - _ / 2;
+          let g = q(y, {
+            x: p.x + p.radius * Math.sin(S),
+            y: p.y + p.radius * Math.cos(S)
+          });
+          g > p.radius * 2 && (g = p.radius * 2), (h == null || h.width > g) && (h = { circle: p, width: g, p1: a, p2: f, large: g > p.radius, sweep: !0 });
+        }
+      h != null && (r.push(h), i += lt(h.circle.radius, h.width), f = a);
+    }
+  } else {
+    let l = t[0];
+    for (let u = 1; u < t.length; ++u)
+      t[u].radius < l.radius && (l = t[u]);
+    let f = !1;
+    for (let u = 0; u < t.length; ++u)
+      if (q(t[u], l) > Math.abs(l.radius - t[u].radius)) {
+        f = !0;
+        break;
+      }
+    f ? i = o = 0 : (i = l.radius * l.radius * Math.PI, r.push({
+      circle: l,
+      p1: { x: l.x, y: l.y + l.radius },
+      p2: { x: l.x - _t, y: l.y + l.radius },
+      width: l.radius * 2,
+      large: !0,
+      sweep: !0
+    }));
+  }
+  return o /= 2, n && (n.area = i + o, n.arcArea = i, n.polygonArea = o, n.arcs = r, n.innerPoints = e, n.intersectionPoints = s), i + o;
+}
+function ae(t, n) {
+  return n.every((s) => q(t, s) < s.radius + _t);
+}
+function le(t) {
+  const n = [];
+  for (let s = 0; s < t.length; ++s)
+    for (let e = s + 1; e < t.length; ++e) {
+      const i = Tt(t[s], t[e]);
+      for (const o of i)
+        o.parentIndex = [s, e], n.push(o);
+    }
+  return n;
+}
+function lt(t, n) {
+  return t * t * Math.acos(1 - n / t) - (t - n) * Math.sqrt(n * (2 * t - n));
+}
+function q(t, n) {
+  return Math.sqrt((t.x - n.x) * (t.x - n.x) + (t.y - n.y) * (t.y - n.y));
+}
+function xt(t, n, s) {
+  if (s >= t + n)
+    return 0;
+  if (s <= Math.abs(t - n))
+    return Math.PI * Math.min(t, n) * Math.min(t, n);
+  const e = t - (s * s - n * n + t * t) / (2 * s), i = n - (s * s - t * t + n * n) / (2 * s);
+  return lt(t, e) + lt(n, i);
+}
+function Tt(t, n) {
+  const s = q(t, n), e = t.radius, i = n.radius;
+  if (s >= e + i || s <= Math.abs(e - i))
+    return [];
+  const o = (e * e - i * i + s * s) / (2 * s), r = Math.sqrt(e * e - o * o), l = t.x + o * (n.x - t.x) / s, f = t.y + o * (n.y - t.y) / s, u = -(n.y - t.y) * (r / s), a = -(n.x - t.x) * (r / s);
+  return [
+    { x: l + u, y: f - a },
+    { x: l - u, y: f + a }
+  ];
+}
+function Et(t) {
+  const n = { x: 0, y: 0 };
+  for (const s of t)
+    n.x += s.x, n.y += s.y;
+  return n.x /= t.length, n.y /= t.length, n;
+}
+function ce(t, n, s, e) {
+  e = e || {};
+  const i = e.maxIterations || 100, o = e.tolerance || 1e-10, r = t(n), l = t(s);
+  let f = s - n;
+  if (r * l > 0)
+    throw "Initial bisect points must have opposite signs";
+  if (r === 0) return n;
+  if (l === 0) return s;
+  for (let u = 0; u < i; ++u) {
+    f /= 2;
+    const a = n + f, y = t(a);
+    if (y * r >= 0 && (n = a), Math.abs(f) < o || y === 0)
+      return a;
+  }
+  return n + f;
+}
+function ct(t) {
+  const n = new Array(t);
+  for (let s = 0; s < t; ++s)
+    n[s] = 0;
+  return n;
+}
+function Mt(t, n) {
+  return ct(t).map(() => ct(n));
+}
+function $(t, n) {
+  let s = 0;
+  for (let e = 0; e < t.length; ++e)
+    s += t[e] * n[e];
+  return s;
+}
+function ut(t) {
+  return Math.sqrt($(t, t));
+}
+function ft(t, n, s) {
+  for (let e = 0; e < n.length; ++e)
+    t[e] = n[e] * s;
+}
+function J(t, n, s, e, i) {
+  for (let o = 0; o < t.length; ++o)
+    t[o] = n * s[o] + e * i[o];
+}
+function zt(t, n, s) {
+  s = s || {};
+  const e = s.maxIterations || n.length * 200, i = s.nonZeroDelta || 1.05, o = s.zeroDelta || 1e-3, r = s.minErrorDelta || 1e-6, l = s.minErrorDelta || 1e-5, f = s.rho !== void 0 ? s.rho : 1, u = s.chi !== void 0 ? s.chi : 2, a = s.psi !== void 0 ? s.psi : -0.5, y = s.sigma !== void 0 ? s.sigma : 0.5;
+  let h;
+  const b = n.length, p = new Array(b + 1);
+  p[0] = n, p[0].fx = t(n), p[0].id = 0;
+  for (let v = 0; v < b; ++v) {
+    const c = n.slice();
+    c[v] = c[v] ? c[v] * i : o, p[v + 1] = c, p[v + 1].fx = t(c), p[v + 1].id = v + 1;
+  }
+  function M(v) {
+    for (let c = 0; c < v.length; c++)
+      p[b][c] = v[c];
+    p[b].fx = v.fx;
+  }
+  const E = (v, c) => v.fx - c.fx, _ = n.slice(), S = n.slice(), g = n.slice(), m = n.slice();
+  for (let v = 0; v < e; ++v) {
+    if (p.sort(E), s.history) {
+      const x = p.map((d) => {
+        const D = d.slice();
+        return D.fx = d.fx, D.id = d.id, D;
+      });
+      x.sort((d, D) => d.id - D.id), s.history.push({
+        x: p[0].slice(),
+        fx: p[0].fx,
+        simplex: x
+      });
+    }
+    h = 0;
+    for (let x = 0; x < b; ++x)
+      h = Math.max(h, Math.abs(p[0][x] - p[1][x]));
+    if (Math.abs(p[0].fx - p[b].fx) < r && h < l)
+      break;
+    for (let x = 0; x < b; ++x) {
+      _[x] = 0;
+      for (let d = 0; d < b; ++d)
+        _[x] += p[d][x];
+      _[x] /= b;
+    }
+    const c = p[b];
+    if (J(S, 1 + f, _, -f, c), S.fx = t(S), S.fx < p[0].fx)
+      J(m, 1 + u, _, -u, c), m.fx = t(m), m.fx < S.fx ? M(m) : M(S);
+    else if (S.fx >= p[b - 1].fx) {
+      let x = !1;
+      if (S.fx > c.fx ? (J(g, 1 + a, _, -a, c), g.fx = t(g), g.fx < c.fx ? M(g) : x = !0) : (J(g, 1 - a * f, _, a * f, c), g.fx = t(g), g.fx < S.fx ? M(g) : x = !0), x) {
+        if (y >= 1) break;
+        for (let d = 1; d < p.length; ++d)
+          J(p[d], 1 - y, p[0], y, p[d]), p[d].fx = t(p[d]);
+      }
+    } else
+      M(S);
+  }
+  return p.sort(E), { fx: p[0].fx, x: p[0] };
+}
+function ue(t, n, s, e, i, o, r) {
+  const l = s.fx, f = $(s.fxprime, n);
+  let u = l, a = l, y = f, h = 0;
+  i = i || 1, o = o || 1e-6, r = r || 0.1;
+  function b(p, M, E) {
+    for (let _ = 0; _ < 16; ++_)
+      if (i = (p + M) / 2, J(e.x, 1, s.x, i, n), u = e.fx = t(e.x, e.fxprime), y = $(e.fxprime, n), u > l + o * i * f || u >= E)
+        M = i;
+      else {
+        if (Math.abs(y) <= -r * f)
+          return i;
+        y * (M - p) >= 0 && (M = p), p = i, E = u;
+      }
+    return 0;
+  }
+  for (let p = 0; p < 10; ++p) {
+    if (J(e.x, 1, s.x, i, n), u = e.fx = t(e.x, e.fxprime), y = $(e.fxprime, n), u > l + o * i * f || p && u >= a)
+      return b(h, i, a);
+    if (Math.abs(y) <= -r * f)
+      return i;
+    if (y >= 0)
+      return b(i, h, u);
+    a = u, h = i, i *= 2;
+  }
+  return i;
+}
+function fe(t, n, s) {
+  let e = { x: n.slice(), fx: 0, fxprime: n.slice() }, i = { x: n.slice(), fx: 0, fxprime: n.slice() };
+  const o = n.slice();
+  let r, l, f = 1, u;
+  s = s || {}, u = s.maxIterations || n.length * 20, e.fx = t(e.x, e.fxprime), r = e.fxprime.slice(), ft(r, e.fxprime, -1);
+  for (let a = 0; a < u; ++a) {
+    if (f = ue(t, r, e, i, f), s.history && s.history.push({
+      x: e.x.slice(),
+      fx: e.fx,
+      fxprime: e.fxprime.slice(),
+      alpha: f
+    }), !f)
+      ft(r, e.fxprime, -1);
+    else {
+      J(o, 1, i.fxprime, -1, e.fxprime);
+      const y = $(e.fxprime, e.fxprime), h = Math.max(0, $(o, i.fxprime) / y);
+      J(r, h, r, -1, i.fxprime), l = e, e = i, i = l;
+    }
+    if (ut(e.fxprime) <= 1e-5)
+      break;
+  }
+  return s.history && s.history.push({
+    x: e.x.slice(),
+    fx: e.fx,
+    fxprime: e.fxprime.slice(),
+    alpha: f
+  }), e;
+}
+function At(t, n = {}) {
+  n.maxIterations = n.maxIterations || 500;
+  const s = n.initialLayout || xe, e = n.lossFunction || tt, i = he(t, n), o = s(i, n), r = Object.keys(o), l = [];
+  for (const a of r)
+    l.push(o[a].x), l.push(o[a].y);
+  const u = zt(
+    (a) => {
+      const y = {};
+      for (let h = 0; h < r.length; ++h) {
+        const b = r[h];
+        y[b] = {
+          x: a[2 * h],
+          y: a[2 * h + 1],
+          radius: o[b].radius
+          // size : circles[setid].size
+        };
+      }
+      return e(y, i);
+    },
+    l,
+    n
+  ).x;
+  for (let a = 0; a < r.length; ++a) {
+    const y = r[a];
+    o[y].x = u[2 * a], o[y].y = u[2 * a + 1];
+  }
+  return o;
+}
+const Rt = 1e-10;
+function ht(t, n, s) {
+  return Math.min(t, n) * Math.min(t, n) * Math.PI <= s + Rt ? Math.abs(t - n) : ce((e) => xt(t, n, e) - s, 0, t + n);
+}
+function he(t, n = {}) {
+  const s = n.distinct, e = t.map((l) => Object.assign({}, l));
+  function i(l) {
+    return l.join(";");
+  }
+  if (s) {
+    const l = /* @__PURE__ */ new Map();
+    for (const f of e)
+      for (let u = 0; u < f.sets.length; u++) {
+        const a = String(f.sets[u]);
+        l.set(a, f.size + (l.get(a) || 0));
+        for (let y = u + 1; y < f.sets.length; y++) {
+          const h = String(f.sets[y]), b = `${a};${h}`, p = `${h};${a}`;
+          l.set(b, f.size + (l.get(b) || 0)), l.set(p, f.size + (l.get(p) || 0));
+        }
+      }
+    for (const f of e)
+      f.sets.length < 3 && (f.size = l.get(i(f.sets)));
+  }
+  const o = [], r = /* @__PURE__ */ new Set();
+  for (const l of e)
+    if (l.sets.length === 1)
+      o.push(l.sets[0]);
+    else if (l.sets.length === 2) {
+      const f = l.sets[0], u = l.sets[1];
+      r.add(i(l.sets)), r.add(i([u, f]));
+    }
+  o.sort((l, f) => l === f ? 0 : l < f ? -1 : 1);
+  for (let l = 0; l < o.length; ++l) {
+    const f = o[l];
+    for (let u = l + 1; u < o.length; ++u) {
+      const a = o[u];
+      r.has(i([f, a])) || e.push({ sets: [f, a], size: 0 });
+    }
+  }
+  return e;
+}
+function de(t, n, s) {
+  const e = Mt(n.length, n.length), i = Mt(n.length, n.length);
+  return t.filter((o) => o.sets.length === 2).forEach((o) => {
+    const r = s[o.sets[0]], l = s[o.sets[1]], f = Math.sqrt(n[r].size / Math.PI), u = Math.sqrt(n[l].size / Math.PI), a = ht(f, u, o.size);
+    e[r][l] = e[l][r] = a;
+    let y = 0;
+    o.size + 1e-10 >= Math.min(n[r].size, n[l].size) ? y = 1 : o.size <= 1e-10 && (y = -1), i[r][l] = i[l][r] = y;
+  }), { distances: e, constraints: i };
+}
+function ge(t, n, s, e) {
+  for (let o = 0; o < n.length; ++o)
+    n[o] = 0;
+  let i = 0;
+  for (let o = 0; o < s.length; ++o) {
+    const r = t[2 * o], l = t[2 * o + 1];
+    for (let f = o + 1; f < s.length; ++f) {
+      const u = t[2 * f], a = t[2 * f + 1], y = s[o][f], h = e[o][f], b = (u - r) * (u - r) + (a - l) * (a - l), p = Math.sqrt(b), M = b - y * y;
+      h > 0 && p <= y || h < 0 && p >= y || (i += 2 * M * M, n[2 * o] += 4 * M * (r - u), n[2 * o + 1] += 4 * M * (l - a), n[2 * f] += 4 * M * (u - r), n[2 * f + 1] += 4 * M * (a - l));
+    }
+  }
+  return i;
+}
+function xe(t, n = {}) {
+  let s = pe(t, n);
+  const e = n.lossFunction || tt;
+  if (t.length >= 8) {
+    const i = ye(t, n), o = e(i, t), r = e(s, t);
+    o + 1e-8 < r && (s = i);
+  }
+  return s;
+}
+function ye(t, n = {}) {
+  const s = n.restarts || 10, e = [], i = {};
+  for (const h of t)
+    h.sets.length === 1 && (i[h.sets[0]] = e.length, e.push(h));
+  let { distances: o, constraints: r } = de(t, e, i);
+  const l = ut(o.map(ut)) / o.length;
+  o = o.map((h) => h.map((b) => b / l));
+  const f = (h, b) => ge(h, b, o, r);
+  let u = null;
+  for (let h = 0; h < s; ++h) {
+    const b = ct(o.length * 2).map(Math.random), p = fe(f, b, n);
+    (!u || p.fx < u.fx) && (u = p);
+  }
+  const a = u.x, y = {};
+  for (let h = 0; h < e.length; ++h) {
+    const b = e[h];
+    y[b.sets[0]] = {
+      x: a[2 * h] * l,
+      y: a[2 * h + 1] * l,
+      radius: Math.sqrt(b.size / Math.PI)
+    };
+  }
+  if (n.history)
+    for (const h of n.history)
+      ft(h.x, l);
+  return y;
+}
+function pe(t, n) {
+  const s = n && n.lossFunction ? n.lossFunction : tt, e = {}, i = {};
+  for (const y of t)
+    if (y.sets.length === 1) {
+      const h = y.sets[0];
+      e[h] = {
+        x: 1e10,
+        y: 1e10,
+        rowid: e.length,
+        size: y.size,
+        radius: Math.sqrt(y.size / Math.PI)
+      }, i[h] = [];
+    }
+  t = t.filter((y) => y.sets.length === 2);
+  for (const y of t) {
+    let h = y.weight != null ? y.weight : 1;
+    const b = y.sets[0], p = y.sets[1];
+    y.size + Rt >= Math.min(e[b].size, e[p].size) && (h = 0), i[b].push({ set: p, size: y.size, weight: h }), i[p].push({ set: b, size: y.size, weight: h });
+  }
+  const o = [];
+  Object.keys(i).forEach((y) => {
+    let h = 0;
+    for (let b = 0; b < i[y].length; ++b)
+      h += i[y][b].size * i[y][b].weight;
+    o.push({ set: y, size: h });
+  });
+  function r(y, h) {
+    return h.size - y.size;
+  }
+  o.sort(r);
+  const l = {};
+  function f(y) {
+    return y.set in l;
+  }
+  function u(y, h) {
+    e[h].x = y.x, e[h].y = y.y, l[h] = !0;
+  }
+  u({ x: 0, y: 0 }, o[0].set);
+  for (let y = 1; y < o.length; ++y) {
+    const h = o[y].set, b = i[h].filter(f), p = e[h];
+    if (b.sort(r), b.length === 0)
+      throw "ERROR: missing pairwise overlap information";
+    const M = [];
+    for (var a = 0; a < b.length; ++a) {
+      const S = e[b[a].set], g = ht(p.radius, S.radius, b[a].size);
+      M.push({ x: S.x + g, y: S.y }), M.push({ x: S.x - g, y: S.y }), M.push({ y: S.y + g, x: S.x }), M.push({ y: S.y - g, x: S.x });
+      for (let m = a + 1; m < b.length; ++m) {
+        const v = e[b[m].set], c = ht(p.radius, v.radius, b[m].size), x = Tt(
+          { x: S.x, y: S.y, radius: g },
+          { x: v.x, y: v.y, radius: c }
+        );
+        M.push(...x);
+      }
+    }
+    let E = 1e50, _ = M[0];
+    for (const S of M) {
+      e[h].x = S.x, e[h].y = S.y;
+      const g = s(e, t);
+      g < E && (E = g, _ = S);
+    }
+    u(_, h);
+  }
+  return e;
+}
+function tt(t, n) {
+  let s = 0;
+  for (const e of n) {
+    if (e.sets.length === 1)
+      continue;
+    let i;
+    if (e.sets.length === 2) {
+      const r = t[e.sets[0]], l = t[e.sets[1]];
+      i = xt(r.radius, l.radius, q(r, l));
+    } else
+      i = st(e.sets.map((r) => t[r]));
+    const o = e.weight != null ? e.weight : 1;
+    s += o * (i - e.size) * (i - e.size);
+  }
+  return s;
+}
+function Dt(t, n) {
+  let s = 0;
+  for (const e of n) {
+    if (e.sets.length === 1)
+      continue;
+    let i;
+    if (e.sets.length === 2) {
+      const l = t[e.sets[0]], f = t[e.sets[1]];
+      i = xt(l.radius, f.radius, q(l, f));
+    } else
+      i = st(e.sets.map((l) => t[l]));
+    const o = e.weight != null ? e.weight : 1, r = Math.log((i + 1) / (e.size + 1));
+    s += o * r * r;
+  }
+  return s;
+}
+function me(t, n, s) {
+  if (s == null ? t.sort((i, o) => o.radius - i.radius) : t.sort(s), t.length > 0) {
+    const i = t[0].x, o = t[0].y;
+    for (const r of t)
+      r.x -= i, r.y -= o;
+  }
+  if (t.length === 2 && q(t[0], t[1]) < Math.abs(t[1].radius - t[0].radius) && (t[1].x = t[0].x + t[0].radius - t[1].radius - 1e-10, t[1].y = t[0].y), t.length > 1) {
+    const i = Math.atan2(t[1].x, t[1].y) - n, o = Math.cos(i), r = Math.sin(i);
+    for (const l of t) {
+      const f = l.x, u = l.y;
+      l.x = o * f - r * u, l.y = r * f + o * u;
+    }
+  }
+  if (t.length > 2) {
+    let i = Math.atan2(t[2].x, t[2].y) - n;
+    for (; i < 0; )
+      i += 2 * Math.PI;
+    for (; i > 2 * Math.PI; )
+      i -= 2 * Math.PI;
+    if (i > Math.PI) {
+      const o = t[1].y / (1e-10 + t[1].x);
+      for (const r of t) {
+        var e = (r.x + o * r.y) / (1 + o * o);
+        r.x = 2 * e - r.x, r.y = 2 * e * o - r.y;
+      }
+    }
+  }
+}
+function be(t) {
+  t.forEach((i) => {
+    i.parent = i;
+  });
+  function n(i) {
+    return i.parent !== i && (i.parent = n(i.parent)), i.parent;
+  }
+  function s(i, o) {
+    const r = n(i), l = n(o);
+    r.parent = l;
+  }
+  for (let i = 0; i < t.length; ++i)
+    for (let o = i + 1; o < t.length; ++o) {
+      const r = t[i].radius + t[o].radius;
+      q(t[i], t[o]) + 1e-10 < r && s(t[o], t[i]);
+    }
+  const e = /* @__PURE__ */ new Map();
+  for (let i = 0; i < t.length; ++i) {
+    const o = n(t[i]).parent.setid;
+    e.has(o) || e.set(o, []), e.get(o).push(t[i]);
+  }
+  return t.forEach((i) => {
+    delete i.parent;
+  }), Array.from(e.values());
+}
+function dt(t) {
+  const n = (s) => {
+    const e = t.reduce((o, r) => Math.max(o, r[s] + r.radius), Number.NEGATIVE_INFINITY), i = t.reduce((o, r) => Math.min(o, r[s] - r.radius), Number.POSITIVE_INFINITY);
+    return { max: e, min: i };
+  };
+  return { xRange: n("x"), yRange: n("y") };
+}
+function Ct(t, n, s) {
+  n == null && (n = Math.PI / 2);
+  let e = Ft(t).map((u) => Object.assign({}, u));
+  const i = be(e);
+  for (const u of i) {
+    me(u, n, s);
+    const a = dt(u);
+    u.size = (a.xRange.max - a.xRange.min) * (a.yRange.max - a.yRange.min), u.bounds = a;
+  }
+  i.sort((u, a) => a.size - u.size), e = i[0];
+  let o = e.bounds;
+  const r = (o.xRange.max - o.xRange.min) / 50;
+  function l(u, a, y) {
+    if (!u)
+      return;
+    const h = u.bounds;
+    let b, p;
+    if (a)
+      b = o.xRange.max - h.xRange.min + r;
+    else {
+      b = o.xRange.max - h.xRange.max;
+      const M = (h.xRange.max - h.xRange.min) / 2 - (o.xRange.max - o.xRange.min) / 2;
+      M < 0 && (b += M);
+    }
+    if (y)
+      p = o.yRange.max - h.yRange.min + r;
+    else {
+      p = o.yRange.max - h.yRange.max;
+      const M = (h.yRange.max - h.yRange.min) / 2 - (o.yRange.max - o.yRange.min) / 2;
+      M < 0 && (p += M);
+    }
+    for (const M of u)
+      M.x += b, M.y += p, e.push(M);
+  }
+  let f = 1;
+  for (; f < i.length; )
+    l(i[f], !0, !1), l(i[f + 1], !1, !0), l(i[f + 2], !0, !0), f += 3, o = dt(e);
+  return Ot(e);
+}
+function Nt(t, n, s, e, i) {
+  const o = Ft(t);
+  n -= 2 * e, s -= 2 * e;
+  const { xRange: r, yRange: l } = dt(o);
+  if (r.max === r.min || l.max === l.min)
+    return console.log("not scaling solution: zero size detected"), t;
+  let f, u;
+  if (i) {
+    const b = Math.sqrt(i / Math.PI) * 2;
+    f = n / b, u = s / b;
+  } else
+    f = n / (r.max - r.min), u = s / (l.max - l.min);
+  const a = Math.min(u, f), y = (n - (r.max - r.min) * a) / 2, h = (s - (l.max - l.min) * a) / 2;
+  return Ot(
+    o.map((b) => ({
+      radius: a * b.radius,
+      x: e + y + (b.x - r.min) * a,
+      y: e + h + (b.y - l.min) * a,
+      setid: b.setid
+    }))
+  );
+}
+function Ot(t) {
+  const n = {};
+  for (const s of t)
+    n[s.setid] = s;
+  return n;
+}
+function Ft(t) {
+  return Object.keys(t).map((s) => Object.assign(t[s], { setid: s }));
+}
+function ve(t = {}) {
+  let n = !1, s = 600, e = 350, i = 15, o = 1e3, r = Math.PI / 2, l = !0, f = null, u = !0, a = !0, y = null, h = null, b = !1, p = null, M = t && t.symmetricalTextCentre ? t.symmetricalTextCentre : !1, E = {}, _ = t && t.colourScheme ? t.colourScheme : t && t.colorScheme ? t.colorScheme : [
+    "#1f77b4",
+    "#ff7f0e",
+    "#2ca02c",
+    "#d62728",
+    "#9467bd",
+    "#8c564b",
+    "#e377c2",
+    "#7f7f7f",
+    "#bcbd22",
+    "#17becf"
+  ], S = 0, g = function(x) {
+    if (x in E)
+      return E[x];
+    var d = E[x] = _[S];
+    return S += 1, S >= _.length && (S = 0), d;
+  }, m = At, v = tt;
+  function c(x) {
+    let d = x.datum();
+    const D = /* @__PURE__ */ new Set();
+    d.forEach((k) => {
+      k.size == 0 && k.sets.length == 1 && D.add(k.sets[0]);
+    }), d = d.filter((k) => !k.sets.some((F) => D.has(F)));
+    let I = {}, C = {};
+    if (d.length > 0) {
+      let k = m(d, { lossFunction: v, distinct: b });
+      l && (k = Ct(k, r, h)), I = Nt(k, s, e, i, f), C = Lt(I, d, M);
+    }
+    const U = {};
+    d.forEach((k) => {
+      k.label && (U[k.sets] = k.label);
+    });
+    function V(k) {
+      if (k.sets in U)
+        return U[k.sets];
+      if (k.sets.length == 1)
+        return "" + k.sets[0];
+    }
+    x.selectAll("svg").data([I]).enter().append("svg");
+    const O = x.select("svg");
+    n ? O.attr("viewBox", `0 0 ${s} ${e}`) : O.attr("width", s).attr("height", e);
+    const R = {};
+    let T = !1;
+    O.selectAll(".venn-area path").each(function(k) {
+      const F = this.getAttribute("d");
+      k.sets.length == 1 && F && !b && (T = !0, R[k.sets[0]] = Me(F));
+    });
+    function A(k) {
+      return (F) => {
+        const H = k.sets.map((et) => {
+          let Y = R[et], Z = I[et];
+          return Y || (Y = { x: s / 2, y: e / 2, radius: 1 }), Z || (Z = { x: s / 2, y: e / 2, radius: 1 }), {
+            x: Y.x * (1 - F) + Z.x * F,
+            y: Y.y * (1 - F) + Z.y * F,
+            radius: Y.radius * (1 - F) + Z.radius * F
+          };
+        });
+        return St(H, p);
+      };
+    }
+    const G = O.selectAll(".venn-area").data(d, (k) => k.sets), P = G.enter().append("g").attr(
+      "class",
+      (k) => `venn-area venn-${k.sets.length == 1 ? "circle" : "intersection"}${k.colour || k.color ? " venn-coloured" : ""}`
+    ).attr("data-venn-sets", (k) => k.sets.join("_")), B = P.append("path"), L = P.append("text").attr("class", "label").text((k) => V(k)).attr("text-anchor", "middle").attr("dy", ".35em").attr("x", s / 2).attr("y", e / 2);
+    a && (B.style("fill-opacity", "0").filter((k) => k.sets.length == 1).style("fill", (k) => k.colour ? k.colour : k.color ? k.color : g(k.sets)).style("fill-opacity", ".25"), L.style("fill", (k) => k.colour || k.color ? "#FFF" : t.textFill ? t.textFill : k.sets.length == 1 ? g(k.sets) : "#444"));
+    function K(k) {
+      return typeof k.transition == "function" ? k.transition("venn").duration(o) : k;
+    }
+    let z = x;
+    T && typeof z.transition == "function" ? (z = K(x), z.selectAll("path").attrTween("d", A)) : z.selectAll("path").attr("d", (k) => St(k.sets.map((F) => I[F])), p);
+    const N = z.selectAll("text").filter((k) => k.sets in C).text((k) => V(k)).attr("x", (k) => Math.floor(C[k.sets].x)).attr("y", (k) => Math.floor(C[k.sets].y));
+    u && (T ? "on" in N ? N.on("end", rt(I, V)) : N.each("end", rt(I, V)) : N.each(rt(I, V)));
+    const j = K(G.exit()).remove();
+    typeof G.transition == "function" && j.selectAll("path").attrTween("d", A);
+    const X = j.selectAll("text").attr("x", s / 2).attr("y", e / 2);
+    return y !== null && (L.style("font-size", "0px"), N.style("font-size", y), X.style("font-size", "0px")), { circles: I, textCentres: C, nodes: G, enter: P, update: z, exit: j };
+  }
+  return c.wrap = function(x) {
+    return arguments.length ? (u = x, c) : u;
+  }, c.useViewBox = function() {
+    return n = !0, c;
+  }, c.width = function(x) {
+    return arguments.length ? (s = x, c) : s;
+  }, c.height = function(x) {
+    return arguments.length ? (e = x, c) : e;
+  }, c.padding = function(x) {
+    return arguments.length ? (i = x, c) : i;
+  }, c.distinct = function(x) {
+    return arguments.length ? (b = x, c) : b;
+  }, c.colours = function(x) {
+    return arguments.length ? (g = x, c) : g;
+  }, c.colors = function(x) {
+    return arguments.length ? (g = x, c) : g;
+  }, c.fontSize = function(x) {
+    return arguments.length ? (y = x, c) : y;
+  }, c.round = function(x) {
+    return arguments.length ? (p = x, c) : p;
+  }, c.duration = function(x) {
+    return arguments.length ? (o = x, c) : o;
+  }, c.layoutFunction = function(x) {
+    return arguments.length ? (m = x, c) : m;
+  }, c.normalize = function(x) {
+    return arguments.length ? (l = x, c) : l;
+  }, c.scaleToFit = function(x) {
+    return arguments.length ? (f = x, c) : f;
+  }, c.styled = function(x) {
+    return arguments.length ? (a = x, c) : a;
+  }, c.orientation = function(x) {
+    return arguments.length ? (r = x, c) : r;
+  }, c.orientationOrder = function(x) {
+    return arguments.length ? (h = x, c) : h;
+  }, c.lossFunction = function(x) {
+    return arguments.length ? (v = x === "default" ? tt : x === "logRatio" ? Dt : x, c) : v;
+  }, c;
+}
+function rt(t, n) {
+  return function(s) {
+    const e = this, i = t[s.sets[0]].radius || 50, o = n(s) || "", r = o.split(/\s+/).reverse(), f = (o.length + r.length) / 3;
+    let u = r.pop(), a = [u], y = 0;
+    const h = 1.1;
+    e.textContent = null;
+    const b = [];
+    function p(g) {
+      const m = e.ownerDocument.createElementNS(e.namespaceURI, "tspan");
+      return m.textContent = g, b.push(m), e.append(m), m;
+    }
+    let M = p(u);
+    for (; u = r.pop(), !!u; ) {
+      a.push(u);
+      const g = a.join(" ");
+      M.textContent = g, g.length > f && M.getComputedTextLength() > i && (a.pop(), M.textContent = a.join(" "), a = [u], M = p(u), y++);
+    }
+    const E = 0.35 - y * h / 2, _ = e.getAttribute("x"), S = e.getAttribute("y");
+    b.forEach((g, m) => {
+      g.setAttribute("x", _), g.setAttribute("y", S), g.setAttribute("dy", `${E + m * h}em`);
+    });
+  };
+}
+function at(t, n, s) {
+  let e = n[0].radius - q(n[0], t);
+  for (let i = 1; i < n.length; ++i) {
+    const o = n[i].radius - q(n[i], t);
+    o <= e && (e = o);
+  }
+  for (let i = 0; i < s.length; ++i) {
+    const o = q(s[i], t) - s[i].radius;
+    o <= e && (e = o);
+  }
+  return e;
+}
+function jt(t, n, s) {
+  const e = [];
+  for (const a of t)
+    e.push({ x: a.x, y: a.y }), e.push({ x: a.x + a.radius / 2, y: a.y }), e.push({ x: a.x - a.radius / 2, y: a.y }), e.push({ x: a.x, y: a.y + a.radius / 2 }), e.push({ x: a.x, y: a.y - a.radius / 2 });
+  let i = e[0], o = at(e[0], t, n);
+  for (let a = 1; a < e.length; ++a) {
+    const y = at(e[a], t, n);
+    y >= o && (i = e[a], o = y);
+  }
+  const r = zt(
+    (a) => -1 * at({ x: a[0], y: a[1] }, t, n),
+    [i.x, i.y],
+    { maxIterations: 500, minErrorDelta: 1e-10 }
+  ).x, l = { x: s ? 0 : r[0], y: r[1] };
+  let f = !0;
+  for (const a of t)
+    if (q(l, a) > a.radius) {
+      f = !1;
+      break;
+    }
+  for (const a of n)
+    if (q(l, a) < a.radius) {
+      f = !1;
+      break;
+    }
+  if (f)
+    return l;
+  if (t.length == 1)
+    return { x: t[0].x, y: t[0].y };
+  const u = {};
+  return st(t, u), u.arcs.length === 0 ? { x: 0, y: -1e3, disjoint: !0 } : u.arcs.length == 1 ? { x: u.arcs[0].circle.x, y: u.arcs[0].circle.y } : n.length ? jt(t, []) : Et(u.arcs.map((a) => a.p1));
+}
+function Ie(t) {
+  const n = {}, s = Object.keys(t);
+  for (const e of s)
+    n[e] = [];
+  for (let e = 0; e < s.length; e++) {
+    const i = s[e], o = t[i];
+    for (let r = e + 1; r < s.length; ++r) {
+      const l = s[r], f = t[l], u = q(o, f);
+      u + f.radius <= o.radius + 1e-10 ? n[l].push(i) : u + o.radius <= f.radius + 1e-10 && n[i].push(l);
+    }
+  }
+  return n;
+}
+function Lt(t, n, s) {
+  const e = {}, i = Ie(t);
+  for (let o = 0; o < n.length; ++o) {
+    const r = n[o].sets, l = {}, f = {};
+    for (let h = 0; h < r.length; ++h) {
+      l[r[h]] = !0;
+      const b = i[r[h]];
+      for (let p = 0; p < b.length; ++p)
+        f[b[p]] = !0;
+    }
+    const u = [], a = [];
+    for (let h in t)
+      h in l ? u.push(t[h]) : h in f || a.push(t[h]);
+    const y = jt(u, a, s);
+    e[r] = y, y.disjoint && n[o].size > 0 && console.log("WARNING: area " + r + " not represented on screen");
+  }
+  return e;
+}
+function ke(t, n, s) {
+  const e = [];
+  return e.push(`
+M`, t, n), e.push(`
+m`, -s, 0), e.push(`
+a`, s, s, 0, 1, 0, s * 2, 0), e.push(`
+a`, s, s, 0, 1, 0, -s * 2, 0), e.join(" ");
+}
+function Me(t) {
+  const n = t.split(" ");
+  return { x: Number.parseFloat(n[1]), y: Number.parseFloat(n[2]), radius: -Number.parseFloat(n[4]) };
+}
+function Pt(t) {
+  if (t.length === 0)
+    return [];
+  const n = {};
+  return st(t, n), n.arcs;
+}
+function Bt(t, n) {
+  if (t.length === 0)
+    return "M 0 0";
+  const s = Math.pow(10, n || 0), e = n != null ? (o) => Math.round(o * s) / s : (o) => o;
+  if (t.length == 1) {
+    const o = t[0].circle;
+    return ke(e(o.x), e(o.y), e(o.radius));
+  }
+  const i = [`
+M`, e(t[0].p2.x), e(t[0].p2.y)];
+  for (const o of t) {
+    const r = e(o.circle.radius);
+    i.push(`
+A`, r, r, 0, o.large ? 1 : 0, o.sweep ? 1 : 0, e(o.p1.x), e(o.p1.y));
+  }
+  return i.join(" ");
+}
+function St(t, n) {
+  return Bt(Pt(t), n);
+}
+function Se(t, n = {}) {
+  const {
+    lossFunction: s,
+    layoutFunction: e = At,
+    normalize: i = !0,
+    orientation: o = Math.PI / 2,
+    orientationOrder: r,
+    width: l = 600,
+    height: f = 350,
+    padding: u = 15,
+    scaleToFit: a = !1,
+    symmetricalTextCentre: y = !1,
+    distinct: h,
+    round: b = 2
+  } = n;
+  let p = e(t, {
+    lossFunction: s === "default" || !s ? tt : s === "logRatio" ? Dt : s,
+    distinct: h
+  });
+  i && (p = Ct(p, o, r));
+  const M = Nt(p, l, f, u, a), E = Lt(M, t, y), _ = new Map(
+    Object.keys(M).map((m) => [
+      m,
+      {
+        set: m,
+        x: M[m].x,
+        y: M[m].y,
+        radius: M[m].radius
+      }
+    ])
+  ), S = t.map((m) => {
+    const v = m.sets.map((d) => _.get(d)), c = Pt(v), x = Bt(c, b);
+    return { circles: v, arcs: c, path: x, area: m, has: new Set(m.sets) };
+  });
+  function g(m) {
+    let v = "";
+    for (const c of S)
+      c.has.size > m.length && m.every((x) => c.has.has(x)) && (v += " " + c.path);
+    return v;
+  }
+  return S.map(({ circles: m, arcs: v, path: c, area: x }) => ({
+    data: x,
+    text: E[x.sets],
+    circles: m,
+    arcs: v,
+    path: c,
+    distinctPath: c + g(x.sets)
+  }));
+}
+var gt = (function() {
+  var t = /* @__PURE__ */ w(function(S, g, m, v) {
+    for (m = m || {}, v = S.length; v--; m[S[v]] = g) ;
+    return m;
+  }, "o"), n = [5, 8], s = [7, 8, 11, 12, 17, 19, 22, 24], e = [1, 17], i = [1, 18], o = [7, 8, 11, 12, 14, 15, 16, 17, 19, 20, 21, 22, 24, 27], r = [1, 31], l = [1, 39], f = [7, 8, 11, 12, 17, 19, 22, 24, 27], u = [1, 57], a = [1, 56], y = [1, 58], h = [1, 59], b = [1, 60], p = [7, 8, 11, 12, 16, 17, 19, 20, 22, 24, 27, 31, 32, 33], M = {
+    trace: /* @__PURE__ */ w(function() {
+    }, "trace"),
+    yy: {},
+    symbols_: { error: 2, start: 3, optNewlines: 4, VENN: 5, document: 6, EOF: 7, NEWLINE: 8, line: 9, statement: 10, TITLE: 11, SET: 12, identifier: 13, BRACKET_LABEL: 14, COLON: 15, NUMERIC: 16, UNION: 17, identifierList: 18, TEXT: 19, IDENTIFIER: 20, STRING: 21, INDENT_TEXT: 22, indentedTextTail: 23, STYLE: 24, stylesOpt: 25, styleField: 26, COMMA: 27, styleValue: 28, valueTokens: 29, valueToken: 30, HEXCOLOR: 31, RGBCOLOR: 32, RGBACOLOR: 33, $accept: 0, $end: 1 },
+    terminals_: { 2: "error", 5: "VENN", 7: "EOF", 8: "NEWLINE", 11: "TITLE", 12: "SET", 14: "BRACKET_LABEL", 15: "COLON", 16: "NUMERIC", 17: "UNION", 19: "TEXT", 20: "IDENTIFIER", 21: "STRING", 22: "INDENT_TEXT", 24: "STYLE", 27: "COMMA", 31: "HEXCOLOR", 32: "RGBCOLOR", 33: "RGBACOLOR" },
+    productions_: [0, [3, 4], [4, 0], [4, 2], [6, 0], [6, 2], [9, 1], [9, 1], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 2], [10, 3], [10, 4], [10, 5], [10, 3], [10, 3], [10, 3], [10, 4], [10, 4], [10, 2], [10, 3], [23, 1], [23, 1], [23, 1], [23, 2], [23, 2], [25, 1], [25, 3], [26, 3], [28, 1], [28, 1], [29, 1], [29, 2], [30, 1], [30, 1], [30, 1], [30, 1], [30, 1], [18, 1], [18, 3], [13, 1], [13, 1]],
+    performAction: /* @__PURE__ */ w(function(g, m, v, c, x, d, D) {
+      var I = d.length - 1;
+      switch (x) {
+        case 1:
+          return d[I - 1];
+        case 2:
+        case 3:
+        case 4:
+          this.$ = [];
+          break;
+        case 5:
+          d[I - 1].push(d[I]), this.$ = d[I - 1];
+          break;
+        case 6:
+          this.$ = [];
+          break;
+        case 7:
+        case 22:
+        case 32:
+        case 36:
+        case 37:
+        case 38:
+        case 39:
+        case 40:
+          this.$ = d[I];
+          break;
+        case 8:
+          c.setDiagramTitle(d[I].substr(6)), this.$ = d[I].substr(6);
+          break;
+        case 9:
+          c.addSubsetData([d[I]], void 0, void 0), c.setIndentMode && c.setIndentMode(!0);
+          break;
+        case 10:
+          c.addSubsetData([d[I - 1]], d[I], void 0), c.setIndentMode && c.setIndentMode(!0);
+          break;
+        case 11:
+          c.addSubsetData([d[I - 2]], void 0, parseFloat(d[I])), c.setIndentMode && c.setIndentMode(!0);
+          break;
+        case 12:
+          c.addSubsetData([d[I - 3]], d[I - 2], parseFloat(d[I])), c.setIndentMode && c.setIndentMode(!0);
+          break;
+        case 13:
+          if (d[I].length < 2)
+            throw new Error("union requires multiple identifiers");
+          c.validateUnionIdentifiers && c.validateUnionIdentifiers(d[I]), c.addSubsetData(d[I], void 0, void 0), c.setIndentMode && c.setIndentMode(!0);
+          break;
+        case 14:
+          if (d[I - 1].length < 2)
+            throw new Error("union requires multiple identifiers");
+          c.validateUnionIdentifiers && c.validateUnionIdentifiers(d[I - 1]), c.addSubsetData(d[I - 1], d[I], void 0), c.setIndentMode && c.setIndentMode(!0);
+          break;
+        case 15:
+          if (d[I - 2].length < 2)
+            throw new Error("union requires multiple identifiers");
+          c.validateUnionIdentifiers && c.validateUnionIdentifiers(d[I - 2]), c.addSubsetData(d[I - 2], void 0, parseFloat(d[I])), c.setIndentMode && c.setIndentMode(!0);
+          break;
+        case 16:
+          if (d[I - 3].length < 2)
+            throw new Error("union requires multiple identifiers");
+          c.validateUnionIdentifiers && c.validateUnionIdentifiers(d[I - 3]), c.addSubsetData(d[I - 3], d[I - 2], parseFloat(d[I])), c.setIndentMode && c.setIndentMode(!0);
+          break;
+        case 17:
+        case 18:
+        case 19:
+          c.addTextData(d[I - 1], d[I], void 0);
+          break;
+        case 20:
+        case 21:
+          c.addTextData(d[I - 2], d[I - 1], d[I]);
+          break;
+        case 23:
+          c.addStyleData(d[I - 1], d[I]);
+          break;
+        case 24:
+        case 25:
+        case 26:
+          var C = c.getCurrentSets();
+          if (!C) throw new Error("text requires set");
+          c.addTextData(C, d[I], void 0);
+          break;
+        case 27:
+        case 28:
+          var C = c.getCurrentSets();
+          if (!C) throw new Error("text requires set");
+          c.addTextData(C, d[I - 1], d[I]);
+          break;
+        case 29:
+        case 41:
+          this.$ = [d[I]];
+          break;
+        case 30:
+        case 42:
+          this.$ = [...d[I - 2], d[I]];
+          break;
+        case 31:
+          this.$ = [d[I - 2], d[I]];
+          break;
+        case 33:
+          this.$ = d[I].join(" ");
+          break;
+        case 34:
+          this.$ = [d[I]];
+          break;
+        case 35:
+          d[I - 1].push(d[I]), this.$ = d[I - 1];
+          break;
+        case 43:
+        case 44:
+          this.$ = d[I];
+          break;
+      }
+    }, "anonymous"),
+    table: [t(n, [2, 2], { 3: 1, 4: 2 }), { 1: [3] }, { 5: [1, 3], 8: [1, 4] }, t(s, [2, 4], { 6: 5 }), t(n, [2, 3]), { 7: [1, 6], 8: [1, 8], 9: 7, 10: 9, 11: [1, 10], 12: [1, 11], 17: [1, 12], 19: [1, 13], 22: [1, 14], 24: [1, 15] }, { 1: [2, 1] }, t(s, [2, 5]), t(s, [2, 6]), t(s, [2, 7]), t(s, [2, 8]), { 13: 16, 20: e, 21: i }, { 13: 20, 18: 19, 20: e, 21: i }, { 13: 20, 18: 21, 20: e, 21: i }, { 16: [1, 25], 20: [1, 23], 21: [1, 24], 23: 22 }, { 13: 20, 18: 26, 20: e, 21: i }, t(s, [2, 9], { 14: [1, 27], 15: [1, 28] }), t(o, [2, 43]), t(o, [2, 44]), t(s, [2, 13], { 14: [1, 29], 15: [1, 30], 27: r }), t(o, [2, 41]), { 16: [1, 34], 20: [1, 32], 21: [1, 33], 27: r }, t(s, [2, 22]), t(s, [2, 24], { 14: [1, 35] }), t(s, [2, 25], { 14: [1, 36] }), t(s, [2, 26]), { 20: l, 25: 37, 26: 38, 27: r }, t(s, [2, 10], { 15: [1, 40] }), { 16: [1, 41] }, t(s, [2, 14], { 15: [1, 42] }), { 16: [1, 43] }, { 13: 44, 20: e, 21: i }, t(s, [2, 17], { 14: [1, 45] }), t(s, [2, 18], { 14: [1, 46] }), t(s, [2, 19]), t(s, [2, 27]), t(s, [2, 28]), t(s, [2, 23], { 27: [1, 47] }), t(f, [2, 29]), { 15: [1, 48] }, { 16: [1, 49] }, t(s, [2, 11]), { 16: [1, 50] }, t(s, [2, 15]), t(o, [2, 42]), t(s, [2, 20]), t(s, [2, 21]), { 20: l, 26: 51 }, { 16: u, 20: a, 21: [1, 53], 28: 52, 29: 54, 30: 55, 31: y, 32: h, 33: b }, t(s, [2, 12]), t(s, [2, 16]), t(f, [2, 30]), t(f, [2, 31]), t(f, [2, 32]), t(f, [2, 33], { 30: 61, 16: u, 20: a, 31: y, 32: h, 33: b }), t(p, [2, 34]), t(p, [2, 36]), t(p, [2, 37]), t(p, [2, 38]), t(p, [2, 39]), t(p, [2, 40]), t(p, [2, 35])],
+    defaultActions: { 6: [2, 1] },
+    parseError: /* @__PURE__ */ w(function(g, m) {
+      if (m.recoverable)
+        this.trace(g);
+      else {
+        var v = new Error(g);
+        throw v.hash = m, v;
+      }
+    }, "parseError"),
+    parse: /* @__PURE__ */ w(function(g) {
+      var m = this, v = [0], c = [], x = [null], d = [], D = this.table, I = "", C = 0, U = 0, V = 2, O = 1, R = d.slice.call(arguments, 1), T = Object.create(this.lexer), A = { yy: {} };
+      for (var G in this.yy)
+        Object.prototype.hasOwnProperty.call(this.yy, G) && (A.yy[G] = this.yy[G]);
+      T.setInput(g, A.yy), A.yy.lexer = T, A.yy.parser = this, typeof T.yylloc > "u" && (T.yylloc = {});
+      var P = T.yylloc;
+      d.push(P);
+      var B = T.options && T.options.ranges;
+      typeof A.yy.parseError == "function" ? this.parseError = A.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
+      function L(W) {
+        v.length = v.length - 2 * W, x.length = x.length - W, d.length = d.length - W;
+      }
+      w(L, "popStack");
+      function K() {
+        var W;
+        return W = c.pop() || T.lex() || O, typeof W != "number" && (W instanceof Array && (c = W, W = c.pop()), W = m.symbols_[W] || W), W;
+      }
+      w(K, "lex");
+      for (var z, N, j, X, k = {}, F, H, et, Y; ; ) {
+        if (N = v[v.length - 1], this.defaultActions[N] ? j = this.defaultActions[N] : ((z === null || typeof z > "u") && (z = K()), j = D[N] && D[N][z]), typeof j > "u" || !j.length || !j[0]) {
+          var Z = "";
+          Y = [];
+          for (F in D[N])
+            this.terminals_[F] && F > V && Y.push("'" + this.terminals_[F] + "'");
+          T.showPosition ? Z = "Parse error on line " + (C + 1) + `:
+` + T.showPosition() + `
+Expecting ` + Y.join(", ") + ", got '" + (this.terminals_[z] || z) + "'" : Z = "Parse error on line " + (C + 1) + ": Unexpected " + (z == O ? "end of input" : "'" + (this.terminals_[z] || z) + "'"), this.parseError(Z, {
+            text: T.match,
+            token: this.terminals_[z] || z,
+            line: T.yylineno,
+            loc: P,
+            expected: Y
+          });
+        }
+        if (j[0] instanceof Array && j.length > 1)
+          throw new Error("Parse Error: multiple actions possible at state: " + N + ", token: " + z);
+        switch (j[0]) {
+          case 1:
+            v.push(z), x.push(T.yytext), d.push(T.yylloc), v.push(j[1]), z = null, U = T.yyleng, I = T.yytext, C = T.yylineno, P = T.yylloc;
+            break;
+          case 2:
+            if (H = this.productions_[j[1]][1], k.$ = x[x.length - H], k._$ = {
+              first_line: d[d.length - (H || 1)].first_line,
+              last_line: d[d.length - 1].last_line,
+              first_column: d[d.length - (H || 1)].first_column,
+              last_column: d[d.length - 1].last_column
+            }, B && (k._$.range = [
+              d[d.length - (H || 1)].range[0],
+              d[d.length - 1].range[1]
+            ]), X = this.performAction.apply(k, [
+              I,
+              U,
+              C,
+              A.yy,
+              j[1],
+              x,
+              d
+            ].concat(R)), typeof X < "u")
+              return X;
+            H && (v = v.slice(0, -1 * H * 2), x = x.slice(0, -1 * H), d = d.slice(0, -1 * H)), v.push(this.productions_[j[1]][0]), x.push(k.$), d.push(k._$), et = D[v[v.length - 2]][v[v.length - 1]], v.push(et);
+            break;
+          case 3:
+            return !0;
+        }
+      }
+      return !0;
+    }, "parse")
+  }, E = /* @__PURE__ */ (function() {
+    var S = {
+      EOF: 1,
+      parseError: /* @__PURE__ */ w(function(m, v) {
+        if (this.yy.parser)
+          this.yy.parser.parseError(m, v);
+        else
+          throw new Error(m);
+      }, "parseError"),
+      // resets the lexer, sets new input
+      setInput: /* @__PURE__ */ w(function(g, m) {
+        return this.yy = m || this.yy || {}, this._input = g, this._more = this._backtrack = this.done = !1, this.yylineno = this.yyleng = 0, this.yytext = this.matched = this.match = "", this.conditionStack = ["INITIAL"], this.yylloc = {
+          first_line: 1,
+          first_column: 0,
+          last_line: 1,
+          last_column: 0
+        }, this.options.ranges && (this.yylloc.range = [0, 0]), this.offset = 0, this;
+      }, "setInput"),
+      // consumes and returns one char from the input
+      input: /* @__PURE__ */ w(function() {
+        var g = this._input[0];
+        this.yytext += g, this.yyleng++, this.offset++, this.match += g, this.matched += g;
+        var m = g.match(/(?:\r\n?|\n).*/g);
+        return m ? (this.yylineno++, this.yylloc.last_line++) : this.yylloc.last_column++, this.options.ranges && this.yylloc.range[1]++, this._input = this._input.slice(1), g;
+      }, "input"),
+      // unshifts one char (or a string) into the input
+      unput: /* @__PURE__ */ w(function(g) {
+        var m = g.length, v = g.split(/(?:\r\n?|\n)/g);
+        this._input = g + this._input, this.yytext = this.yytext.substr(0, this.yytext.length - m), this.offset -= m;
+        var c = this.match.split(/(?:\r\n?|\n)/g);
+        this.match = this.match.substr(0, this.match.length - 1), this.matched = this.matched.substr(0, this.matched.length - 1), v.length - 1 && (this.yylineno -= v.length - 1);
+        var x = this.yylloc.range;
+        return this.yylloc = {
+          first_line: this.yylloc.first_line,
+          last_line: this.yylineno + 1,
+          first_column: this.yylloc.first_column,
+          last_column: v ? (v.length === c.length ? this.yylloc.first_column : 0) + c[c.length - v.length].length - v[0].length : this.yylloc.first_column - m
+        }, this.options.ranges && (this.yylloc.range = [x[0], x[0] + this.yyleng - m]), this.yyleng = this.yytext.length, this;
+      }, "unput"),
+      // When called from action, caches matched text and appends it on next action
+      more: /* @__PURE__ */ w(function() {
+        return this._more = !0, this;
+      }, "more"),
+      // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.
+      reject: /* @__PURE__ */ w(function() {
+        if (this.options.backtrack_lexer)
+          this._backtrack = !0;
+        else
+          return this.parseError("Lexical error on line " + (this.yylineno + 1) + `. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).
+` + this.showPosition(), {
+            text: "",
+            token: null,
+            line: this.yylineno
+          });
+        return this;
+      }, "reject"),
+      // retain first n characters of the match
+      less: /* @__PURE__ */ w(function(g) {
+        this.unput(this.match.slice(g));
+      }, "less"),
+      // displays already matched input, i.e. for error messages
+      pastInput: /* @__PURE__ */ w(function() {
+        var g = this.matched.substr(0, this.matched.length - this.match.length);
+        return (g.length > 20 ? "..." : "") + g.substr(-20).replace(/\n/g, "");
+      }, "pastInput"),
+      // displays upcoming input, i.e. for error messages
+      upcomingInput: /* @__PURE__ */ w(function() {
+        var g = this.match;
+        return g.length < 20 && (g += this._input.substr(0, 20 - g.length)), (g.substr(0, 20) + (g.length > 20 ? "..." : "")).replace(/\n/g, "");
+      }, "upcomingInput"),
+      // displays the character position where the lexing error occurred, i.e. for error messages
+      showPosition: /* @__PURE__ */ w(function() {
+        var g = this.pastInput(), m = new Array(g.length + 1).join("-");
+        return g + this.upcomingInput() + `
+` + m + "^";
+      }, "showPosition"),
+      // test the lexed token: return FALSE when not a match, otherwise return token
+      test_match: /* @__PURE__ */ w(function(g, m) {
+        var v, c, x;
+        if (this.options.backtrack_lexer && (x = {
+          yylineno: this.yylineno,
+          yylloc: {
+            first_line: this.yylloc.first_line,
+            last_line: this.last_line,
+            first_column: this.yylloc.first_column,
+            last_column: this.yylloc.last_column
+          },
+          yytext: this.yytext,
+          match: this.match,
+          matches: this.matches,
+          matched: this.matched,
+          yyleng: this.yyleng,
+          offset: this.offset,
+          _more: this._more,
+          _input: this._input,
+          yy: this.yy,
+          conditionStack: this.conditionStack.slice(0),
+          done: this.done
+        }, this.options.ranges && (x.yylloc.range = this.yylloc.range.slice(0))), c = g[0].match(/(?:\r\n?|\n).*/g), c && (this.yylineno += c.length), this.yylloc = {
+          first_line: this.yylloc.last_line,
+          last_line: this.yylineno + 1,
+          first_column: this.yylloc.last_column,
+          last_column: c ? c[c.length - 1].length - c[c.length - 1].match(/\r?\n?/)[0].length : this.yylloc.last_column + g[0].length
+        }, this.yytext += g[0], this.match += g[0], this.matches = g, this.yyleng = this.yytext.length, this.options.ranges && (this.yylloc.range = [this.offset, this.offset += this.yyleng]), this._more = !1, this._backtrack = !1, this._input = this._input.slice(g[0].length), this.matched += g[0], v = this.performAction.call(this, this.yy, this, m, this.conditionStack[this.conditionStack.length - 1]), this.done && this._input && (this.done = !1), v)
+          return v;
+        if (this._backtrack) {
+          for (var d in x)
+            this[d] = x[d];
+          return !1;
+        }
+        return !1;
+      }, "test_match"),
+      // return next match in input
+      next: /* @__PURE__ */ w(function() {
+        if (this.done)
+          return this.EOF;
+        this._input || (this.done = !0);
+        var g, m, v, c;
+        this._more || (this.yytext = "", this.match = "");
+        for (var x = this._currentRules(), d = 0; d < x.length; d++)
+          if (v = this._input.match(this.rules[x[d]]), v && (!m || v[0].length > m[0].length)) {
+            if (m = v, c = d, this.options.backtrack_lexer) {
+              if (g = this.test_match(v, x[d]), g !== !1)
+                return g;
+              if (this._backtrack) {
+                m = !1;
+                continue;
+              } else
+                return !1;
+            } else if (!this.options.flex)
+              break;
+          }
+        return m ? (g = this.test_match(m, x[c]), g !== !1 ? g : !1) : this._input === "" ? this.EOF : this.parseError("Lexical error on line " + (this.yylineno + 1) + `. Unrecognized text.
+` + this.showPosition(), {
+          text: "",
+          token: null,
+          line: this.yylineno
+        });
+      }, "next"),
+      // return next match that has a token
+      lex: /* @__PURE__ */ w(function() {
+        var m = this.next();
+        return m || this.lex();
+      }, "lex"),
+      // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
+      begin: /* @__PURE__ */ w(function(m) {
+        this.conditionStack.push(m);
+      }, "begin"),
+      // pop the previously active lexer condition state off the condition stack
+      popState: /* @__PURE__ */ w(function() {
+        var m = this.conditionStack.length - 1;
+        return m > 0 ? this.conditionStack.pop() : this.conditionStack[0];
+      }, "popState"),
+      // produce the lexer rule set which is active for the currently active lexer condition state
+      _currentRules: /* @__PURE__ */ w(function() {
+        return this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1] ? this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules : this.conditions.INITIAL.rules;
+      }, "_currentRules"),
+      // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
+      topState: /* @__PURE__ */ w(function(m) {
+        return m = this.conditionStack.length - 1 - Math.abs(m || 0), m >= 0 ? this.conditionStack[m] : "INITIAL";
+      }, "topState"),
+      // alias for begin(condition)
+      pushState: /* @__PURE__ */ w(function(m) {
+        this.begin(m);
+      }, "pushState"),
+      // return the number of states currently on the stack
+      stateStackSize: /* @__PURE__ */ w(function() {
+        return this.conditionStack.length;
+      }, "stateStackSize"),
+      options: { "case-insensitive": !0 },
+      performAction: /* @__PURE__ */ w(function(m, v, c, x) {
+        switch (c) {
+          case 0:
+            break;
+          case 1:
+            break;
+          case 2:
+            break;
+          case 3:
+            if (m.getIndentMode && m.getIndentMode())
+              return m.consumeIndentText = !0, this.begin("INITIAL"), 22;
+            break;
+          case 4:
+            break;
+          case 5:
+            m.setIndentMode && m.setIndentMode(!1), this.begin("INITIAL"), this.unput(v.yytext);
+            break;
+          case 6:
+            return this.begin("bol"), 8;
+          case 7:
+            break;
+          case 8:
+            break;
+          case 9:
+            return 7;
+          case 10:
+            return 11;
+          case 11:
+            return 5;
+          case 12:
+            return 12;
+          case 13:
+            return 17;
+          case 14:
+            if (m.consumeIndentText)
+              m.consumeIndentText = !1;
+            else
+              return 19;
+            break;
+          case 15:
+            return 24;
+          case 16:
+            return v.yytext = v.yytext.slice(2, -2), 14;
+          case 17:
+            return v.yytext = v.yytext.slice(1, -1).trim(), 14;
+          case 18:
+            return 16;
+          case 19:
+            return 31;
+          case 20:
+            return 33;
+          case 21:
+            return 32;
+          case 22:
+            return 20;
+          case 23:
+            return 21;
+          case 24:
+            return 27;
+          case 25:
+            return 15;
+        }
+      }, "anonymous"),
+      rules: [/^(?:%%(?!\{)[^\n]*)/i, /^(?:[^\}]%%[^\n]*)/i, /^(?:[ \t]+(?=[\n\r]))/i, /^(?:[ \t]+(?=text\b))/i, /^(?:[ \t]+)/i, /^(?:[^ \t\n\r])/i, /^(?:[\n\r]+)/i, /^(?:%%[^\n]*)/i, /^(?:[ \t]+)/i, /^(?:$)/i, /^(?:title\s[^#\n;]+)/i, /^(?:venn-beta\b)/i, /^(?:set\b)/i, /^(?:union\b)/i, /^(?:text\b)/i, /^(?:style\b)/i, /^(?:\["[^\"]*"\])/i, /^(?:\[[^\]\"]+\])/i, /^(?:[+-]?(\d+(\.\d+)?|\.\d+))/i, /^(?:#[0-9a-fA-F]{3,8})/i, /^(?:rgba\(\s*[0-9.]+\s*[,]\s*[0-9.]+\s*[,]\s*[0-9.]+\s*[,]\s*[0-9.]+\s*\))/i, /^(?:rgb\(\s*[0-9.]+\s*[,]\s*[0-9.]+\s*[,]\s*[0-9.]+\s*\))/i, /^(?:[A-Za-z_][A-Za-z0-9\-_]*)/i, /^(?:"[^\"]*")/i, /^(?:,)/i, /^(?::)/i],
+      conditions: { bol: { rules: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25], inclusive: !0 }, INITIAL: { rules: [0, 1, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25], inclusive: !0 } }
+    };
+    return S;
+  })();
+  M.lexer = E;
+  function _() {
+    this.yy = {};
+  }
+  return w(_, "Parser"), _.prototype = M, M.Parser = _, new _();
+})();
+gt.parser = gt;
+var we = gt, yt = [], pt = [], mt = [], bt = /* @__PURE__ */ new Set(), vt, It = !1, _e = /* @__PURE__ */ w((t, n, s) => {
+  const e = it(t).sort(), i = s ?? 10 / Math.pow(t.length, 2);
+  vt = e, e.length === 1 && bt.add(e[0]), yt.push({
+    sets: e,
+    size: i,
+    label: n ? nt(n) : void 0
+  });
+}, "addSubsetData"), Te = /* @__PURE__ */ w(() => yt, "getSubsetData"), nt = /* @__PURE__ */ w((t) => {
+  const n = t.trim();
+  return n.length >= 2 && n.startsWith('"') && n.endsWith('"') ? n.slice(1, -1) : n;
+}, "normalizeText"), Ee = /* @__PURE__ */ w((t) => t && nt(t), "normalizeStyleValue"), ze = /* @__PURE__ */ w((t, n, s) => {
+  const e = nt(n);
+  pt.push({
+    sets: it(t).sort(),
+    id: e,
+    label: s ? nt(s) : void 0
+  });
+}, "addTextData"), Ae = /* @__PURE__ */ w((t, n) => {
+  const s = it(t).sort(), e = {};
+  for (const [i, o] of n)
+    e[i] = Ee(o) ?? o;
+  mt.push({ targets: s, styles: e });
+}, "addStyleData"), Re = /* @__PURE__ */ w(() => mt, "getStyleData"), it = /* @__PURE__ */ w((t) => t.map((n) => nt(n)), "normalizeIdentifierList"), De = /* @__PURE__ */ w((t) => {
+  const s = it(t).filter((e) => !bt.has(e));
+  if (s.length > 0)
+    throw new Error(`unknown set identifier: ${s.join(", ")}`);
+}, "validateUnionIdentifiers"), Ce = /* @__PURE__ */ w(() => pt, "getTextData"), Ne = /* @__PURE__ */ w(() => vt, "getCurrentSets"), Oe = /* @__PURE__ */ w(() => It, "getIndentMode"), Fe = /* @__PURE__ */ w((t) => {
+  It = t;
+}, "setIndentMode"), je = re.venn;
+function Vt() {
+  return oe(je, wt().venn);
+}
+w(Vt, "getConfig");
+var Le = /* @__PURE__ */ w(() => {
+  ie(), yt.length = 0, pt.length = 0, mt.length = 0, bt.clear(), vt = void 0, It = !1;
+}, "customClear"), Pe = {
+  getConfig: Vt,
+  clear: Le,
+  setAccTitle: Jt,
+  getAccTitle: Zt,
+  setDiagramTitle: Xt,
+  getDiagramTitle: Yt,
+  getAccDescription: Ht,
+  setAccDescription: Kt,
+  addSubsetData: _e,
+  getSubsetData: Te,
+  addTextData: ze,
+  addStyleData: Ae,
+  validateUnionIdentifiers: De,
+  getTextData: Ce,
+  getStyleData: Re,
+  getCurrentSets: Ne,
+  getIndentMode: Oe,
+  setIndentMode: Fe
+}, Be = /* @__PURE__ */ w((t) => `
+  .venn-title {
+    font-size: 32px;
+    fill: ${t.vennTitleTextColor};
+    font-family: ${t.fontFamily};
+  }
+
+  .venn-circle text {
+    font-size: 48px;
+    font-family: ${t.fontFamily};
+  }
+
+  .venn-intersection text {
+    font-size: 48px;
+    fill: ${t.vennSetTextColor};
+    font-family: ${t.fontFamily};
+  }
+
+  .venn-text-node {
+    font-family: ${t.fontFamily};
+    color: ${t.vennSetTextColor};
+  }
+`, "getStyles"), Ve = Be;
+function qt(t) {
+  const n = /* @__PURE__ */ new Map();
+  for (const s of t) {
+    const e = s.targets.join("|"), i = n.get(e);
+    i ? Object.assign(i, s.styles) : n.set(e, { ...s.styles });
+  }
+  return n;
+}
+w(qt, "buildStyleByKey");
+var qe = /* @__PURE__ */ w((t, n, s, e) => {
+  const i = e.db, o = i.getConfig?.(), { themeVariables: r, look: l, handDrawnSeed: f } = wt(), u = l === "handDrawn", a = [
+    r.venn1,
+    r.venn2,
+    r.venn3,
+    r.venn4,
+    r.venn5,
+    r.venn6,
+    r.venn7,
+    r.venn8
+  ].filter(Boolean), y = i.getDiagramTitle?.(), h = i.getSubsetData(), b = i.getTextData(), p = qt(i.getStyleData()), M = Gt(h), E = o?.width ?? 800, _ = o?.height ?? 450, g = E / 1600, m = y ? 48 * g : 0, v = r.primaryTextColor ?? r.textColor, c = Qt(n);
+  c.attr("viewBox", `0 0 ${E} ${_}`), y && c.append("text").text(y).attr("class", "venn-title").attr("font-size", `${32 * g}px`).attr("text-anchor", "middle").attr("dominant-baseline", "middle").attr("x", "50%").attr("y", 32 * g).style("fill", r.vennTitleTextColor || r.titleColor);
+  const x = ot(document.createElement("div")), d = ve().width(E).height(_ - m);
+  x.datum(M).call(d);
+  const D = u ? $t.svg(x.select("svg").node()) : void 0, I = Se(M, {
+    width: E,
+    height: _ - m,
+    padding: o?.padding ?? 15
+  }), C = /* @__PURE__ */ new Map();
+  for (const R of I) {
+    const T = Q([...R.data.sets].sort());
+    C.set(T, R);
+  }
+  b.length > 0 && Ut(o, C, x, b, g, p);
+  const U = te(r.background || "#f4f4f4");
+  x.selectAll(".venn-circle").each(function(R, T) {
+    const A = ot(this), P = Q([...R.sets].sort()), B = p.get(P), L = B?.fill || a[T % a.length] || r.primaryColor;
+    A.classed(`venn-set-${T % 8}`, !0);
+    const K = B?.["fill-opacity"] ?? 0.1, z = B?.stroke || L, N = B?.["stroke-width"] || `${5 * g}`;
+    if (u && D) {
+      const X = C.get(P);
+      if (X && X.circles.length > 0) {
+        const k = X.circles[0], F = D.circle(k.x, k.y, k.radius * 2, {
+          roughness: 0.7,
+          seed: f,
+          fill: kt(L, 0.7),
+          fillStyle: "hachure",
+          fillWeight: 2,
+          hachureGap: 8,
+          hachureAngle: -41 + T * 60,
+          stroke: z,
+          strokeWidth: parseFloat(String(N))
+        });
+        A.select("path").remove(), A.node()?.insertBefore(F, A.select("text").node());
+      }
+    } else
+      A.select("path").style("fill", L).style("fill-opacity", K).style("stroke", z).style("stroke-width", N).style("stroke-opacity", 0.95);
+    const j = B?.color || (U ? ee(L, 30) : ne(L, 30));
+    A.select("text").style("font-size", `${48 * g}px`).style("fill", j);
+  }), u && D ? x.selectAll(".venn-intersection").each(function(R) {
+    const T = ot(this), G = Q([...R.sets].sort()), P = p.get(G), B = P?.fill;
+    if (B) {
+      const L = T.select("path"), K = L.attr("d");
+      if (K) {
+        const z = D.path(K, {
+          roughness: 0.7,
+          seed: f,
+          fill: kt(B, 0.3),
+          fillStyle: "cross-hatch",
+          fillWeight: 2,
+          hachureGap: 6,
+          hachureAngle: 60,
+          stroke: "none"
+        }), N = L.node();
+        N?.parentNode?.insertBefore(z, N), L.remove();
+      }
+    } else
+      T.select("path").style("fill-opacity", 0);
+    T.select("text").style("font-size", `${48 * g}px`).style("fill", P?.color ?? r.vennSetTextColor ?? v);
+  }) : (x.selectAll(".venn-intersection text").style("font-size", `${48 * g}px`).style("fill", (R) => {
+    const A = Q([...R.sets].sort());
+    return p.get(A)?.color ?? r.vennSetTextColor ?? v;
+  }), x.selectAll(".venn-intersection path").style("fill-opacity", (R) => {
+    const A = Q([...R.sets].sort());
+    return p.get(A)?.fill ? 1 : 0;
+  }).style("fill", (R) => {
+    const A = Q([...R.sets].sort());
+    return p.get(A)?.fill ?? "transparent";
+  }));
+  const V = c.append("g").attr("transform", `translate(0, ${m})`), O = x.select("svg").node();
+  if (O && "childNodes" in O)
+    for (const R of [...O.childNodes])
+      V.node()?.appendChild(R);
+  se(c, _, E, o?.useMaxWidth ?? !0);
+}, "draw");
+function Q(t) {
+  return t.join("|");
+}
+w(Q, "stableSetsKey");
+function Ut(t, n, s, e, i, o) {
+  const r = t?.useDebugLayout ?? !1, f = s.select("svg").append("g").attr("class", "venn-text-nodes"), u = /* @__PURE__ */ new Map();
+  for (const a of e) {
+    const y = Q(a.sets), h = u.get(y);
+    h ? h.push(a) : u.set(y, [a]);
+  }
+  for (const [a, y] of u.entries()) {
+    const h = n.get(a);
+    if (!h?.text)
+      continue;
+    const b = h.text.x, p = h.text.y, M = Math.min(...h.circles.map((O) => O.radius)), E = Math.min(
+      ...h.circles.map((O) => O.radius - Math.hypot(b - O.x, p - O.y))
+    );
+    let _ = Number.isFinite(E) ? Math.max(0, E) : 0;
+    _ === 0 && Number.isFinite(M) && (_ = M * 0.6);
+    const S = f.append("g").attr("class", "venn-text-area").attr("font-size", `${40 * i}px`);
+    r && S.append("circle").attr("class", "venn-text-debug-circle").attr("cx", b).attr("cy", p).attr("r", _).attr("fill", "none").attr("stroke", "purple").attr("stroke-width", 1.5 * i).attr("stroke-dasharray", `${6 * i} ${4 * i}`);
+    const g = Math.max(80 * i, _ * 2 * 0.95), m = Math.max(60 * i, _ * 2 * 0.95), x = (h.data.label && h.data.label.length > 0 ? Math.min(32 * i, _ * 0.25) : 0) + (y.length <= 2 ? 30 * i : 0), d = b - g / 2, D = p - m / 2 + x, I = Math.max(1, Math.ceil(Math.sqrt(y.length))), C = Math.max(1, Math.ceil(y.length / I)), U = g / I, V = m / C;
+    for (const [O, R] of y.entries()) {
+      const T = O % I, A = Math.floor(O / I), G = d + U * (T + 0.5), P = D + V * (A + 0.5);
+      r && S.append("rect").attr("class", "venn-text-debug-cell").attr("x", d + U * T).attr("y", D + V * A).attr("width", U).attr("height", V).attr("fill", "none").attr("stroke", "teal").attr("stroke-width", 1 * i).attr("stroke-dasharray", `${4 * i} ${3 * i}`);
+      const B = U * 0.9, L = V * 0.9, K = S.append("foreignObject").attr("class", "venn-text-node-fo").attr("width", B).attr("height", L).attr("x", G - B / 2).attr("y", P - L / 2).attr("overflow", "visible"), z = o.get(R.id)?.color, N = K.append("xhtml:span").attr("class", "venn-text-node").style("display", "flex").style("width", "100%").style("height", "100%").style("white-space", "normal").style("align-items", "center").style("justify-content", "center").style("text-align", "center").style("overflow-wrap", "normal").style("word-break", "normal").text(R.label ?? R.id);
+      z && N.style("color", z);
+    }
+  }
+}
+w(Ut, "renderTextNodes");
+function Gt(t) {
+  const n = new Set(t.map((i) => [...i.sets].sort().join("|"))), s = new Map(
+    t.filter((i) => i.sets.length === 1 && i.size !== void 0).map((i) => [i.sets[0], i.size])
+  ), e = [];
+  for (const i of t) {
+    if (i.sets.length < 3)
+      continue;
+    const o = [...i.sets].sort();
+    for (let r = 0; r < o.length - 1; r++)
+      for (let l = r + 1; l < o.length; l++) {
+        const f = [o[r], o[l]], u = f.join("|");
+        if (!n.has(u)) {
+          n.add(u);
+          const a = s.get(f[0]), y = s.get(f[1]), h = a !== void 0 && y !== void 0 ? Math.min(a, y) / 4 : 2.5;
+          e.push({ sets: f, size: h, label: "" });
+        }
+      }
+  }
+  return e.length > 0 ? [...t, ...e] : t;
+}
+w(Gt, "ensurePairwiseSubsets");
+var Ue = { draw: qe }, We = {
+  parser: we,
+  db: Pe,
+  renderer: Ue,
+  styles: Ve
+};
+export {
+  We as diagram
+};
+//# sourceMappingURL=vennDiagram-T6HMQDX7-DYZl8srI.js.map