@fecp/designer 5.6.6 → 5.6.8

package/es/node_modules/@upsetjs/venn.js/build/venn.esm.mjs

@@ -0,0 +1,1465 @@
+const SMALL$1 = 1e-10;
+function intersectionArea(circles, stats) {
+  const intersectionPoints = getIntersectionPoints(circles);
+  const innerPoints = intersectionPoints.filter((p) => containedInCircles(p, circles));
+  let arcArea = 0;
+  let polygonArea = 0;
+  const arcs = [];
+  if (innerPoints.length > 1) {
+    const center = getCenter(innerPoints);
+    for (let i = 0; i < innerPoints.length; ++i) {
+      const p = innerPoints[i];
+      p.angle = Math.atan2(p.x - center.x, p.y - center.y);
+    }
+    innerPoints.sort((a, b) => b.angle - a.angle);
+    let p2 = innerPoints[innerPoints.length - 1];
+    for (let i = 0; i < innerPoints.length; ++i) {
+      const p1 = innerPoints[i];
+      polygonArea += (p2.x + p1.x) * (p1.y - p2.y);
+      const midPoint = { x: (p1.x + p2.x) / 2, y: (p1.y + p2.y) / 2 };
+      let arc = null;
+      for (let j = 0; j < p1.parentIndex.length; ++j) {
+        if (p2.parentIndex.includes(p1.parentIndex[j])) {
+          const circle = circles[p1.parentIndex[j]];
+          const a1 = Math.atan2(p1.x - circle.x, p1.y - circle.y);
+          const a2 = Math.atan2(p2.x - circle.x, p2.y - circle.y);
+          let angleDiff = a2 - a1;
+          if (angleDiff < 0) {
+            angleDiff += 2 * Math.PI;
+          }
+          const a = a2 - angleDiff / 2;
+          let width = distance(midPoint, {
+            x: circle.x + circle.radius * Math.sin(a),
+            y: circle.y + circle.radius * Math.cos(a)
+          });
+          if (width > circle.radius * 2) {
+            width = circle.radius * 2;
+          }
+          if (arc == null || arc.width > width) {
+            arc = { circle, width, p1, p2, large: width > circle.radius, sweep: true };
+          }
+        }
+      }
+      if (arc != null) {
+        arcs.push(arc);
+        arcArea += circleArea(arc.circle.radius, arc.width);
+        p2 = p1;
+      }
+    }
+  } else {
+    let smallest = circles[0];
+    for (let i = 1; i < circles.length; ++i) {
+      if (circles[i].radius < smallest.radius) {
+        smallest = circles[i];
+      }
+    }
+    let disjoint = false;
+    for (let i = 0; i < circles.length; ++i) {
+      if (distance(circles[i], smallest) > Math.abs(smallest.radius - circles[i].radius)) {
+        disjoint = true;
+        break;
+      }
+    }
+    if (disjoint) {
+      arcArea = polygonArea = 0;
+    } else {
+      arcArea = smallest.radius * smallest.radius * Math.PI;
+      arcs.push({
+        circle: smallest,
+        p1: { x: smallest.x, y: smallest.y + smallest.radius },
+        p2: { x: smallest.x - SMALL$1, y: smallest.y + smallest.radius },
+        width: smallest.radius * 2,
+        large: true,
+        sweep: true
+      });
+    }
+  }
+  polygonArea /= 2;
+  if (stats) {
+    stats.area = arcArea + polygonArea;
+    stats.arcArea = arcArea;
+    stats.polygonArea = polygonArea;
+    stats.arcs = arcs;
+    stats.innerPoints = innerPoints;
+    stats.intersectionPoints = intersectionPoints;
+  }
+  return arcArea + polygonArea;
+}
+function containedInCircles(point, circles) {
+  return circles.every((circle) => distance(point, circle) < circle.radius + SMALL$1);
+}
+function getIntersectionPoints(circles) {
+  const ret = [];
+  for (let i = 0; i < circles.length; ++i) {
+    for (let j = i + 1; j < circles.length; ++j) {
+      const intersect = circleCircleIntersection(circles[i], circles[j]);
+      for (const p of intersect) {
+        p.parentIndex = [i, j];
+        ret.push(p);
+      }
+    }
+  }
+  return ret;
+}
+function circleArea(r, width) {
+  return r * r * Math.acos(1 - width / r) - (r - width) * Math.sqrt(width * (2 * r - width));
+}
+function distance(p1, p2) {
+  return Math.sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));
+}
+function circleOverlap(r1, r2, d) {
+  if (d >= r1 + r2) {
+    return 0;
+  }
+  if (d <= Math.abs(r1 - r2)) {
+    return Math.PI * Math.min(r1, r2) * Math.min(r1, r2);
+  }
+  const w1 = r1 - (d * d - r2 * r2 + r1 * r1) / (2 * d);
+  const w2 = r2 - (d * d - r1 * r1 + r2 * r2) / (2 * d);
+  return circleArea(r1, w1) + circleArea(r2, w2);
+}
+function circleCircleIntersection(p1, p2) {
+  const d = distance(p1, p2);
+  const r1 = p1.radius;
+  const r2 = p2.radius;
+  if (d >= r1 + r2 || d <= Math.abs(r1 - r2)) {
+    return [];
+  }
+  const a = (r1 * r1 - r2 * r2 + d * d) / (2 * d);
+  const h = Math.sqrt(r1 * r1 - a * a);
+  const x0 = p1.x + a * (p2.x - p1.x) / d;
+  const y0 = p1.y + a * (p2.y - p1.y) / d;
+  const rx = -(p2.y - p1.y) * (h / d);
+  const ry = -(p2.x - p1.x) * (h / d);
+  return [
+    { x: x0 + rx, y: y0 - ry },
+    { x: x0 - rx, y: y0 + ry }
+  ];
+}
+function getCenter(points) {
+  const center = { x: 0, y: 0 };
+  for (const point of points) {
+    center.x += point.x;
+    center.y += point.y;
+  }
+  center.x /= points.length;
+  center.y /= points.length;
+  return center;
+}
+function bisect(f, a, b, parameters) {
+  parameters = parameters || {};
+  const maxIterations = parameters.maxIterations || 100;
+  const tolerance = parameters.tolerance || 1e-10;
+  const fA = f(a);
+  const fB = f(b);
+  let delta = b - a;
+  if (fA * fB > 0) {
+    throw "Initial bisect points must have opposite signs";
+  }
+  if (fA === 0) return a;
+  if (fB === 0) return b;
+  for (let i = 0; i < maxIterations; ++i) {
+    delta /= 2;
+    const mid = a + delta;
+    const fMid = f(mid);
+    if (fMid * fA >= 0) {
+      a = mid;
+    }
+    if (Math.abs(delta) < tolerance || fMid === 0) {
+      return mid;
+    }
+  }
+  return a + delta;
+}
+function zeros(x) {
+  const r = new Array(x);
+  for (let i = 0; i < x; ++i) {
+    r[i] = 0;
+  }
+  return r;
+}
+function zerosM(x, y) {
+  return zeros(x).map(() => zeros(y));
+}
+function dot(a, b) {
+  let ret = 0;
+  for (let i = 0; i < a.length; ++i) {
+    ret += a[i] * b[i];
+  }
+  return ret;
+}
+function norm2(a) {
+  return Math.sqrt(dot(a, a));
+}
+function scale(ret, value, c) {
+  for (let i = 0; i < value.length; ++i) {
+    ret[i] = value[i] * c;
+  }
+}
+function weightedSum(ret, w1, v1, w2, v2) {
+  for (let j = 0; j < ret.length; ++j) {
+    ret[j] = w1 * v1[j] + w2 * v2[j];
+  }
+}
+function nelderMead(f, x0, parameters) {
+  parameters = parameters || {};
+  const maxIterations = parameters.maxIterations || x0.length * 200;
+  const nonZeroDelta = parameters.nonZeroDelta || 1.05;
+  const zeroDelta = parameters.zeroDelta || 1e-3;
+  const minErrorDelta = parameters.minErrorDelta || 1e-6;
+  const minTolerance = parameters.minErrorDelta || 1e-5;
+  const rho = parameters.rho !== void 0 ? parameters.rho : 1;
+  const chi = parameters.chi !== void 0 ? parameters.chi : 2;
+  const psi = parameters.psi !== void 0 ? parameters.psi : -0.5;
+  const sigma = parameters.sigma !== void 0 ? parameters.sigma : 0.5;
+  let maxDiff;
+  const N = x0.length;
+  const simplex = new Array(N + 1);
+  simplex[0] = x0;
+  simplex[0].fx = f(x0);
+  simplex[0].id = 0;
+  for (let i = 0; i < N; ++i) {
+    const point = x0.slice();
+    point[i] = point[i] ? point[i] * nonZeroDelta : zeroDelta;
+    simplex[i + 1] = point;
+    simplex[i + 1].fx = f(point);
+    simplex[i + 1].id = i + 1;
+  }
+  function updateSimplex(value) {
+    for (let i = 0; i < value.length; i++) {
+      simplex[N][i] = value[i];
+    }
+    simplex[N].fx = value.fx;
+  }
+  const sortOrder = (a, b) => a.fx - b.fx;
+  const centroid = x0.slice();
+  const reflected = x0.slice();
+  const contracted = x0.slice();
+  const expanded = x0.slice();
+  for (let iteration = 0; iteration < maxIterations; ++iteration) {
+    simplex.sort(sortOrder);
+    if (parameters.history) {
+      const sortedSimplex = simplex.map((x) => {
+        const state = x.slice();
+        state.fx = x.fx;
+        state.id = x.id;
+        return state;
+      });
+      sortedSimplex.sort((a, b) => a.id - b.id);
+      parameters.history.push({
+        x: simplex[0].slice(),
+        fx: simplex[0].fx,
+        simplex: sortedSimplex
+      });
+    }
+    maxDiff = 0;
+    for (let i = 0; i < N; ++i) {
+      maxDiff = Math.max(maxDiff, Math.abs(simplex[0][i] - simplex[1][i]));
+    }
+    if (Math.abs(simplex[0].fx - simplex[N].fx) < minErrorDelta && maxDiff < minTolerance) {
+      break;
+    }
+    for (let i = 0; i < N; ++i) {
+      centroid[i] = 0;
+      for (let j = 0; j < N; ++j) {
+        centroid[i] += simplex[j][i];
+      }
+      centroid[i] /= N;
+    }
+    const worst = simplex[N];
+    weightedSum(reflected, 1 + rho, centroid, -rho, worst);
+    reflected.fx = f(reflected);
+    if (reflected.fx < simplex[0].fx) {
+      weightedSum(expanded, 1 + chi, centroid, -chi, worst);
+      expanded.fx = f(expanded);
+      if (expanded.fx < reflected.fx) {
+        updateSimplex(expanded);
+      } else {
+        updateSimplex(reflected);
+      }
+    } else if (reflected.fx >= simplex[N - 1].fx) {
+      let shouldReduce = false;
+      if (reflected.fx > worst.fx) {
+        weightedSum(contracted, 1 + psi, centroid, -psi, worst);
+        contracted.fx = f(contracted);
+        if (contracted.fx < worst.fx) {
+          updateSimplex(contracted);
+        } else {
+          shouldReduce = true;
+        }
+      } else {
+        weightedSum(contracted, 1 - psi * rho, centroid, psi * rho, worst);
+        contracted.fx = f(contracted);
+        if (contracted.fx < reflected.fx) {
+          updateSimplex(contracted);
+        } else {
+          shouldReduce = true;
+        }
+      }
+      if (shouldReduce) {
+        if (sigma >= 1) break;
+        for (let i = 1; i < simplex.length; ++i) {
+          weightedSum(simplex[i], 1 - sigma, simplex[0], sigma, simplex[i]);
+          simplex[i].fx = f(simplex[i]);
+        }
+      }
+    } else {
+      updateSimplex(reflected);
+    }
+  }
+  simplex.sort(sortOrder);
+  return { fx: simplex[0].fx, x: simplex[0] };
+}
+function wolfeLineSearch(f, pk, current, next, a, c1, c2) {
+  const phi0 = current.fx;
+  const phiPrime0 = dot(current.fxprime, pk);
+  let phi = phi0;
+  let phi_old = phi0;
+  let phiPrime = phiPrime0;
+  let a0 = 0;
+  a = a || 1;
+  c1 = c1 || 1e-6;
+  c2 = c2 || 0.1;
+  function zoom(a_lo, a_high, phi_lo) {
+    for (let iteration = 0; iteration < 16; ++iteration) {
+      a = (a_lo + a_high) / 2;
+      weightedSum(next.x, 1, current.x, a, pk);
+      phi = next.fx = f(next.x, next.fxprime);
+      phiPrime = dot(next.fxprime, pk);
+      if (phi > phi0 + c1 * a * phiPrime0 || phi >= phi_lo) {
+        a_high = a;
+      } else {
+        if (Math.abs(phiPrime) <= -c2 * phiPrime0) {
+          return a;
+        }
+        if (phiPrime * (a_high - a_lo) >= 0) {
+          a_high = a_lo;
+        }
+        a_lo = a;
+        phi_lo = phi;
+      }
+    }
+    return 0;
+  }
+  for (let iteration = 0; iteration < 10; ++iteration) {
+    weightedSum(next.x, 1, current.x, a, pk);
+    phi = next.fx = f(next.x, next.fxprime);
+    phiPrime = dot(next.fxprime, pk);
+    if (phi > phi0 + c1 * a * phiPrime0 || iteration && phi >= phi_old) {
+      return zoom(a0, a, phi_old);
+    }
+    if (Math.abs(phiPrime) <= -c2 * phiPrime0) {
+      return a;
+    }
+    if (phiPrime >= 0) {
+      return zoom(a, a0, phi);
+    }
+    phi_old = phi;
+    a0 = a;
+    a *= 2;
+  }
+  return a;
+}
+function conjugateGradient(f, initial, params) {
+  let current = { x: initial.slice(), fx: 0, fxprime: initial.slice() };
+  let next = { x: initial.slice(), fx: 0, fxprime: initial.slice() };
+  const yk = initial.slice();
+  let pk;
+  let temp;
+  let a = 1;
+  let maxIterations;
+  params = params || {};
+  maxIterations = params.maxIterations || initial.length * 20;
+  current.fx = f(current.x, current.fxprime);
+  pk = current.fxprime.slice();
+  scale(pk, current.fxprime, -1);
+  for (let i = 0; i < maxIterations; ++i) {
+    a = wolfeLineSearch(f, pk, current, next, a);
+    if (params.history) {
+      params.history.push({
+        x: current.x.slice(),
+        fx: current.fx,
+        fxprime: current.fxprime.slice(),
+        alpha: a
+      });
+    }
+    if (!a) {
+      scale(pk, current.fxprime, -1);
+    } else {
+      weightedSum(yk, 1, next.fxprime, -1, current.fxprime);
+      const delta_k = dot(current.fxprime, current.fxprime);
+      const beta_k = Math.max(0, dot(yk, next.fxprime) / delta_k);
+      weightedSum(pk, beta_k, pk, -1, next.fxprime);
+      temp = current;
+      current = next;
+      next = temp;
+    }
+    if (norm2(current.fxprime) <= 1e-5) {
+      break;
+    }
+  }
+  if (params.history) {
+    params.history.push({
+      x: current.x.slice(),
+      fx: current.fx,
+      fxprime: current.fxprime.slice(),
+      alpha: a
+    });
+  }
+  return current;
+}
+function venn(sets, parameters = {}) {
+  parameters.maxIterations = parameters.maxIterations || 500;
+  const initialLayout = parameters.initialLayout || bestInitialLayout;
+  const loss = parameters.lossFunction || lossFunction;
+  const areas = addMissingAreas(sets, parameters);
+  const circles = initialLayout(areas, parameters);
+  const setids = Object.keys(circles);
+  const initial = [];
+  for (const setid of setids) {
+    initial.push(circles[setid].x);
+    initial.push(circles[setid].y);
+  }
+  const solution = nelderMead(
+    (values) => {
+      const current = {};
+      for (let i = 0; i < setids.length; ++i) {
+        const setid = setids[i];
+        current[setid] = {
+          x: values[2 * i],
+          y: values[2 * i + 1],
+          radius: circles[setid].radius
+          // size : circles[setid].size
+        };
+      }
+      return loss(current, areas);
+    },
+    initial,
+    parameters
+  );
+  const positions = solution.x;
+  for (let i = 0; i < setids.length; ++i) {
+    const setid = setids[i];
+    circles[setid].x = positions[2 * i];
+    circles[setid].y = positions[2 * i + 1];
+  }
+  return circles;
+}
+const SMALL = 1e-10;
+function distanceFromIntersectArea(r1, r2, overlap) {
+  if (Math.min(r1, r2) * Math.min(r1, r2) * Math.PI <= overlap + SMALL) {
+    return Math.abs(r1 - r2);
+  }
+  return bisect((distance2) => circleOverlap(r1, r2, distance2) - overlap, 0, r1 + r2);
+}
+function addMissingAreas(areas, parameters = {}) {
+  const distinct = parameters.distinct;
+  const r = areas.map((s) => Object.assign({}, s));
+  function toKey(arr) {
+    return arr.join(";");
+  }
+  if (distinct) {
+    const count = /* @__PURE__ */ new Map();
+    for (const area of r) {
+      for (let i = 0; i < area.sets.length; i++) {
+        const si = String(area.sets[i]);
+        count.set(si, area.size + (count.get(si) || 0));
+        for (let j = i + 1; j < area.sets.length; j++) {
+          const sj = String(area.sets[j]);
+          const k1 = `${si};${sj}`;
+          const k2 = `${sj};${si}`;
+          count.set(k1, area.size + (count.get(k1) || 0));
+          count.set(k2, area.size + (count.get(k2) || 0));
+        }
+      }
+    }
+    for (const area of r) {
+      if (area.sets.length < 3) {
+        area.size = count.get(toKey(area.sets));
+      }
+    }
+  }
+  const ids = [];
+  const pairs = /* @__PURE__ */ new Set();
+  for (const area of r) {
+    if (area.sets.length === 1) {
+      ids.push(area.sets[0]);
+    } else if (area.sets.length === 2) {
+      const a = area.sets[0];
+      const b = area.sets[1];
+      pairs.add(toKey(area.sets));
+      pairs.add(toKey([b, a]));
+    }
+  }
+  ids.sort((a, b) => a === b ? 0 : a < b ? -1 : 1);
+  for (let i = 0; i < ids.length; ++i) {
+    const a = ids[i];
+    for (let j = i + 1; j < ids.length; ++j) {
+      const b = ids[j];
+      if (!pairs.has(toKey([a, b]))) {
+        r.push({ sets: [a, b], size: 0 });
+      }
+    }
+  }
+  return r;
+}
+function getDistanceMatrices(areas, sets, setids) {
+  const distances = zerosM(sets.length, sets.length);
+  const constraints = zerosM(sets.length, sets.length);
+  areas.filter((x) => x.sets.length === 2).forEach((current) => {
+    const left = setids[current.sets[0]];
+    const right = setids[current.sets[1]];
+    const r1 = Math.sqrt(sets[left].size / Math.PI);
+    const r2 = Math.sqrt(sets[right].size / Math.PI);
+    const distance2 = distanceFromIntersectArea(r1, r2, current.size);
+    distances[left][right] = distances[right][left] = distance2;
+    let c = 0;
+    if (current.size + 1e-10 >= Math.min(sets[left].size, sets[right].size)) {
+      c = 1;
+    } else if (current.size <= 1e-10) {
+      c = -1;
+    }
+    constraints[left][right] = constraints[right][left] = c;
+  });
+  return { distances, constraints };
+}
+function constrainedMDSGradient(x, fxprime, distances, constraints) {
+  for (let i = 0; i < fxprime.length; ++i) {
+    fxprime[i] = 0;
+  }
+  let loss = 0;
+  for (let i = 0; i < distances.length; ++i) {
+    const xi = x[2 * i];
+    const yi = x[2 * i + 1];
+    for (let j = i + 1; j < distances.length; ++j) {
+      const xj = x[2 * j];
+      const yj = x[2 * j + 1];
+      const dij = distances[i][j];
+      const constraint = constraints[i][j];
+      const squaredDistance = (xj - xi) * (xj - xi) + (yj - yi) * (yj - yi);
+      const distance2 = Math.sqrt(squaredDistance);
+      const delta = squaredDistance - dij * dij;
+      if (constraint > 0 && distance2 <= dij || constraint < 0 && distance2 >= dij) {
+        continue;
+      }
+      loss += 2 * delta * delta;
+      fxprime[2 * i] += 4 * delta * (xi - xj);
+      fxprime[2 * i + 1] += 4 * delta * (yi - yj);
+      fxprime[2 * j] += 4 * delta * (xj - xi);
+      fxprime[2 * j + 1] += 4 * delta * (yj - yi);
+    }
+  }
+  return loss;
+}
+function bestInitialLayout(areas, params = {}) {
+  let initial = greedyLayout(areas, params);
+  const loss = params.lossFunction || lossFunction;
+  if (areas.length >= 8) {
+    const constrained = constrainedMDSLayout(areas, params);
+    const constrainedLoss = loss(constrained, areas);
+    const greedyLoss = loss(initial, areas);
+    if (constrainedLoss + 1e-8 < greedyLoss) {
+      initial = constrained;
+    }
+  }
+  return initial;
+}
+function constrainedMDSLayout(areas, params = {}) {
+  const restarts = params.restarts || 10;
+  const sets = [];
+  const setids = {};
+  for (const area of areas) {
+    if (area.sets.length === 1) {
+      setids[area.sets[0]] = sets.length;
+      sets.push(area);
+    }
+  }
+  let { distances, constraints } = getDistanceMatrices(areas, sets, setids);
+  const norm = norm2(distances.map(norm2)) / distances.length;
+  distances = distances.map((row) => row.map((value) => value / norm));
+  const obj = (x, fxprime) => constrainedMDSGradient(x, fxprime, distances, constraints);
+  let best = null;
+  for (let i = 0; i < restarts; ++i) {
+    const initial = zeros(distances.length * 2).map(Math.random);
+    const current = conjugateGradient(obj, initial, params);
+    if (!best || current.fx < best.fx) {
+      best = current;
+    }
+  }
+  const positions = best.x;
+  const circles = {};
+  for (let i = 0; i < sets.length; ++i) {
+    const set = sets[i];
+    circles[set.sets[0]] = {
+      x: positions[2 * i] * norm,
+      y: positions[2 * i + 1] * norm,
+      radius: Math.sqrt(set.size / Math.PI)
+    };
+  }
+  if (params.history) {
+    for (const h of params.history) {
+      scale(h.x, norm);
+    }
+  }
+  return circles;
+}
+function greedyLayout(areas, params) {
+  const loss = params && params.lossFunction ? params.lossFunction : lossFunction;
+  const circles = {};
+  const setOverlaps = {};
+  for (const area of areas) {
+    if (area.sets.length === 1) {
+      const set = area.sets[0];
+      circles[set] = {
+        x: 1e10,
+        y: 1e10,
+        rowid: circles.length,
+        size: area.size,
+        radius: Math.sqrt(area.size / Math.PI)
+      };
+      setOverlaps[set] = [];
+    }
+  }
+  areas = areas.filter((a) => a.sets.length === 2);
+  for (const current of areas) {
+    let weight = current.weight != null ? current.weight : 1;
+    const left = current.sets[0];
+    const right = current.sets[1];
+    if (current.size + SMALL >= Math.min(circles[left].size, circles[right].size)) {
+      weight = 0;
+    }
+    setOverlaps[left].push({ set: right, size: current.size, weight });
+    setOverlaps[right].push({ set: left, size: current.size, weight });
+  }
+  const mostOverlapped = [];
+  Object.keys(setOverlaps).forEach((set) => {
+    let size = 0;
+    for (let i = 0; i < setOverlaps[set].length; ++i) {
+      size += setOverlaps[set][i].size * setOverlaps[set][i].weight;
+    }
+    mostOverlapped.push({ set, size });
+  });
+  function sortOrder(a, b) {
+    return b.size - a.size;
+  }
+  mostOverlapped.sort(sortOrder);
+  const positioned = {};
+  function isPositioned(element) {
+    return element.set in positioned;
+  }
+  function positionSet(point, index) {
+    circles[index].x = point.x;
+    circles[index].y = point.y;
+    positioned[index] = true;
+  }
+  positionSet({ x: 0, y: 0 }, mostOverlapped[0].set);
+  for (let i = 1; i < mostOverlapped.length; ++i) {
+    const setIndex = mostOverlapped[i].set;
+    const overlap = setOverlaps[setIndex].filter(isPositioned);
+    const set = circles[setIndex];
+    overlap.sort(sortOrder);
+    if (overlap.length === 0) {
+      throw "ERROR: missing pairwise overlap information";
+    }
+    const points = [];
+    for (var j = 0; j < overlap.length; ++j) {
+      const p1 = circles[overlap[j].set];
+      const d1 = distanceFromIntersectArea(set.radius, p1.radius, overlap[j].size);
+      points.push({ x: p1.x + d1, y: p1.y });
+      points.push({ x: p1.x - d1, y: p1.y });
+      points.push({ y: p1.y + d1, x: p1.x });
+      points.push({ y: p1.y - d1, x: p1.x });
+      for (let k = j + 1; k < overlap.length; ++k) {
+        const p2 = circles[overlap[k].set];
+        const d2 = distanceFromIntersectArea(set.radius, p2.radius, overlap[k].size);
+        const extraPoints = circleCircleIntersection(
+          { x: p1.x, y: p1.y, radius: d1 },
+          { x: p2.x, y: p2.y, radius: d2 }
+        );
+        points.push(...extraPoints);
+      }
+    }
+    let bestLoss = 1e50;
+    let bestPoint = points[0];
+    for (const point of points) {
+      circles[setIndex].x = point.x;
+      circles[setIndex].y = point.y;
+      const localLoss = loss(circles, areas);
+      if (localLoss < bestLoss) {
+        bestLoss = localLoss;
+        bestPoint = point;
+      }
+    }
+    positionSet(bestPoint, setIndex);
+  }
+  return circles;
+}
+function lossFunction(circles, overlaps) {
+  let output = 0;
+  for (const area of overlaps) {
+    if (area.sets.length === 1) {
+      continue;
+    }
+    let overlap;
+    if (area.sets.length === 2) {
+      const left = circles[area.sets[0]];
+      const right = circles[area.sets[1]];
+      overlap = circleOverlap(left.radius, right.radius, distance(left, right));
+    } else {
+      overlap = intersectionArea(area.sets.map((d) => circles[d]));
+    }
+    const weight = area.weight != null ? area.weight : 1;
+    output += weight * (overlap - area.size) * (overlap - area.size);
+  }
+  return output;
+}
+function logRatioLossFunction(circles, overlaps) {
+  let output = 0;
+  for (const area of overlaps) {
+    if (area.sets.length === 1) {
+      continue;
+    }
+    let overlap;
+    if (area.sets.length === 2) {
+      const left = circles[area.sets[0]];
+      const right = circles[area.sets[1]];
+      overlap = circleOverlap(left.radius, right.radius, distance(left, right));
+    } else {
+      overlap = intersectionArea(area.sets.map((d) => circles[d]));
+    }
+    const weight = area.weight != null ? area.weight : 1;
+    const differenceFromIdeal = Math.log((overlap + 1) / (area.size + 1));
+    output += weight * differenceFromIdeal * differenceFromIdeal;
+  }
+  return output;
+}
+function orientateCircles(circles, orientation, orientationOrder) {
+  if (orientationOrder == null) {
+    circles.sort((a, b) => b.radius - a.radius);
+  } else {
+    circles.sort(orientationOrder);
+  }
+  if (circles.length > 0) {
+    const largestX = circles[0].x;
+    const largestY = circles[0].y;
+    for (const circle of circles) {
+      circle.x -= largestX;
+      circle.y -= largestY;
+    }
+  }
+  if (circles.length === 2) {
+    const dist = distance(circles[0], circles[1]);
+    if (dist < Math.abs(circles[1].radius - circles[0].radius)) {
+      circles[1].x = circles[0].x + circles[0].radius - circles[1].radius - 1e-10;
+      circles[1].y = circles[0].y;
+    }
+  }
+  if (circles.length > 1) {
+    const rotation = Math.atan2(circles[1].x, circles[1].y) - orientation;
+    const c = Math.cos(rotation);
+    const s = Math.sin(rotation);
+    for (const circle of circles) {
+      const x = circle.x;
+      const y = circle.y;
+      circle.x = c * x - s * y;
+      circle.y = s * x + c * y;
+    }
+  }
+  if (circles.length > 2) {
+    let angle = Math.atan2(circles[2].x, circles[2].y) - orientation;
+    while (angle < 0) {
+      angle += 2 * Math.PI;
+    }
+    while (angle > 2 * Math.PI) {
+      angle -= 2 * Math.PI;
+    }
+    if (angle > Math.PI) {
+      const slope = circles[1].y / (1e-10 + circles[1].x);
+      for (const circle of circles) {
+        var d = (circle.x + slope * circle.y) / (1 + slope * slope);
+        circle.x = 2 * d - circle.x;
+        circle.y = 2 * d * slope - circle.y;
+      }
+    }
+  }
+}
+function disjointCluster(circles) {
+  circles.forEach((circle) => {
+    circle.parent = circle;
+  });
+  function find(circle) {
+    if (circle.parent !== circle) {
+      circle.parent = find(circle.parent);
+    }
+    return circle.parent;
+  }
+  function union(x, y) {
+    const xRoot = find(x);
+    const yRoot = find(y);
+    xRoot.parent = yRoot;
+  }
+  for (let i = 0; i < circles.length; ++i) {
+    for (let j = i + 1; j < circles.length; ++j) {
+      const maxDistance = circles[i].radius + circles[j].radius;
+      if (distance(circles[i], circles[j]) + 1e-10 < maxDistance) {
+        union(circles[j], circles[i]);
+      }
+    }
+  }
+  const disjointClusters = /* @__PURE__ */ new Map();
+  for (let i = 0; i < circles.length; ++i) {
+    const setid = find(circles[i]).parent.setid;
+    if (!disjointClusters.has(setid)) {
+      disjointClusters.set(setid, []);
+    }
+    disjointClusters.get(setid).push(circles[i]);
+  }
+  circles.forEach((circle) => {
+    delete circle.parent;
+  });
+  return Array.from(disjointClusters.values());
+}
+function getBoundingBox(circles) {
+  const minMax = (d) => {
+    const hi = circles.reduce((acc, c) => Math.max(acc, c[d] + c.radius), Number.NEGATIVE_INFINITY);
+    const lo = circles.reduce((acc, c) => Math.min(acc, c[d] - c.radius), Number.POSITIVE_INFINITY);
+    return { max: hi, min: lo };
+  };
+  return { xRange: minMax("x"), yRange: minMax("y") };
+}
+function normalizeSolution(solution, orientation, orientationOrder) {
+  if (orientation == null) {
+    orientation = Math.PI / 2;
+  }
+  let circles = fromObjectNotation(solution).map((d) => Object.assign({}, d));
+  const clusters = disjointCluster(circles);
+  for (const cluster of clusters) {
+    orientateCircles(cluster, orientation, orientationOrder);
+    const bounds = getBoundingBox(cluster);
+    cluster.size = (bounds.xRange.max - bounds.xRange.min) * (bounds.yRange.max - bounds.yRange.min);
+    cluster.bounds = bounds;
+  }
+  clusters.sort((a, b) => b.size - a.size);
+  circles = clusters[0];
+  let returnBounds = circles.bounds;
+  const spacing = (returnBounds.xRange.max - returnBounds.xRange.min) / 50;
+  function addCluster(cluster, right, bottom) {
+    if (!cluster) {
+      return;
+    }
+    const bounds = cluster.bounds;
+    let xOffset;
+    let yOffset;
+    if (right) {
+      xOffset = returnBounds.xRange.max - bounds.xRange.min + spacing;
+    } else {
+      xOffset = returnBounds.xRange.max - bounds.xRange.max;
+      const centreing = (bounds.xRange.max - bounds.xRange.min) / 2 - (returnBounds.xRange.max - returnBounds.xRange.min) / 2;
+      if (centreing < 0) {
+        xOffset += centreing;
+      }
+    }
+    if (bottom) {
+      yOffset = returnBounds.yRange.max - bounds.yRange.min + spacing;
+    } else {
+      yOffset = returnBounds.yRange.max - bounds.yRange.max;
+      const centreing = (bounds.yRange.max - bounds.yRange.min) / 2 - (returnBounds.yRange.max - returnBounds.yRange.min) / 2;
+      if (centreing < 0) {
+        yOffset += centreing;
+      }
+    }
+    for (const c of cluster) {
+      c.x += xOffset;
+      c.y += yOffset;
+      circles.push(c);
+    }
+  }
+  let index = 1;
+  while (index < clusters.length) {
+    addCluster(clusters[index], true, false);
+    addCluster(clusters[index + 1], false, true);
+    addCluster(clusters[index + 2], true, true);
+    index += 3;
+    returnBounds = getBoundingBox(circles);
+  }
+  return toObjectNotation(circles);
+}
+function scaleSolution(solution, width, height, padding, scaleToFit) {
+  const circles = fromObjectNotation(solution);
+  width -= 2 * padding;
+  height -= 2 * padding;
+  const { xRange, yRange } = getBoundingBox(circles);
+  if (xRange.max === xRange.min || yRange.max === yRange.min) {
+    console.log("not scaling solution: zero size detected");
+    return solution;
+  }
+  let xScaling;
+  let yScaling;
+  if (scaleToFit) {
+    const toScaleDiameter = Math.sqrt(scaleToFit / Math.PI) * 2;
+    xScaling = width / toScaleDiameter;
+    yScaling = height / toScaleDiameter;
+  } else {
+    xScaling = width / (xRange.max - xRange.min);
+    yScaling = height / (yRange.max - yRange.min);
+  }
+  const scaling = Math.min(yScaling, xScaling);
+  const xOffset = (width - (xRange.max - xRange.min) * scaling) / 2;
+  const yOffset = (height - (yRange.max - yRange.min) * scaling) / 2;
+  return toObjectNotation(
+    circles.map((circle) => ({
+      radius: scaling * circle.radius,
+      x: padding + xOffset + (circle.x - xRange.min) * scaling,
+      y: padding + yOffset + (circle.y - yRange.min) * scaling,
+      setid: circle.setid
+    }))
+  );
+}
+function toObjectNotation(circles) {
+  const r = {};
+  for (const circle of circles) {
+    r[circle.setid] = circle;
+  }
+  return r;
+}
+function fromObjectNotation(solution) {
+  const setids = Object.keys(solution);
+  return setids.map((id) => Object.assign(solution[id], { setid: id }));
+}
+function VennDiagram(options = {}) {
+  let useViewBox = false, width = 600, height = 350, padding = 15, duration = 1e3, orientation = Math.PI / 2, normalize = true, scaleToFit = null, wrap = true, styled = true, fontSize = null, orientationOrder = null, distinct = false, round = null, symmetricalTextCentre = options && options.symmetricalTextCentre ? options.symmetricalTextCentre : false, colourMap = {}, colourScheme = options && options.colourScheme ? options.colourScheme : options && options.colorScheme ? options.colorScheme : [
+    "#1f77b4",
+    "#ff7f0e",
+    "#2ca02c",
+    "#d62728",
+    "#9467bd",
+    "#8c564b",
+    "#e377c2",
+    "#7f7f7f",
+    "#bcbd22",
+    "#17becf"
+  ], colourIndex = 0, colours = function(key) {
+    if (key in colourMap) {
+      return colourMap[key];
+    }
+    var ret = colourMap[key] = colourScheme[colourIndex];
+    colourIndex += 1;
+    if (colourIndex >= colourScheme.length) {
+      colourIndex = 0;
+    }
+    return ret;
+  }, layoutFunction = venn, loss = lossFunction;
+  function chart(selection) {
+    let data = selection.datum();
+    const toRemove = /* @__PURE__ */ new Set();
+    data.forEach((datum) => {
+      if (datum.size == 0 && datum.sets.length == 1) {
+        toRemove.add(datum.sets[0]);
+      }
+    });
+    data = data.filter((datum) => !datum.sets.some((set) => toRemove.has(set)));
+    let circles = {};
+    let textCentres = {};
+    if (data.length > 0) {
+      let solution = layoutFunction(data, { lossFunction: loss, distinct });
+      if (normalize) {
+        solution = normalizeSolution(solution, orientation, orientationOrder);
+      }
+      circles = scaleSolution(solution, width, height, padding, scaleToFit);
+      textCentres = computeTextCentres(circles, data, symmetricalTextCentre);
+    }
+    const labels = {};
+    data.forEach((datum) => {
+      if (datum.label) {
+        labels[datum.sets] = datum.label;
+      }
+    });
+    function label(d) {
+      if (d.sets in labels) {
+        return labels[d.sets];
+      }
+      if (d.sets.length == 1) {
+        return "" + d.sets[0];
+      }
+    }
+    selection.selectAll("svg").data([circles]).enter().append("svg");
+    const svg = selection.select("svg");
+    if (useViewBox) {
+      svg.attr("viewBox", `0 0 ${width} ${height}`);
+    } else {
+      svg.attr("width", width).attr("height", height);
+    }
+    const previous = {};
+    let hasPrevious = false;
+    svg.selectAll(".venn-area path").each(function(d) {
+      const path = this.getAttribute("d");
+      if (d.sets.length == 1 && path && !distinct) {
+        hasPrevious = true;
+        previous[d.sets[0]] = circleFromPath(path);
+      }
+    });
+    function pathTween(d) {
+      return (t) => {
+        const c = d.sets.map((set) => {
+          let start = previous[set];
+          let end = circles[set];
+          if (!start) {
+            start = { x: width / 2, y: height / 2, radius: 1 };
+          }
+          if (!end) {
+            end = { x: width / 2, y: height / 2, radius: 1 };
+          }
+          return {
+            x: start.x * (1 - t) + end.x * t,
+            y: start.y * (1 - t) + end.y * t,
+            radius: start.radius * (1 - t) + end.radius * t
+          };
+        });
+        return intersectionAreaPath(c, round);
+      };
+    }
+    const nodes = svg.selectAll(".venn-area").data(data, (d) => d.sets);
+    const enter = nodes.enter().append("g").attr(
+      "class",
+      (d) => `venn-area venn-${d.sets.length == 1 ? "circle" : "intersection"}${d.colour || d.color ? " venn-coloured" : ""}`
+    ).attr("data-venn-sets", (d) => d.sets.join("_"));
+    const enterPath = enter.append("path");
+    const enterText = enter.append("text").attr("class", "label").text((d) => label(d)).attr("text-anchor", "middle").attr("dy", ".35em").attr("x", width / 2).attr("y", height / 2);
+    if (styled) {
+      enterPath.style("fill-opacity", "0").filter((d) => d.sets.length == 1).style("fill", (d) => d.colour ? d.colour : d.color ? d.color : colours(d.sets)).style("fill-opacity", ".25");
+      enterText.style("fill", (d) => {
+        if (d.colour || d.color) {
+          return "#FFF";
+        }
+        if (options.textFill) {
+          return options.textFill;
+        }
+        return d.sets.length == 1 ? colours(d.sets) : "#444";
+      });
+    }
+    function asTransition(s) {
+      if (typeof s.transition === "function") {
+        return s.transition("venn").duration(duration);
+      }
+      return s;
+    }
+    let update = selection;
+    if (hasPrevious && typeof update.transition === "function") {
+      update = asTransition(selection);
+      update.selectAll("path").attrTween("d", pathTween);
+    } else {
+      update.selectAll("path").attr("d", (d) => intersectionAreaPath(d.sets.map((set) => circles[set])), round);
+    }
+    const updateText = update.selectAll("text").filter((d) => d.sets in textCentres).text((d) => label(d)).attr("x", (d) => Math.floor(textCentres[d.sets].x)).attr("y", (d) => Math.floor(textCentres[d.sets].y));
+    if (wrap) {
+      if (hasPrevious) {
+        if ("on" in updateText) {
+          updateText.on("end", wrapText(circles, label));
+        } else {
+          updateText.each("end", wrapText(circles, label));
+        }
+      } else {
+        updateText.each(wrapText(circles, label));
+      }
+    }
+    const exit = asTransition(nodes.exit()).remove();
+    if (typeof nodes.transition === "function") {
+      exit.selectAll("path").attrTween("d", pathTween);
+    }
+    const exitText = exit.selectAll("text").attr("x", width / 2).attr("y", height / 2);
+    if (fontSize !== null) {
+      enterText.style("font-size", "0px");
+      updateText.style("font-size", fontSize);
+      exitText.style("font-size", "0px");
+    }
+    return { circles, textCentres, nodes, enter, update, exit };
+  }
+  chart.wrap = function(_) {
+    if (!arguments.length) return wrap;
+    wrap = _;
+    return chart;
+  };
+  chart.useViewBox = function() {
+    useViewBox = true;
+    return chart;
+  };
+  chart.width = function(_) {
+    if (!arguments.length) return width;
+    width = _;
+    return chart;
+  };
+  chart.height = function(_) {
+    if (!arguments.length) return height;
+    height = _;
+    return chart;
+  };
+  chart.padding = function(_) {
+    if (!arguments.length) return padding;
+    padding = _;
+    return chart;
+  };
+  chart.distinct = function(_) {
+    if (!arguments.length) return distinct;
+    distinct = _;
+    return chart;
+  };
+  chart.colours = function(_) {
+    if (!arguments.length) return colours;
+    colours = _;
+    return chart;
+  };
+  chart.colors = function(_) {
+    if (!arguments.length) return colours;
+    colours = _;
+    return chart;
+  };
+  chart.fontSize = function(_) {
+    if (!arguments.length) return fontSize;
+    fontSize = _;
+    return chart;
+  };
+  chart.round = function(_) {
+    if (!arguments.length) return round;
+    round = _;
+    return chart;
+  };
+  chart.duration = function(_) {
+    if (!arguments.length) return duration;
+    duration = _;
+    return chart;
+  };
+  chart.layoutFunction = function(_) {
+    if (!arguments.length) return layoutFunction;
+    layoutFunction = _;
+    return chart;
+  };
+  chart.normalize = function(_) {
+    if (!arguments.length) return normalize;
+    normalize = _;
+    return chart;
+  };
+  chart.scaleToFit = function(_) {
+    if (!arguments.length) return scaleToFit;
+    scaleToFit = _;
+    return chart;
+  };
+  chart.styled = function(_) {
+    if (!arguments.length) return styled;
+    styled = _;
+    return chart;
+  };
+  chart.orientation = function(_) {
+    if (!arguments.length) return orientation;
+    orientation = _;
+    return chart;
+  };
+  chart.orientationOrder = function(_) {
+    if (!arguments.length) return orientationOrder;
+    orientationOrder = _;
+    return chart;
+  };
+  chart.lossFunction = function(_) {
+    if (!arguments.length) return loss;
+    loss = _ === "default" ? lossFunction : _ === "logRatio" ? logRatioLossFunction : _;
+    return chart;
+  };
+  return chart;
+}
+function wrapText(circles, labeller) {
+  return function(data) {
+    const text = this;
+    const width = circles[data.sets[0]].radius || 50;
+    const label = labeller(data) || "";
+    const words = label.split(/\s+/).reverse();
+    const maxLines = 3;
+    const minChars = (label.length + words.length) / maxLines;
+    let word = words.pop();
+    let line = [word];
+    let lineNumber = 0;
+    const lineHeight = 1.1;
+    text.textContent = null;
+    const tspans = [];
+    function append(word2) {
+      const tspan2 = text.ownerDocument.createElementNS(text.namespaceURI, "tspan");
+      tspan2.textContent = word2;
+      tspans.push(tspan2);
+      text.append(tspan2);
+      return tspan2;
+    }
+    let tspan = append(word);
+    while (true) {
+      word = words.pop();
+      if (!word) {
+        break;
+      }
+      line.push(word);
+      const joined = line.join(" ");
+      tspan.textContent = joined;
+      if (joined.length > minChars && tspan.getComputedTextLength() > width) {
+        line.pop();
+        tspan.textContent = line.join(" ");
+        line = [word];
+        tspan = append(word);
+        lineNumber++;
+      }
+    }
+    const initial = 0.35 - lineNumber * lineHeight / 2;
+    const x = text.getAttribute("x");
+    const y = text.getAttribute("y");
+    tspans.forEach((t, i) => {
+      t.setAttribute("x", x);
+      t.setAttribute("y", y);
+      t.setAttribute("dy", `${initial + i * lineHeight}em`);
+    });
+  };
+}
+function circleMargin(current, interior, exterior) {
+  let margin = interior[0].radius - distance(interior[0], current);
+  for (let i = 1; i < interior.length; ++i) {
+    const m = interior[i].radius - distance(interior[i], current);
+    if (m <= margin) {
+      margin = m;
+    }
+  }
+  for (let i = 0; i < exterior.length; ++i) {
+    const m = distance(exterior[i], current) - exterior[i].radius;
+    if (m <= margin) {
+      margin = m;
+    }
+  }
+  return margin;
+}
+function computeTextCentre(interior, exterior, symmetricalTextCentre) {
+  const points = [];
+  for (const c of interior) {
+    points.push({ x: c.x, y: c.y });
+    points.push({ x: c.x + c.radius / 2, y: c.y });
+    points.push({ x: c.x - c.radius / 2, y: c.y });
+    points.push({ x: c.x, y: c.y + c.radius / 2 });
+    points.push({ x: c.x, y: c.y - c.radius / 2 });
+  }
+  let initial = points[0];
+  let margin = circleMargin(points[0], interior, exterior);
+  for (let i = 1; i < points.length; ++i) {
+    const m = circleMargin(points[i], interior, exterior);
+    if (m >= margin) {
+      initial = points[i];
+      margin = m;
+    }
+  }
+  const solution = nelderMead(
+    (p) => -1 * circleMargin({ x: p[0], y: p[1] }, interior, exterior),
+    [initial.x, initial.y],
+    { maxIterations: 500, minErrorDelta: 1e-10 }
+  ).x;
+  const ret = { x: symmetricalTextCentre ? 0 : solution[0], y: solution[1] };
+  let valid = true;
+  for (const i of interior) {
+    if (distance(ret, i) > i.radius) {
+      valid = false;
+      break;
+    }
+  }
+  for (const e of exterior) {
+    if (distance(ret, e) < e.radius) {
+      valid = false;
+      break;
+    }
+  }
+  if (valid) {
+    return ret;
+  }
+  if (interior.length == 1) {
+    return { x: interior[0].x, y: interior[0].y };
+  }
+  const areaStats = {};
+  intersectionArea(interior, areaStats);
+  if (areaStats.arcs.length === 0) {
+    return { x: 0, y: -1e3, disjoint: true };
+  }
+  if (areaStats.arcs.length == 1) {
+    return { x: areaStats.arcs[0].circle.x, y: areaStats.arcs[0].circle.y };
+  }
+  if (exterior.length) {
+    return computeTextCentre(interior, []);
+  }
+  return getCenter(areaStats.arcs.map((a) => a.p1));
+}
+function getOverlappingCircles(circles) {
+  const ret = {};
+  const circleids = Object.keys(circles);
+  for (const circleid of circleids) {
+    ret[circleid] = [];
+  }
+  for (let i = 0; i < circleids.length; i++) {
+    const ci = circleids[i];
+    const a = circles[ci];
+    for (let j = i + 1; j < circleids.length; ++j) {
+      const cj = circleids[j];
+      const b = circles[cj];
+      const d = distance(a, b);
+      if (d + b.radius <= a.radius + 1e-10) {
+        ret[cj].push(ci);
+      } else if (d + a.radius <= b.radius + 1e-10) {
+        ret[ci].push(cj);
+      }
+    }
+  }
+  return ret;
+}
+function computeTextCentres(circles, areas, symmetricalTextCentre) {
+  const ret = {};
+  const overlapped = getOverlappingCircles(circles);
+  for (let i = 0; i < areas.length; ++i) {
+    const area = areas[i].sets;
+    const areaids = {};
+    const exclude = {};
+    for (let j = 0; j < area.length; ++j) {
+      areaids[area[j]] = true;
+      const overlaps = overlapped[area[j]];
+      for (let k = 0; k < overlaps.length; ++k) {
+        exclude[overlaps[k]] = true;
+      }
+    }
+    const interior = [];
+    const exterior = [];
+    for (let setid in circles) {
+      if (setid in areaids) {
+        interior.push(circles[setid]);
+      } else if (!(setid in exclude)) {
+        exterior.push(circles[setid]);
+      }
+    }
+    const centre = computeTextCentre(interior, exterior, symmetricalTextCentre);
+    ret[area] = centre;
+    if (centre.disjoint && areas[i].size > 0) {
+      console.log("WARNING: area " + area + " not represented on screen");
+    }
+  }
+  return ret;
+}
+function circlePath(x, y, r) {
+  const ret = [];
+  ret.push("\nM", x, y);
+  ret.push("\nm", -r, 0);
+  ret.push("\na", r, r, 0, 1, 0, r * 2, 0);
+  ret.push("\na", r, r, 0, 1, 0, -r * 2, 0);
+  return ret.join(" ");
+}
+function circleFromPath(path) {
+  const tokens = path.split(" ");
+  return { x: Number.parseFloat(tokens[1]), y: Number.parseFloat(tokens[2]), radius: -Number.parseFloat(tokens[4]) };
+}
+function intersectionAreaArcs(circles) {
+  if (circles.length === 0) {
+    return [];
+  }
+  const stats = {};
+  intersectionArea(circles, stats);
+  return stats.arcs;
+}
+function arcsToPath(arcs, round) {
+  if (arcs.length === 0) {
+    return "M 0 0";
+  }
+  const rFactor = Math.pow(10, round || 0);
+  const r = round != null ? (v) => Math.round(v * rFactor) / rFactor : (v) => v;
+  if (arcs.length == 1) {
+    const circle = arcs[0].circle;
+    return circlePath(r(circle.x), r(circle.y), r(circle.radius));
+  }
+  const ret = ["\nM", r(arcs[0].p2.x), r(arcs[0].p2.y)];
+  for (const arc of arcs) {
+    const radius = r(arc.circle.radius);
+    ret.push("\nA", radius, radius, 0, arc.large ? 1 : 0, arc.sweep ? 1 : 0, r(arc.p1.x), r(arc.p1.y));
+  }
+  return ret.join(" ");
+}
+function intersectionAreaPath(circles, round) {
+  return arcsToPath(intersectionAreaArcs(circles), round);
+}
+function layout(data, options = {}) {
+  const {
+    lossFunction: loss,
+    layoutFunction: layout2 = venn,
+    normalize = true,
+    orientation = Math.PI / 2,
+    orientationOrder,
+    width = 600,
+    height = 350,
+    padding = 15,
+    scaleToFit = false,
+    symmetricalTextCentre = false,
+    distinct,
+    round = 2
+  } = options;
+  let solution = layout2(data, {
+    lossFunction: loss === "default" || !loss ? lossFunction : loss === "logRatio" ? logRatioLossFunction : loss,
+    distinct
+  });
+  if (normalize) {
+    solution = normalizeSolution(solution, orientation, orientationOrder);
+  }
+  const circles = scaleSolution(solution, width, height, padding, scaleToFit);
+  const textCentres = computeTextCentres(circles, data, symmetricalTextCentre);
+  const circleLookup = new Map(
+    Object.keys(circles).map((set) => [
+      set,
+      {
+        set,
+        x: circles[set].x,
+        y: circles[set].y,
+        radius: circles[set].radius
+      }
+    ])
+  );
+  const helpers = data.map((area) => {
+    const circles2 = area.sets.map((s) => circleLookup.get(s));
+    const arcs = intersectionAreaArcs(circles2);
+    const path = arcsToPath(arcs, round);
+    return { circles: circles2, arcs, path, area, has: new Set(area.sets) };
+  });
+  function genDistinctPath(sets) {
+    let r = "";
+    for (const e of helpers) {
+      if (e.has.size > sets.length && sets.every((s) => e.has.has(s))) {
+        r += " " + e.path;
+      }
+    }
+    return r;
+  }
+  return helpers.map(({ circles: circles2, arcs, path, area }) => {
+    return {
+      data: area,
+      text: textCentres[area.sets],
+      circles: circles2,
+      arcs,
+      path,
+      distinctPath: path + genDistinctPath(area.sets)
+    };
+  });
+}
+export {
+  VennDiagram,
+  bestInitialLayout,
+  circleArea,
+  circleCircleIntersection,
+  circleFromPath,
+  circleOverlap,
+  circlePath,
+  computeTextCentre,
+  computeTextCentres,
+  disjointCluster,
+  distance,
+  distanceFromIntersectArea,
+  greedyLayout,
+  intersectionArea,
+  intersectionAreaPath,
+  layout,
+  logRatioLossFunction,
+  lossFunction,
+  normalizeSolution,
+  scaleSolution,
+  venn,
+  wrapText
+};