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