minerva-design 1.4.0 → 1.6.0

package/dist/charts/engine/graph/geometry.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"geometry.cjs","names":["cubicPoints","length","x1","x0","y1","y0","x2","y2","x3","y3","segments","i","t","u","a","b","c","d","out","quadraticPath","cx","cy","splinePath","points","vertical","my","mx","corner","px","py","inLen","outLen","nx","ny","r","radius","ax","ay","bx","by","orthogonalPath","corners","roundCorners","last","arcPath","from","to","y","rise","loopPath","open","wide","reach","start","end","size","a0","angle","a1","x","pathLength","trimPath","total","p","pointAt","startPoint","endPoint","walked","dx","dy","l","distance","k","endDirection","boundaryDistance","box","width","ux","uy","tx","ty","height","arrowHead","w","lx","ly","rx","ry","gap","triangleArea","y13","arrowCorners","filledArrow","fill","outline","dashPath","period","dash","space","distanceToPath","best","qx","qy"],"sources":["../../../../../charts/src/engine/graph/geometry.ts"],"sourcesContent":["// Edge geometry in layout units: curves sampled into polylines, trimming at\n// the node boundaries, arrowheads and dashes. Polylines are flat\n// `[x0, y0, x1, y1, …]` arrays.\n\n/** Points of a cubic Bézier (the start point excluded) */\nexport const cubicPoints = (\n  out: number[],\n  x0: number,\n  y0: number,\n  x1: number,\n  y1: number,\n  x2: number,\n  y2: number,\n  x3: number,\n  y3: number,\n): void => {\n  const length =\n    Math.hypot(x1 - x0, y1 - y0) +\n    Math.hypot(x2 - x1, y2 - y1) +\n    Math.hypot(x3 - x2, y3 - y2);\n  const segments = Math.max(4, Math.min(28, Math.ceil(length / 10)));\n  for (let i = 1; i <= segments; i++) {\n    const t = i / segments;\n    const u = 1 - t;\n    const a = u * u * u;\n    const b = 3 * u * u * t;\n    const c = 3 * u * t * t;\n    const d = t * t * t;\n    out.push(\n      a * x0 + b * x1 + c * x2 + d * x3,\n      a * y0 + b * y1 + c * y2 + d * y3,\n    );\n  }\n};\n\n/** Points of a quadratic Bézier (the start point included) */\nexport const quadraticPath = (\n  x0: number,\n  y0: number,\n  cx: number,\n  cy: number,\n  x1: number,\n  y1: number,\n): number[] => {\n  const out = [x0, y0];\n  cubicPoints(\n    out,\n    x0,\n    y0,\n    x0 + ((cx - x0) * 2) / 3,\n    y0 + ((cy - y0) * 2) / 3,\n    x1 + ((cx - x1) * 2) / 3,\n    y1 + ((cy - y1) * 2) / 3,\n    x1,\n    y1,\n  );\n  return out;\n};\n\n/**\n * Smooth path through waypoints whose tangents follow the flow axis\n * (vertical for top → bottom layouts): C1 at every waypoint\n */\nexport const splinePath = (\n  points: readonly number[],\n  vertical: boolean,\n): number[] => {\n  const out = [points[0], points[1]];\n  for (let i = 2; i < points.length; i += 2) {\n    const x0 = points[i - 2];\n    const y0 = points[i - 1];\n    const x1 = points[i];\n    const y1 = points[i + 1];\n    if (vertical) {\n      const my = (y0 + y1) / 2;\n      cubicPoints(out, x0, y0, x0, my, x1, my, x1, y1);\n    } else {\n      const mx = (x0 + x1) / 2;\n      cubicPoints(out, x0, y0, mx, y0, mx, y1, x1, y1);\n    }\n  }\n  return out;\n};\n\n/** Rounded corner from the end of `out` through (cx, cy) towards (nx, ny) */\nconst corner = (\n  out: number[],\n  cx: number,\n  cy: number,\n  nx: number,\n  ny: number,\n  radius: number,\n) => {\n  const px = out[out.length - 2];\n  const py = out[out.length - 1];\n  const inLen = Math.hypot(cx - px, cy - py);\n  const outLen = Math.hypot(nx - cx, ny - cy);\n  const r = Math.min(radius, inLen / 2, outLen / 2);\n  if (r < 0.5) {\n    out.push(cx, cy);\n    return;\n  }\n  const ax = cx - ((cx - px) / inLen) * r;\n  const ay = cy - ((cy - py) / inLen) * r;\n  const bx = cx + ((nx - cx) / outLen) * r;\n  const by = cy + ((ny - cy) / outLen) * r;\n  out.push(ax, ay);\n  // quadratic arc around the corner\n  for (let i = 1; i <= 4; i++) {\n    const t = i / 4;\n    const u = 1 - t;\n    out.push(\n      u * u * ax + 2 * u * t * cx + t * t * bx,\n      u * u * ay + 2 * u * t * cy + t * t * by,\n    );\n  }\n};\n\n/**\n * Orthogonal path through waypoints: along the flow axis to the middle,\n * across, then along the axis again, with rounded corners\n */\nexport const orthogonalPath = (\n  points: readonly number[],\n  vertical: boolean,\n  radius: number,\n): number[] => {\n  const corners: number[] = [points[0], points[1]];\n  for (let i = 2; i < points.length; i += 2) {\n    const x0 = points[i - 2];\n    const y0 = points[i - 1];\n    const x1 = points[i];\n    const y1 = points[i + 1];\n    if (Math.abs(vertical ? x1 - x0 : y1 - y0) > 0.5) {\n      if (vertical) {\n        const my = (y0 + y1) / 2;\n        corners.push(x0, my, x1, my);\n      } else {\n        const mx = (x0 + x1) / 2;\n        corners.push(mx, y0, mx, y1);\n      }\n    }\n    corners.push(x1, y1);\n  }\n  return roundCorners(corners, radius);\n};\n\n/** Polyline with rounded corners */\nexport const roundCorners = (\n  corners: readonly number[],\n  radius: number,\n): number[] => {\n  const out = [corners[0], corners[1]];\n  const last = corners.length - 2;\n  for (let i = 2; i < last; i += 2) {\n    corner(\n      out,\n      corners[i],\n      corners[i + 1],\n      corners[i + 2],\n      corners[i + 3],\n      radius,\n    );\n  }\n  if (last >= 2) out.push(corners[last], corners[last + 1]);\n  return out;\n};\n\n/** Upper half circle between two points of the x axis (arc diagrams) */\nexport const arcPath = (\n  ax: number,\n  bx: number,\n  y: number,\n  rise = 1,\n): number[] => {\n  const cx = (ax + bx) / 2;\n  const r = Math.abs(bx - ax) / 2;\n  const segments = 2 * Math.max(4, Math.min(32, Math.ceil(r / 12)));\n  const out: number[] = [];\n  const from = ax < bx ? Math.PI : 0;\n  const to = ax < bx ? 0 : Math.PI;\n  for (let i = 0; i <= segments; i++) {\n    const a = from + ((to - from) * i) / segments;\n    out.push(cx + r * Math.cos(a), y - r * rise * Math.sin(a));\n  }\n  return out;\n};\n\n/**\n * Self-loop of a node at (x, y): a teardrop leaving the boundary at\n * `start` units from the center and coming back at `end` units, centered on\n * the direction `angle`, reaching about `size` units beyond the boundary\n */\nexport const loopPath = (\n  x: number,\n  y: number,\n  angle: number,\n  start: number,\n  end: number,\n  size: number,\n): number[] => {\n  const open = 0.42;\n  const wide = 0.8;\n  const reach = Math.max(start, end) + size * 2.2;\n  const a0 = angle - open;\n  const a1 = angle + open;\n  const out = [x + Math.cos(a0) * start, y + Math.sin(a0) * start];\n  cubicPoints(\n    out,\n    out[0],\n    out[1],\n    x + Math.cos(angle - wide) * reach,\n    y + Math.sin(angle - wide) * reach,\n    x + Math.cos(angle + wide) * reach,\n    y + Math.sin(angle + wide) * reach,\n    x + Math.cos(a1) * end,\n    y + Math.sin(a1) * end,\n  );\n  return out;\n};\n\n/** Length of a polyline */\nexport const pathLength = (points: readonly number[]): number => {\n  let length = 0;\n  for (let i = 2; i < points.length; i += 2)\n    length += Math.hypot(\n      points[i] - points[i - 2],\n      points[i + 1] - points[i - 1],\n    );\n  return length;\n};\n\n/** Removes `start` / `end` units from the ends of a polyline */\nexport const trimPath = (\n  points: number[],\n  start: number,\n  end: number,\n): number[] => {\n  const total = pathLength(points);\n  if (total <= start + end + 1e-6) {\n    // too short: a zero-length segment in the middle keeps the direction\n    if (points.length < 4) return points;\n    const t = start + end > 0 ? start / (start + end) : 0.5;\n    const p = pointAt(points, t * total);\n    return [p[0], p[1], p[0], p[1]];\n  }\n  const out: number[] = [];\n  const startPoint = pointAt(points, start);\n  const endPoint = pointAt(points, total - end);\n  out.push(startPoint[0], startPoint[1]);\n  let walked = 0;\n  for (let i = 2; i < points.length; i += 2) {\n    walked += Math.hypot(\n      points[i] - points[i - 2],\n      points[i + 1] - points[i - 1],\n    );\n    if (walked > start && walked < total - end)\n      out.push(points[i], points[i + 1]);\n  }\n  out.push(endPoint[0], endPoint[1]);\n  return out;\n};\n\n/** Point and direction at a distance along a polyline */\nexport const pointAt = (\n  points: readonly number[],\n  distance: number,\n): [number, number, number, number] => {\n  let walked = 0;\n  for (let i = 2; i < points.length; i += 2) {\n    const dx = points[i] - points[i - 2];\n    const dy = points[i + 1] - points[i - 1];\n    const l = Math.hypot(dx, dy);\n    if (walked + l >= distance && l > 0) {\n      const t = (distance - walked) / l;\n      return [points[i - 2] + dx * t, points[i - 1] + dy * t, dx / l, dy / l];\n    }\n    walked += l;\n  }\n  const k = points.length - 2;\n  const dx = k >= 2 ? points[k] - points[k - 2] : 1;\n  const dy = k >= 2 ? points[k + 1] - points[k - 1] : 0;\n  const l = Math.hypot(dx, dy) || 1;\n  return [points[k], points[k + 1], dx / l, dy / l];\n};\n\n/** Direction at the end of a polyline (unit vector) */\nexport const endDirection = (points: readonly number[]): [number, number] => {\n  for (let i = points.length - 4; i >= 0; i -= 2) {\n    const dx = points[points.length - 2] - points[i];\n    const dy = points[points.length - 1] - points[i + 1];\n    const l = Math.hypot(dx, dy);\n    if (l > 1e-9) return [dx / l, dy / l];\n  }\n  return [1, 0];\n};\n\n/** Distance from the center of a node to its boundary in direction (ux, uy) */\nexport const boundaryDistance = (\n  box: boolean,\n  width: number,\n  height: number,\n  ux: number,\n  uy: number,\n): number => {\n  if (!box) return width / 2;\n  const ax = Math.abs(ux);\n  const ay = Math.abs(uy);\n  const tx = ax > 1e-9 ? width / 2 / ax : Infinity;\n  const ty = ay > 1e-9 ? height / 2 / ay : Infinity;\n  return Math.min(tx, ty);\n};\n\n/**\n * Arrowhead at (tx, ty) pointing along (ux, uy): the outline of a narrow\n * triangle and its axis, drawn with the line width it looks solid\n */\nexport const arrowHead = (\n  out: number[],\n  tx: number,\n  ty: number,\n  ux: number,\n  uy: number,\n  length: number,\n  gap: number,\n): void => {\n  const w = length * 0.42;\n  const bx = tx - ux * length;\n  const by = ty - uy * length;\n  const lx = bx - uy * w;\n  const ly = by + ux * w;\n  const rx = bx + uy * w;\n  const ry = by - ux * w;\n  out.push(lx, ly, tx, ty, rx, ry, lx, ly, gap, gap);\n  out.push(tx, ty, bx, by, gap, gap);\n  const mx = (lx + bx) / 2;\n  const my = (ly + by) / 2;\n  const nx = (rx + bx) / 2;\n  const ny = (ry + by) / 2;\n  out.push(tx, ty, mx, my, gap, gap, tx, ty, nx, ny, gap, gap);\n};\n\n/** Filled triangle as area points (x, top, bottom): two x-monotone pieces */\nexport const triangleArea = (\n  out: number[],\n  ax: number,\n  ay: number,\n  bx: number,\n  by: number,\n  cx: number,\n  cy: number,\n  gap: number,\n): void => {\n  // sort the corners by x\n  let p = [ax, ay, bx, by, cx, cy];\n  if (p[0] > p[2]) p = [p[2], p[3], p[0], p[1], p[4], p[5]];\n  if (p[2] > p[4]) p = [p[0], p[1], p[4], p[5], p[2], p[3]];\n  if (p[0] > p[2]) p = [p[2], p[3], p[0], p[1], p[4], p[5]];\n  const [x1, y1, x2, y2, x3, y3] = p;\n  if (!(x3 - x1 > 1e-12)) return;\n  // the long side at the middle corner; the larger y is always the top, so\n  // every triangle winds the same way (overlapping ones never cancel)\n  const y13 = y1 + ((y3 - y1) * (x2 - x1)) / (x3 - x1);\n  out.push(\n    x1,\n    y1,\n    y1,\n    x2,\n    Math.max(y2, y13),\n    Math.min(y2, y13),\n    x3,\n    y3,\n    y3,\n    gap,\n    gap,\n    gap,\n  );\n};\n\n/** Corners of a filled (\"stealth\") arrowhead: tip, left, notch, right */\nconst arrowCorners = (\n  tx: number,\n  ty: number,\n  ux: number,\n  uy: number,\n  length: number,\n): number[] => {\n  const w = length * 0.5;\n  const bx = tx - ux * length;\n  const by = ty - uy * length;\n  return [\n    tx,\n    ty,\n    bx - uy * w,\n    by + ux * w,\n    tx - ux * length * 0.72,\n    ty - uy * length * 0.72,\n    bx + uy * w,\n    by - ux * w,\n  ];\n};\n\n/**\n * Filled arrowhead at (tx, ty) pointing along (ux, uy): area triangles in\n * `fill`, its outline (anti-aliased edges) in `outline`\n */\nexport const filledArrow = (\n  fill: number[],\n  outline: number[],\n  tx: number,\n  ty: number,\n  ux: number,\n  uy: number,\n  length: number,\n  gap: number,\n): void => {\n  const [x0, y0, lx, ly, nx, ny, rx, ry] = arrowCorners(tx, ty, ux, uy, length);\n  triangleArea(fill, x0, y0, lx, ly, nx, ny, gap);\n  triangleArea(fill, x0, y0, nx, ny, rx, ry, gap);\n  outline.push(lx, ly, x0, y0, rx, ry, nx, ny, lx, ly, gap, gap);\n};\n\n/** Splits a polyline into dashes (`dash` / `space` in layout units) */\nexport const dashPath = (\n  points: readonly number[],\n  dash: number,\n  space: number,\n  gap: number,\n): number[] => {\n  const out: number[] = [];\n  const total = pathLength(points);\n  const period = dash + space;\n  if (period <= 0 || total <= 0) return points.slice();\n  for (let start = 0; start < total; start += period) {\n    const end = Math.min(total, start + dash);\n    const a = pointAt(points, start);\n    out.push(a[0], a[1]);\n    let walked = 0;\n    for (let i = 2; i < points.length; i += 2) {\n      walked += Math.hypot(\n        points[i] - points[i - 2],\n        points[i + 1] - points[i - 1],\n      );\n      if (walked > start && walked < end) out.push(points[i], points[i + 1]);\n    }\n    const b = pointAt(points, end);\n    out.push(b[0], b[1], gap, gap);\n  }\n  return out;\n};\n\n/** Squared distance from (px, py) to a polyline */\nexport const distanceToPath = (\n  points: readonly number[],\n  px: number,\n  py: number,\n): number => {\n  let best = Infinity;\n  for (let i = 2; i < points.length; i += 2) {\n    const ax = points[i - 2];\n    const ay = points[i - 1];\n    const dx = points[i] - ax;\n    const dy = points[i + 1] - ay;\n    const l = dx * dx + dy * dy;\n    const t =\n      l > 0\n        ? Math.max(0, Math.min(1, ((px - ax) * dx + (py - ay) * dy) / l))\n        : 0;\n    const qx = ax + dx * t - px;\n    const qy = ay + dy * t - py;\n    best = Math.min(best, qx * qx + qy * qy);\n  }\n  return best;\n};\n"],"mappings":"AAKA,IAAaA,GACX,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,IACS,CACT,IAAMC,EACJ,KAAK,MAAMC,EAAKC,EAAIC,EAAKC,CAAE,EAC3B,KAAK,MAAMC,EAAKJ,EAAIK,EAAKH,CAAE,EAC3B,KAAK,MAAMI,EAAKF,EAAIG,EAAKF,CAAE,EACvBG,EAAW,KAAK,IAAI,EAAG,KAAK,IAAI,GAAI,KAAK,KAAKT,EAAS,EAAE,CAAC,CAAC,EACjE,IAAK,IAAIU,EAAI,EAAGA,GAAKD,EAAU,IAAK,CAClC,IAAME,EAAID,EAAID,EACRG,EAAI,EAAID,EACRE,EAAID,EAAIA,EAAIA,EACZE,EAAI,EAAIF,EAAIA,EAAID,EAChBI,EAAI,EAAIH,EAAID,EAAIA,EAChBK,EAAIL,EAAIA,EAAIA,EAClBM,EAAI,KACFJ,EAAIX,EAAKY,EAAIb,EAAKc,EAAIV,EAAKW,EAAIT,EAC/BM,EAAIT,EAAKU,EAAIX,EAAKY,EAAIT,EAAKU,EAAIR,CACjC,CACF,CACF,EAGaU,GACX,EACA,EACA,EACA,EACA,EACA,IACa,CACb,IAAMD,EAAM,CAACf,EAAIE,CAAE,EAYnB,OAXAL,EACEkB,EACAf,EACAE,EACAF,GAAOiB,EAAKjB,GAAM,EAAK,EACvBE,GAAOgB,EAAKhB,GAAM,EAAK,EACvBH,GAAOkB,EAAKlB,GAAM,EAAK,EACvBE,GAAOiB,EAAKjB,GAAM,EAAK,EACvBF,EACAE,CACF,EACOc,CACT,EAMaI,GACX,EACA,IACa,CACb,IAAMJ,EAAM,CAACK,EAAO,GAAIA,EAAO,EAAE,EACjC,IAAK,IAAI,EAAI,EAAG,EAAIA,EAAO,OAAQ,GAAK,EAAG,CACzC,IAAMpB,EAAKoB,EAAO,EAAI,GAChBlB,EAAKkB,EAAO,EAAI,GAChBrB,EAAKqB,EAAO,GACZnB,EAAKmB,EAAO,EAAI,GACtB,GAAIC,EAAU,CACZ,IAAMC,GAAMpB,EAAKD,GAAM,EACvBJ,EAAYkB,EAAKf,EAAIE,EAAIF,EAAIsB,EAAIvB,EAAIuB,EAAIvB,EAAIE,CAAE,CACjD,KAAO,CACL,IAAMsB,GAAMvB,EAAKD,GAAM,EACvBF,EAAYkB,EAAKf,EAAIE,EAAIqB,EAAIrB,EAAIqB,EAAItB,EAAIF,EAAIE,CAAE,CACjD,CACF,CACA,OAAOc,CACT,EAGMS,GACJ,EACA,EACA,EACA,EACA,EACA,IACG,CACH,IAAMC,EAAKV,EAAIA,EAAI,OAAS,GACtBW,EAAKX,EAAIA,EAAI,OAAS,GACtBY,EAAQ,KAAK,MAAMV,EAAKQ,EAAIP,EAAKQ,CAAE,EACnCE,EAAS,KAAK,MAAMC,EAAKZ,EAAIa,EAAKZ,CAAE,EACpCa,EAAI,KAAK,IAAIC,EAAQL,EAAQ,EAAGC,EAAS,CAAC,EAChD,GAAIG,EAAI,GAAK,CACXhB,EAAI,KAAKE,EAAIC,CAAE,EACf,MACF,CACA,IAAMe,EAAKhB,GAAOA,EAAKQ,GAAME,EAASI,EAChCG,EAAKhB,GAAOA,EAAKQ,GAAMC,EAASI,EAChCI,EAAKlB,GAAOY,EAAKZ,GAAMW,EAAUG,EACjCK,EAAKlB,GAAOY,EAAKZ,GAAMU,EAAUG,EACvChB,EAAI,KAAKkB,EAAIC,CAAE,EAEf,IAAK,IAAI1B,EAAI,EAAGA,GAAK,EAAG,IAAK,CAC3B,IAAMC,EAAID,EAAI,EACRE,EAAI,EAAID,EACdM,EAAI,KACFL,EAAIA,EAAIuB,EAAK,EAAIvB,EAAID,EAAIQ,EAAKR,EAAIA,EAAI0B,EACtCzB,EAAIA,EAAIwB,EAAK,EAAIxB,EAAID,EAAIS,EAAKT,EAAIA,EAAI2B,CACxC,CACF,CACF,EAMaC,GACX,EACA,EACA,IACa,CACb,IAAMC,EAAoB,CAAClB,EAAO,GAAIA,EAAO,EAAE,EAC/C,IAAK,IAAIZ,EAAI,EAAGA,EAAIY,EAAO,OAAQ,GAAK,EAAG,CACzC,IAAMpB,EAAKoB,EAAOZ,EAAI,GAChBN,EAAKkB,EAAOZ,EAAI,GAChBT,EAAKqB,EAAOZ,GACZP,EAAKmB,EAAOZ,EAAI,GACtB,GAAI,KAAK,IAAIa,EAAWtB,EAAKC,EAAKC,EAAKC,CAAE,EAAI,GAAK,CAChD,GAAImB,EAAU,CACZ,IAAMC,GAAMpB,EAAKD,GAAM,EACvBqC,EAAQ,KAAKtC,EAAIsB,EAAIvB,EAAIuB,CAAE,CAC7B,KAAO,CACL,IAAMC,GAAMvB,EAAKD,GAAM,EACvBuC,EAAQ,KAAKf,EAAIrB,EAAIqB,EAAItB,CAAE,CAC7B,CACF,CACAqC,EAAQ,KAAKvC,EAAIE,CAAE,CACrB,CACA,OAAOsC,EAAaD,EAASN,CAAM,CACrC,EAGaO,GACX,EACA,IACa,CACb,IAAMxB,EAAM,CAACuB,EAAQ,GAAIA,EAAQ,EAAE,EAC7BE,EAAOF,EAAQ,OAAS,EAC9B,IAAK,IAAI9B,EAAI,EAAGA,EAAIgC,EAAM,GAAK,EAC7BhB,EACET,EACAuB,EAAQ9B,GACR8B,EAAQ9B,EAAI,GACZ8B,EAAQ9B,EAAI,GACZ8B,EAAQ9B,EAAI,GACZwB,CACF,EAGF,OADIQ,GAAQ,GAAGzB,EAAI,KAAKuB,EAAQE,GAAOF,EAAQE,EAAO,EAAE,EACjDzB,CACT,EAGa0B,GACX,EACA,EACA,EACA,EAAO,IACM,CACb,IAAMxB,GAAMgB,EAAKE,GAAM,EACjBJ,EAAI,KAAK,IAAII,EAAKF,CAAE,EAAI,EACxB1B,EAAW,EAAI,KAAK,IAAI,EAAG,KAAK,IAAI,GAAI,KAAK,KAAKwB,EAAI,EAAE,CAAC,CAAC,EAC1DhB,EAAgB,CAAC,EACjB2B,EAAOT,EAAKE,EAAK,KAAK,GAAK,EAC3BQ,EAAKV,EAAKE,EAAK,EAAI,KAAK,GAC9B,IAAK,IAAI3B,EAAI,EAAGA,GAAKD,EAAU,IAAK,CAClC,IAAMI,EAAI+B,GAASC,EAAKD,GAAQlC,EAAKD,EACrCQ,EAAI,KAAKE,EAAKc,EAAI,KAAK,IAAIpB,CAAC,EAAGiC,EAAIb,EAAIc,EAAO,KAAK,IAAIlC,CAAC,CAAC,CAC3D,CACA,OAAOI,CACT,EAOa+B,GACX,EACA,EACA,EACA,EACA,EACA,IACa,CACb,IAAMC,EAAO,IACPC,EAAO,GACPC,EAAQ,KAAK,IAAIC,EAAOC,CAAG,EAAIC,EAAO,IACtCC,EAAKC,EAAQP,EACbQ,EAAKD,EAAQP,EACbhC,EAAM,CAACyC,EAAI,KAAK,IAAIH,CAAE,EAAIH,EAAON,EAAI,KAAK,IAAIS,CAAE,EAAIH,CAAK,EAY/D,OAXArD,EACEkB,EACAA,EAAI,GACJA,EAAI,GACJyC,EAAI,KAAK,IAAIF,EAAQN,CAAI,EAAIC,EAC7BL,EAAI,KAAK,IAAIU,EAAQN,CAAI,EAAIC,EAC7BO,EAAI,KAAK,IAAIF,EAAQN,CAAI,EAAIC,EAC7BL,EAAI,KAAK,IAAIU,EAAQN,CAAI,EAAIC,EAC7BO,EAAI,KAAK,IAAID,CAAE,EAAIJ,EACnBP,EAAI,KAAK,IAAIW,CAAE,EAAIJ,CACrB,EACOpC,CACT,EAGa0C,EAAc,GAAsC,CAC/D,IAAI3D,EAAS,EACb,IAAK,IAAIU,EAAI,EAAGA,EAAIY,EAAO,OAAQ,GAAK,EACtC,GAAU,KAAK,MACbA,EAAOZ,GAAKY,EAAOZ,EAAI,GACvBY,EAAOZ,EAAI,GAAKY,EAAOZ,EAAI,EAC7B,EACF,OAAOV,CACT,EAGa4D,GACX,EACA,EACA,IACa,CACb,IAAMC,EAAQF,EAAWrC,CAAM,EAC/B,GAAIuC,GAAST,EAAQC,EAAM,KAAM,CAE/B,GAAI/B,EAAO,OAAS,EAAG,OAAOA,EAE9B,IAAMwC,EAAIC,EAAQzC,GADR8B,EAAQC,EAAM,EAAID,GAASA,EAAQC,GAAO,IACtBQ,CAAK,EACnC,MAAO,CAACC,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAE,CAChC,CACA,IAAM7C,EAAgB,CAAC,EACjB+C,EAAaD,EAAQzC,EAAQ8B,CAAK,EAClCa,EAAWF,EAAQzC,EAAQuC,EAAQR,CAAG,EAC5CpC,EAAI,KAAK+C,EAAW,GAAIA,EAAW,EAAE,EACrC,IAAIE,EAAS,EACb,IAAK,IAAIxD,EAAI,EAAGA,EAAIY,EAAO,OAAQ,GAAK,EACtC,GAAU,KAAK,MACbA,EAAOZ,GAAKY,EAAOZ,EAAI,GACvBY,EAAOZ,EAAI,GAAKY,EAAOZ,EAAI,EAC7B,EACIwD,EAASd,GAASc,EAASL,EAAQR,GACrCpC,EAAI,KAAKK,EAAOZ,GAAIY,EAAOZ,EAAI,EAAE,EAGrC,OADAO,EAAI,KAAKgD,EAAS,GAAIA,EAAS,EAAE,EAC1BhD,CACT,EAGa8C,GACX,EACA,IACqC,CACrC,IAAIG,EAAS,EACb,IAAK,IAAIxD,EAAI,EAAGA,EAAIY,EAAO,OAAQ,GAAK,EAAG,CACzC,IAAM6C,EAAK7C,EAAOZ,GAAKY,EAAOZ,EAAI,GAC5B0D,EAAK9C,EAAOZ,EAAI,GAAKY,EAAOZ,EAAI,GAChC2D,EAAI,KAAK,MAAMF,EAAIC,CAAE,EAC3B,GAAIF,EAASG,GAAKC,GAAYD,EAAI,EAAG,CACnC,IAAM1D,GAAK2D,EAAWJ,GAAUG,EAChC,MAAO,CAAC/C,EAAOZ,EAAI,GAAKyD,EAAKxD,EAAGW,EAAOZ,EAAI,GAAK0D,EAAKzD,EAAGwD,EAAKE,EAAGD,EAAKC,CAAC,CACxE,CACA,GAAUA,CACZ,CACA,IAAME,EAAIjD,EAAO,OAAS,EACpB6C,EAAKI,GAAK,EAAIjD,EAAOiD,GAAKjD,EAAOiD,EAAI,GAAK,EAC1CH,EAAKG,GAAK,EAAIjD,EAAOiD,EAAI,GAAKjD,EAAOiD,EAAI,GAAK,EAC9CF,EAAI,KAAK,MAAMF,EAAIC,CAAE,GAAK,EAChC,MAAO,CAAC9C,EAAOiD,GAAIjD,EAAOiD,EAAI,GAAIJ,EAAKE,EAAGD,EAAKC,CAAC,CAClD,EAGaG,EAAgB,GAAgD,CAC3E,IAAK,IAAI9D,EAAIY,EAAO,OAAS,EAAGZ,GAAK,EAAG,GAAK,EAAG,CAC9C,IAAMyD,EAAK7C,EAAOA,EAAO,OAAS,GAAKA,EAAOZ,GACxC0D,EAAK9C,EAAOA,EAAO,OAAS,GAAKA,EAAOZ,EAAI,GAC5C2D,EAAI,KAAK,MAAMF,EAAIC,CAAE,EAC3B,GAAIC,EAAI,KAAM,MAAO,CAACF,EAAKE,EAAGD,EAAKC,CAAC,CACtC,CACA,MAAO,CAAC,EAAG,CAAC,CACd,EAGaI,GACX,EACA,EACA,EACA,EACA,IACW,CACX,GAAI,CAACC,EAAK,OAAOC,EAAQ,EACzB,IAAMxC,EAAK,KAAK,IAAIyC,CAAE,EAChBxC,EAAK,KAAK,IAAIyC,CAAE,EAChBC,EAAK3C,EAAK,KAAOwC,EAAQ,EAAIxC,EAAK,IAClC4C,EAAK3C,EAAK,KAAO4C,EAAS,EAAI5C,EAAK,IACzC,OAAO,KAAK,IAAI0C,EAAIC,CAAE,CACxB,EAMaE,GACX,EACA,EACA,EACA,EACA,EACA,EACA,IACS,CACT,IAAMC,EAAIlF,EAAS,IACbqC,EAAKyC,EAAKF,EAAK5E,EACfsC,EAAKyC,EAAKF,EAAK7E,EACfmF,EAAK9C,EAAKwC,EAAKK,EACfE,EAAK9C,EAAKsC,EAAKM,EACfG,EAAKhD,EAAKwC,EAAKK,EACfI,EAAKhD,EAAKsC,EAAKM,EACrBjE,EAAI,KAAKkE,EAAIC,EAAIN,EAAIC,EAAIM,EAAIC,EAAIH,EAAIC,EAAIG,EAAKA,CAAG,EACjDtE,EAAI,KAAK6D,EAAIC,EAAI1C,EAAIC,EAAIiD,EAAKA,CAAG,EACjC,IAAM9D,GAAM0D,EAAK9C,GAAM,EACjBb,GAAM4D,EAAK9C,GAAM,EACjBP,GAAMsD,EAAKhD,GAAM,EACjBL,GAAMsD,EAAKhD,GAAM,EACvBrB,EAAI,KAAK6D,EAAIC,EAAItD,EAAID,EAAI+D,EAAKA,EAAKT,EAAIC,EAAIhD,EAAIC,EAAIuD,EAAKA,CAAG,CAC7D,EAGaC,GACX,EACA,EACA,EACA,EACA,EACA,EACA,EACA,IACS,CAET,IAAI1B,EAAI,CAAC3B,EAAIC,EAAIC,EAAIC,EAAInB,EAAIC,CAAE,EAC3B0C,EAAE,GAAKA,EAAE,KAAI,EAAI,CAACA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAE,GACpDA,EAAE,GAAKA,EAAE,KAAI,EAAI,CAACA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAE,GACpDA,EAAE,GAAKA,EAAE,KAAI,EAAI,CAACA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAE,GACxD,GAAM,CAAC7D,EAAIE,EAAIE,EAAIC,EAAIC,EAAIC,GAAMsD,EACjC,GAAI,EAAEvD,EAAKN,EAAK,OAAQ,OAGxB,IAAMwF,EAAMtF,GAAOK,EAAKL,IAAOE,EAAKJ,IAAQM,EAAKN,GACjDgB,EAAI,KACFhB,EACAE,EACAA,EACAE,EACA,KAAK,IAAIC,EAAImF,CAAG,EAChB,KAAK,IAAInF,EAAImF,CAAG,EAChBlF,EACAC,EACAA,EACA+E,EACAA,EACAA,CACF,CACF,EAGMG,GACJ,EACA,EACA,EACA,EACA,IACa,CACb,IAAMR,EAAIlF,EAAS,GACbqC,EAAKyC,EAAKF,EAAK5E,EACfsC,EAAKyC,EAAKF,EAAK7E,EACrB,MAAO,CACL8E,EACAC,EACA1C,EAAKwC,EAAKK,EACV5C,EAAKsC,EAAKM,EACVJ,EAAKF,EAAK5E,EAAS,IACnB+E,EAAKF,EAAK7E,EAAS,IACnBqC,EAAKwC,EAAKK,EACV5C,EAAKsC,EAAKM,CACZ,CACF,EAMaS,GACX,EACA,EACA,EACA,EACA,EACA,EACA,EACA,IACS,CACT,GAAM,CAACzF,EAAIE,EAAI+E,EAAIC,EAAIrD,EAAIC,EAAIqD,EAAIC,GAAMI,EAAaZ,EAAIC,EAAIH,EAAIC,EAAI7E,CAAM,EAC5EwF,EAAaI,EAAM1F,EAAIE,EAAI+E,EAAIC,EAAIrD,EAAIC,EAAIuD,CAAG,EAC9CC,EAAaI,EAAM1F,EAAIE,EAAI2B,EAAIC,EAAIqD,EAAIC,EAAIC,CAAG,EAC9CM,EAAQ,KAAKV,EAAIC,EAAIlF,EAAIE,EAAIiF,EAAIC,EAAIvD,EAAIC,EAAImD,EAAIC,EAAIG,EAAKA,CAAG,CAC/D,EAGaO,GACX,EACA,EACA,EACA,IACa,CACb,IAAM7E,EAAgB,CAAC,EACjB4C,EAAQF,EAAWrC,CAAM,EACzByE,EAASC,EAAOC,EACtB,GAAIF,GAAU,GAAKlC,GAAS,EAAG,OAAOvC,EAAO,MAAM,EACnD,IAAK,IAAI8B,EAAQ,EAAGA,EAAQS,EAAO,GAASkC,EAAQ,CAClD,IAAM1C,EAAM,KAAK,IAAIQ,EAAOT,EAAQ4C,CAAI,EAClCnF,EAAIkD,EAAQzC,EAAQ8B,CAAK,EAC/BnC,EAAI,KAAKJ,EAAE,GAAIA,EAAE,EAAE,EACnB,IAAIqD,EAAS,EACb,IAAK,IAAIxD,EAAI,EAAGA,EAAIY,EAAO,OAAQ,GAAK,EACtC,GAAU,KAAK,MACbA,EAAOZ,GAAKY,EAAOZ,EAAI,GACvBY,EAAOZ,EAAI,GAAKY,EAAOZ,EAAI,EAC7B,EACIwD,EAASd,GAASc,EAASb,GAAKpC,EAAI,KAAKK,EAAOZ,GAAIY,EAAOZ,EAAI,EAAE,EAEvE,IAAMI,EAAIiD,EAAQzC,EAAQ+B,CAAG,EAC7BpC,EAAI,KAAKH,EAAE,GAAIA,EAAE,GAAIyE,EAAKA,CAAG,CAC/B,CACA,OAAOtE,CACT,EAGaiF,GACX,EACA,EACA,IACW,CACX,IAAIC,EAAO,IACX,IAAK,IAAI,EAAI,EAAG,EAAI7E,EAAO,OAAQ,GAAK,EAAG,CACzC,IAAMa,EAAKb,EAAO,EAAI,GAChBc,EAAKd,EAAO,EAAI,GAChB6C,EAAK7C,EAAO,GAAKa,EACjBiC,EAAK9C,EAAO,EAAI,GAAKc,EACrB,EAAI+B,EAAKA,EAAKC,EAAKA,EACnBzD,EACJ,EAAI,EACA,KAAK,IAAI,EAAG,KAAK,IAAI,IAAKgB,EAAKQ,GAAMgC,GAAMvC,EAAKQ,GAAMgC,GAAM,CAAC,CAAC,EAC9D,EACAgC,EAAKjE,EAAKgC,EAAKxD,EAAIgB,EACnB0E,EAAKjE,EAAKgC,EAAKzD,EAAIiB,EACzB,EAAO,KAAK,IAAIuE,EAAMC,EAAKA,EAAKC,EAAKA,CAAE,CACzC,CACA,OAAOF,CACT"}

package/dist/charts/engine/graph/geometry.d.cts

@@ -0,0 +1,50 @@
+/** Points of a cubic Bézier (the start point excluded) */
+export declare const cubicPoints: (out: number[], x0: number, y0: number, x1: number, y1: number, x2: number, y2: number, x3: number, y3: number) => void;
+/** Points of a quadratic Bézier (the start point included) */
+export declare const quadraticPath: (x0: number, y0: number, cx: number, cy: number, x1: number, y1: number) => number[];
+/**
+ * Smooth path through waypoints whose tangents follow the flow axis
+ * (vertical for top → bottom layouts): C1 at every waypoint
+ */
+export declare const splinePath: (points: readonly number[], vertical: boolean) => number[];
+/**
+ * Orthogonal path through waypoints: along the flow axis to the middle,
+ * across, then along the axis again, with rounded corners
+ */
+export declare const orthogonalPath: (points: readonly number[], vertical: boolean, radius: number) => number[];
+/** Polyline with rounded corners */
+export declare const roundCorners: (corners: readonly number[], radius: number) => number[];
+/** Upper half circle between two points of the x axis (arc diagrams) */
+export declare const arcPath: (ax: number, bx: number, y: number, rise?: number) => number[];
+/**
+ * Self-loop of a node at (x, y): a teardrop leaving the boundary at
+ * `start` units from the center and coming back at `end` units, centered on
+ * the direction `angle`, reaching about `size` units beyond the boundary
+ */
+export declare const loopPath: (x: number, y: number, angle: number, start: number, end: number, size: number) => number[];
+/** Length of a polyline */
+export declare const pathLength: (points: readonly number[]) => number;
+/** Removes `start` / `end` units from the ends of a polyline */
+export declare const trimPath: (points: number[], start: number, end: number) => number[];
+/** Point and direction at a distance along a polyline */
+export declare const pointAt: (points: readonly number[], distance: number) => [number, number, number, number];
+/** Direction at the end of a polyline (unit vector) */
+export declare const endDirection: (points: readonly number[]) => [number, number];
+/** Distance from the center of a node to its boundary in direction (ux, uy) */
+export declare const boundaryDistance: (box: boolean, width: number, height: number, ux: number, uy: number) => number;
+/**
+ * Arrowhead at (tx, ty) pointing along (ux, uy): the outline of a narrow
+ * triangle and its axis, drawn with the line width it looks solid
+ */
+export declare const arrowHead: (out: number[], tx: number, ty: number, ux: number, uy: number, length: number, gap: number) => void;
+/** Filled triangle as area points (x, top, bottom): two x-monotone pieces */
+export declare const triangleArea: (out: number[], ax: number, ay: number, bx: number, by: number, cx: number, cy: number, gap: number) => void;
+/**
+ * Filled arrowhead at (tx, ty) pointing along (ux, uy): area triangles in
+ * `fill`, its outline (anti-aliased edges) in `outline`
+ */
+export declare const filledArrow: (fill: number[], outline: number[], tx: number, ty: number, ux: number, uy: number, length: number, gap: number) => void;
+/** Splits a polyline into dashes (`dash` / `space` in layout units) */
+export declare const dashPath: (points: readonly number[], dash: number, space: number, gap: number) => number[];
+/** Squared distance from (px, py) to a polyline */
+export declare const distanceToPath: (points: readonly number[], px: number, py: number) => number;

package/dist/charts/engine/graph/geometry.d.ts

@@ -0,0 +1,50 @@
+/** Points of a cubic Bézier (the start point excluded) */
+export declare const cubicPoints: (out: number[], x0: number, y0: number, x1: number, y1: number, x2: number, y2: number, x3: number, y3: number) => void;
+/** Points of a quadratic Bézier (the start point included) */
+export declare const quadraticPath: (x0: number, y0: number, cx: number, cy: number, x1: number, y1: number) => number[];
+/**
+ * Smooth path through waypoints whose tangents follow the flow axis
+ * (vertical for top → bottom layouts): C1 at every waypoint
+ */
+export declare const splinePath: (points: readonly number[], vertical: boolean) => number[];
+/**
+ * Orthogonal path through waypoints: along the flow axis to the middle,
+ * across, then along the axis again, with rounded corners
+ */
+export declare const orthogonalPath: (points: readonly number[], vertical: boolean, radius: number) => number[];
+/** Polyline with rounded corners */
+export declare const roundCorners: (corners: readonly number[], radius: number) => number[];
+/** Upper half circle between two points of the x axis (arc diagrams) */
+export declare const arcPath: (ax: number, bx: number, y: number, rise?: number) => number[];
+/**
+ * Self-loop of a node at (x, y): a teardrop leaving the boundary at
+ * `start` units from the center and coming back at `end` units, centered on
+ * the direction `angle`, reaching about `size` units beyond the boundary
+ */
+export declare const loopPath: (x: number, y: number, angle: number, start: number, end: number, size: number) => number[];
+/** Length of a polyline */
+export declare const pathLength: (points: readonly number[]) => number;
+/** Removes `start` / `end` units from the ends of a polyline */
+export declare const trimPath: (points: number[], start: number, end: number) => number[];
+/** Point and direction at a distance along a polyline */
+export declare const pointAt: (points: readonly number[], distance: number) => [number, number, number, number];
+/** Direction at the end of a polyline (unit vector) */
+export declare const endDirection: (points: readonly number[]) => [number, number];
+/** Distance from the center of a node to its boundary in direction (ux, uy) */
+export declare const boundaryDistance: (box: boolean, width: number, height: number, ux: number, uy: number) => number;
+/**
+ * Arrowhead at (tx, ty) pointing along (ux, uy): the outline of a narrow
+ * triangle and its axis, drawn with the line width it looks solid
+ */
+export declare const arrowHead: (out: number[], tx: number, ty: number, ux: number, uy: number, length: number, gap: number) => void;
+/** Filled triangle as area points (x, top, bottom): two x-monotone pieces */
+export declare const triangleArea: (out: number[], ax: number, ay: number, bx: number, by: number, cx: number, cy: number, gap: number) => void;
+/**
+ * Filled arrowhead at (tx, ty) pointing along (ux, uy): area triangles in
+ * `fill`, its outline (anti-aliased edges) in `outline`
+ */
+export declare const filledArrow: (fill: number[], outline: number[], tx: number, ty: number, ux: number, uy: number, length: number, gap: number) => void;
+/** Splits a polyline into dashes (`dash` / `space` in layout units) */
+export declare const dashPath: (points: readonly number[], dash: number, space: number, gap: number) => number[];
+/** Squared distance from (px, py) to a polyline */
+export declare const distanceToPath: (points: readonly number[], px: number, py: number) => number;

package/dist/charts/engine/graph/geometry.js

@@ -0,0 +1,197 @@
+//#region src/engine/graph/geometry.ts
+var e = (e, t, n, r, i, a, o, s, c) => {
+	let l = Math.hypot(r - t, i - n) + Math.hypot(a - r, o - i) + Math.hypot(s - a, c - o), u = Math.max(4, Math.min(28, Math.ceil(l / 10)));
+	for (let l = 1; l <= u; l++) {
+		let d = l / u, f = 1 - d, p = f * f * f, m = 3 * f * f * d, h = 3 * f * d * d, g = d * d * d;
+		e.push(p * t + m * r + h * a + g * s, p * n + m * i + h * o + g * c);
+	}
+}, t = (t, n, r, i, a, o) => {
+	let s = [t, n];
+	return e(s, t, n, t + (r - t) * 2 / 3, n + (i - n) * 2 / 3, a + (r - a) * 2 / 3, o + (i - o) * 2 / 3, a, o), s;
+}, n = (t, n) => {
+	let r = [t[0], t[1]];
+	for (let i = 2; i < t.length; i += 2) {
+		let a = t[i - 2], o = t[i - 1], s = t[i], c = t[i + 1];
+		if (n) {
+			let t = (o + c) / 2;
+			e(r, a, o, a, t, s, t, s, c);
+		} else {
+			let t = (a + s) / 2;
+			e(r, a, o, t, o, t, c, s, c);
+		}
+	}
+	return r;
+}, r = (e, t, n, r, i, a) => {
+	let o = e[e.length - 2], s = e[e.length - 1], c = Math.hypot(t - o, n - s), l = Math.hypot(r - t, i - n), u = Math.min(a, c / 2, l / 2);
+	if (u < .5) {
+		e.push(t, n);
+		return;
+	}
+	let d = t - (t - o) / c * u, f = n - (n - s) / c * u, p = t + (r - t) / l * u, m = n + (i - n) / l * u;
+	e.push(d, f);
+	for (let r = 1; r <= 4; r++) {
+		let i = r / 4, a = 1 - i;
+		e.push(a * a * d + 2 * a * i * t + i * i * p, a * a * f + 2 * a * i * n + i * i * m);
+	}
+}, i = (e, t, n) => {
+	let r = [e[0], e[1]];
+	for (let n = 2; n < e.length; n += 2) {
+		let i = e[n - 2], a = e[n - 1], o = e[n], s = e[n + 1];
+		if (Math.abs(t ? o - i : s - a) > .5) {
+			if (t) {
+				let e = (a + s) / 2;
+				r.push(i, e, o, e);
+			} else {
+				let e = (i + o) / 2;
+				r.push(e, a, e, s);
+			}
+		}
+		r.push(o, s);
+	}
+	return a(r, n);
+}, a = (e, t) => {
+	let n = [e[0], e[1]], i = e.length - 2;
+	for (let a = 2; a < i; a += 2) r(n, e[a], e[a + 1], e[a + 2], e[a + 3], t);
+	return i >= 2 && n.push(e[i], e[i + 1]), n;
+}, o = (e, t, n, r = 1) => {
+	let i = (e + t) / 2, a = Math.abs(t - e) / 2, o = 2 * Math.max(4, Math.min(32, Math.ceil(a / 12))), s = [], c = e < t ? Math.PI : 0, l = e < t ? 0 : Math.PI;
+	for (let e = 0; e <= o; e++) {
+		let t = c + (l - c) * e / o;
+		s.push(i + a * Math.cos(t), n - a * r * Math.sin(t));
+	}
+	return s;
+}, s = (t, n, r, i, a, o) => {
+	let s = .42, c = .8, l = Math.max(i, a) + o * 2.2, u = r - s, d = r + s, f = [t + Math.cos(u) * i, n + Math.sin(u) * i];
+	return e(f, f[0], f[1], t + Math.cos(r - c) * l, n + Math.sin(r - c) * l, t + Math.cos(r + c) * l, n + Math.sin(r + c) * l, t + Math.cos(d) * a, n + Math.sin(d) * a), f;
+}, c = (e) => {
+	let t = 0;
+	for (let n = 2; n < e.length; n += 2) t += Math.hypot(e[n] - e[n - 2], e[n + 1] - e[n - 1]);
+	return t;
+}, l = (e, t, n) => {
+	let r = c(e);
+	if (r <= t + n + 1e-6) {
+		if (e.length < 4) return e;
+		let i = u(e, (t + n > 0 ? t / (t + n) : .5) * r);
+		return [
+			i[0],
+			i[1],
+			i[0],
+			i[1]
+		];
+	}
+	let i = [], a = u(e, t), o = u(e, r - n);
+	i.push(a[0], a[1]);
+	let s = 0;
+	for (let a = 2; a < e.length; a += 2) s += Math.hypot(e[a] - e[a - 2], e[a + 1] - e[a - 1]), s > t && s < r - n && i.push(e[a], e[a + 1]);
+	return i.push(o[0], o[1]), i;
+}, u = (e, t) => {
+	let n = 0;
+	for (let r = 2; r < e.length; r += 2) {
+		let i = e[r] - e[r - 2], a = e[r + 1] - e[r - 1], o = Math.hypot(i, a);
+		if (n + o >= t && o > 0) {
+			let s = (t - n) / o;
+			return [
+				e[r - 2] + i * s,
+				e[r - 1] + a * s,
+				i / o,
+				a / o
+			];
+		}
+		n += o;
+	}
+	let r = e.length - 2, i = r >= 2 ? e[r] - e[r - 2] : 1, a = r >= 2 ? e[r + 1] - e[r - 1] : 0, o = Math.hypot(i, a) || 1;
+	return [
+		e[r],
+		e[r + 1],
+		i / o,
+		a / o
+	];
+}, d = (e) => {
+	for (let t = e.length - 4; t >= 0; t -= 2) {
+		let n = e[e.length - 2] - e[t], r = e[e.length - 1] - e[t + 1], i = Math.hypot(n, r);
+		if (i > 1e-9) return [n / i, r / i];
+	}
+	return [1, 0];
+}, f = (e, t, n, r, i) => {
+	if (!e) return t / 2;
+	let a = Math.abs(r), o = Math.abs(i), s = a > 1e-9 ? t / 2 / a : Infinity, c = o > 1e-9 ? n / 2 / o : Infinity;
+	return Math.min(s, c);
+}, p = (e, t, n, r, i, a, o) => {
+	let s = a * .42, c = t - r * a, l = n - i * a, u = c - i * s, d = l + r * s, f = c + i * s, p = l - r * s;
+	e.push(u, d, t, n, f, p, u, d, o, o), e.push(t, n, c, l, o, o);
+	let m = (u + c) / 2, h = (d + l) / 2, g = (f + c) / 2, _ = (p + l) / 2;
+	e.push(t, n, m, h, o, o, t, n, g, _, o, o);
+}, m = (e, t, n, r, i, a, o, s) => {
+	let c = [
+		t,
+		n,
+		r,
+		i,
+		a,
+		o
+	];
+	c[0] > c[2] && (c = [
+		c[2],
+		c[3],
+		c[0],
+		c[1],
+		c[4],
+		c[5]
+	]), c[2] > c[4] && (c = [
+		c[0],
+		c[1],
+		c[4],
+		c[5],
+		c[2],
+		c[3]
+	]), c[0] > c[2] && (c = [
+		c[2],
+		c[3],
+		c[0],
+		c[1],
+		c[4],
+		c[5]
+	]);
+	let [l, u, d, f, p, m] = c;
+	if (!(p - l > 1e-12)) return;
+	let h = u + (m - u) * (d - l) / (p - l);
+	e.push(l, u, u, d, Math.max(f, h), Math.min(f, h), p, m, m, s, s, s);
+}, h = (e, t, n, r, i) => {
+	let a = i * .5, o = e - n * i, s = t - r * i;
+	return [
+		e,
+		t,
+		o - r * a,
+		s + n * a,
+		e - n * i * .72,
+		t - r * i * .72,
+		o + r * a,
+		s - n * a
+	];
+}, g = (e, t, n, r, i, a, o, s) => {
+	let [c, l, u, d, f, p, g, _] = h(n, r, i, a, o);
+	m(e, c, l, u, d, f, p, s), m(e, c, l, f, p, g, _, s), t.push(u, d, c, l, g, _, f, p, u, d, s, s);
+}, _ = (e, t, n, r) => {
+	let i = [], a = c(e), o = t + n;
+	if (o <= 0 || a <= 0) return e.slice();
+	for (let n = 0; n < a; n += o) {
+		let o = Math.min(a, n + t), s = u(e, n);
+		i.push(s[0], s[1]);
+		let c = 0;
+		for (let t = 2; t < e.length; t += 2) c += Math.hypot(e[t] - e[t - 2], e[t + 1] - e[t - 1]), c > n && c < o && i.push(e[t], e[t + 1]);
+		let l = u(e, o);
+		i.push(l[0], l[1], r, r);
+	}
+	return i;
+}, v = (e, t, n) => {
+	let r = Infinity;
+	for (let i = 2; i < e.length; i += 2) {
+		let a = e[i - 2], o = e[i - 1], s = e[i] - a, c = e[i + 1] - o, l = s * s + c * c, u = l > 0 ? Math.max(0, Math.min(1, ((t - a) * s + (n - o) * c) / l)) : 0, d = a + s * u - t, f = o + c * u - n;
+		r = Math.min(r, d * d + f * f);
+	}
+	return r;
+};
+//#endregion
+export { o as arcPath, p as arrowHead, f as boundaryDistance, e as cubicPoints, _ as dashPath, v as distanceToPath, d as endDirection, g as filledArrow, s as loopPath, i as orthogonalPath, c as pathLength, u as pointAt, t as quadraticPath, a as roundCorners, n as splinePath, m as triangleArea, l as trimPath };
+
+//# sourceMappingURL=geometry.js.map

package/dist/charts/engine/graph/geometry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"geometry.js","names":["cubicPoints","length","x1","x0","y1","y0","x2","y2","x3","y3","segments","i","t","u","a","b","c","d","quadraticPath","out","cx","cy","splinePath","points","vertical","my","mx","corner","px","py","inLen","outLen","nx","ny","r","radius","ax","ay","bx","by","orthogonalPath","corners","roundCorners","last","arcPath","from","to","y","rise","loopPath","open","wide","reach","start","end","size","a0","angle","a1","x","pathLength","trimPath","total","p","pointAt","startPoint","endPoint","walked","dx","dy","l","distance","k","endDirection","boundaryDistance","box","width","ux","uy","tx","ty","height","arrowHead","w","lx","ly","rx","ry","gap","triangleArea","y13","arrowCorners","filledArrow","fill","outline","dashPath","period","dash","space","distanceToPath","best","qx","qy"],"sources":["../../../../../charts/src/engine/graph/geometry.ts"],"sourcesContent":["// Edge geometry in layout units: curves sampled into polylines, trimming at\n// the node boundaries, arrowheads and dashes. Polylines are flat\n// `[x0, y0, x1, y1, …]` arrays.\n\n/** Points of a cubic Bézier (the start point excluded) */\nexport const cubicPoints = (\n  out: number[],\n  x0: number,\n  y0: number,\n  x1: number,\n  y1: number,\n  x2: number,\n  y2: number,\n  x3: number,\n  y3: number,\n): void => {\n  const length =\n    Math.hypot(x1 - x0, y1 - y0) +\n    Math.hypot(x2 - x1, y2 - y1) +\n    Math.hypot(x3 - x2, y3 - y2);\n  const segments = Math.max(4, Math.min(28, Math.ceil(length / 10)));\n  for (let i = 1; i <= segments; i++) {\n    const t = i / segments;\n    const u = 1 - t;\n    const a = u * u * u;\n    const b = 3 * u * u * t;\n    const c = 3 * u * t * t;\n    const d = t * t * t;\n    out.push(\n      a * x0 + b * x1 + c * x2 + d * x3,\n      a * y0 + b * y1 + c * y2 + d * y3,\n    );\n  }\n};\n\n/** Points of a quadratic Bézier (the start point included) */\nexport const quadraticPath = (\n  x0: number,\n  y0: number,\n  cx: number,\n  cy: number,\n  x1: number,\n  y1: number,\n): number[] => {\n  const out = [x0, y0];\n  cubicPoints(\n    out,\n    x0,\n    y0,\n    x0 + ((cx - x0) * 2) / 3,\n    y0 + ((cy - y0) * 2) / 3,\n    x1 + ((cx - x1) * 2) / 3,\n    y1 + ((cy - y1) * 2) / 3,\n    x1,\n    y1,\n  );\n  return out;\n};\n\n/**\n * Smooth path through waypoints whose tangents follow the flow axis\n * (vertical for top → bottom layouts): C1 at every waypoint\n */\nexport const splinePath = (\n  points: readonly number[],\n  vertical: boolean,\n): number[] => {\n  const out = [points[0], points[1]];\n  for (let i = 2; i < points.length; i += 2) {\n    const x0 = points[i - 2];\n    const y0 = points[i - 1];\n    const x1 = points[i];\n    const y1 = points[i + 1];\n    if (vertical) {\n      const my = (y0 + y1) / 2;\n      cubicPoints(out, x0, y0, x0, my, x1, my, x1, y1);\n    } else {\n      const mx = (x0 + x1) / 2;\n      cubicPoints(out, x0, y0, mx, y0, mx, y1, x1, y1);\n    }\n  }\n  return out;\n};\n\n/** Rounded corner from the end of `out` through (cx, cy) towards (nx, ny) */\nconst corner = (\n  out: number[],\n  cx: number,\n  cy: number,\n  nx: number,\n  ny: number,\n  radius: number,\n) => {\n  const px = out[out.length - 2];\n  const py = out[out.length - 1];\n  const inLen = Math.hypot(cx - px, cy - py);\n  const outLen = Math.hypot(nx - cx, ny - cy);\n  const r = Math.min(radius, inLen / 2, outLen / 2);\n  if (r < 0.5) {\n    out.push(cx, cy);\n    return;\n  }\n  const ax = cx - ((cx - px) / inLen) * r;\n  const ay = cy - ((cy - py) / inLen) * r;\n  const bx = cx + ((nx - cx) / outLen) * r;\n  const by = cy + ((ny - cy) / outLen) * r;\n  out.push(ax, ay);\n  // quadratic arc around the corner\n  for (let i = 1; i <= 4; i++) {\n    const t = i / 4;\n    const u = 1 - t;\n    out.push(\n      u * u * ax + 2 * u * t * cx + t * t * bx,\n      u * u * ay + 2 * u * t * cy + t * t * by,\n    );\n  }\n};\n\n/**\n * Orthogonal path through waypoints: along the flow axis to the middle,\n * across, then along the axis again, with rounded corners\n */\nexport const orthogonalPath = (\n  points: readonly number[],\n  vertical: boolean,\n  radius: number,\n): number[] => {\n  const corners: number[] = [points[0], points[1]];\n  for (let i = 2; i < points.length; i += 2) {\n    const x0 = points[i - 2];\n    const y0 = points[i - 1];\n    const x1 = points[i];\n    const y1 = points[i + 1];\n    if (Math.abs(vertical ? x1 - x0 : y1 - y0) > 0.5) {\n      if (vertical) {\n        const my = (y0 + y1) / 2;\n        corners.push(x0, my, x1, my);\n      } else {\n        const mx = (x0 + x1) / 2;\n        corners.push(mx, y0, mx, y1);\n      }\n    }\n    corners.push(x1, y1);\n  }\n  return roundCorners(corners, radius);\n};\n\n/** Polyline with rounded corners */\nexport const roundCorners = (\n  corners: readonly number[],\n  radius: number,\n): number[] => {\n  const out = [corners[0], corners[1]];\n  const last = corners.length - 2;\n  for (let i = 2; i < last; i += 2) {\n    corner(\n      out,\n      corners[i],\n      corners[i + 1],\n      corners[i + 2],\n      corners[i + 3],\n      radius,\n    );\n  }\n  if (last >= 2) out.push(corners[last], corners[last + 1]);\n  return out;\n};\n\n/** Upper half circle between two points of the x axis (arc diagrams) */\nexport const arcPath = (\n  ax: number,\n  bx: number,\n  y: number,\n  rise = 1,\n): number[] => {\n  const cx = (ax + bx) / 2;\n  const r = Math.abs(bx - ax) / 2;\n  const segments = 2 * Math.max(4, Math.min(32, Math.ceil(r / 12)));\n  const out: number[] = [];\n  const from = ax < bx ? Math.PI : 0;\n  const to = ax < bx ? 0 : Math.PI;\n  for (let i = 0; i <= segments; i++) {\n    const a = from + ((to - from) * i) / segments;\n    out.push(cx + r * Math.cos(a), y - r * rise * Math.sin(a));\n  }\n  return out;\n};\n\n/**\n * Self-loop of a node at (x, y): a teardrop leaving the boundary at\n * `start` units from the center and coming back at `end` units, centered on\n * the direction `angle`, reaching about `size` units beyond the boundary\n */\nexport const loopPath = (\n  x: number,\n  y: number,\n  angle: number,\n  start: number,\n  end: number,\n  size: number,\n): number[] => {\n  const open = 0.42;\n  const wide = 0.8;\n  const reach = Math.max(start, end) + size * 2.2;\n  const a0 = angle - open;\n  const a1 = angle + open;\n  const out = [x + Math.cos(a0) * start, y + Math.sin(a0) * start];\n  cubicPoints(\n    out,\n    out[0],\n    out[1],\n    x + Math.cos(angle - wide) * reach,\n    y + Math.sin(angle - wide) * reach,\n    x + Math.cos(angle + wide) * reach,\n    y + Math.sin(angle + wide) * reach,\n    x + Math.cos(a1) * end,\n    y + Math.sin(a1) * end,\n  );\n  return out;\n};\n\n/** Length of a polyline */\nexport const pathLength = (points: readonly number[]): number => {\n  let length = 0;\n  for (let i = 2; i < points.length; i += 2)\n    length += Math.hypot(\n      points[i] - points[i - 2],\n      points[i + 1] - points[i - 1],\n    );\n  return length;\n};\n\n/** Removes `start` / `end` units from the ends of a polyline */\nexport const trimPath = (\n  points: number[],\n  start: number,\n  end: number,\n): number[] => {\n  const total = pathLength(points);\n  if (total <= start + end + 1e-6) {\n    // too short: a zero-length segment in the middle keeps the direction\n    if (points.length < 4) return points;\n    const t = start + end > 0 ? start / (start + end) : 0.5;\n    const p = pointAt(points, t * total);\n    return [p[0], p[1], p[0], p[1]];\n  }\n  const out: number[] = [];\n  const startPoint = pointAt(points, start);\n  const endPoint = pointAt(points, total - end);\n  out.push(startPoint[0], startPoint[1]);\n  let walked = 0;\n  for (let i = 2; i < points.length; i += 2) {\n    walked += Math.hypot(\n      points[i] - points[i - 2],\n      points[i + 1] - points[i - 1],\n    );\n    if (walked > start && walked < total - end)\n      out.push(points[i], points[i + 1]);\n  }\n  out.push(endPoint[0], endPoint[1]);\n  return out;\n};\n\n/** Point and direction at a distance along a polyline */\nexport const pointAt = (\n  points: readonly number[],\n  distance: number,\n): [number, number, number, number] => {\n  let walked = 0;\n  for (let i = 2; i < points.length; i += 2) {\n    const dx = points[i] - points[i - 2];\n    const dy = points[i + 1] - points[i - 1];\n    const l = Math.hypot(dx, dy);\n    if (walked + l >= distance && l > 0) {\n      const t = (distance - walked) / l;\n      return [points[i - 2] + dx * t, points[i - 1] + dy * t, dx / l, dy / l];\n    }\n    walked += l;\n  }\n  const k = points.length - 2;\n  const dx = k >= 2 ? points[k] - points[k - 2] : 1;\n  const dy = k >= 2 ? points[k + 1] - points[k - 1] : 0;\n  const l = Math.hypot(dx, dy) || 1;\n  return [points[k], points[k + 1], dx / l, dy / l];\n};\n\n/** Direction at the end of a polyline (unit vector) */\nexport const endDirection = (points: readonly number[]): [number, number] => {\n  for (let i = points.length - 4; i >= 0; i -= 2) {\n    const dx = points[points.length - 2] - points[i];\n    const dy = points[points.length - 1] - points[i + 1];\n    const l = Math.hypot(dx, dy);\n    if (l > 1e-9) return [dx / l, dy / l];\n  }\n  return [1, 0];\n};\n\n/** Distance from the center of a node to its boundary in direction (ux, uy) */\nexport const boundaryDistance = (\n  box: boolean,\n  width: number,\n  height: number,\n  ux: number,\n  uy: number,\n): number => {\n  if (!box) return width / 2;\n  const ax = Math.abs(ux);\n  const ay = Math.abs(uy);\n  const tx = ax > 1e-9 ? width / 2 / ax : Infinity;\n  const ty = ay > 1e-9 ? height / 2 / ay : Infinity;\n  return Math.min(tx, ty);\n};\n\n/**\n * Arrowhead at (tx, ty) pointing along (ux, uy): the outline of a narrow\n * triangle and its axis, drawn with the line width it looks solid\n */\nexport const arrowHead = (\n  out: number[],\n  tx: number,\n  ty: number,\n  ux: number,\n  uy: number,\n  length: number,\n  gap: number,\n): void => {\n  const w = length * 0.42;\n  const bx = tx - ux * length;\n  const by = ty - uy * length;\n  const lx = bx - uy * w;\n  const ly = by + ux * w;\n  const rx = bx + uy * w;\n  const ry = by - ux * w;\n  out.push(lx, ly, tx, ty, rx, ry, lx, ly, gap, gap);\n  out.push(tx, ty, bx, by, gap, gap);\n  const mx = (lx + bx) / 2;\n  const my = (ly + by) / 2;\n  const nx = (rx + bx) / 2;\n  const ny = (ry + by) / 2;\n  out.push(tx, ty, mx, my, gap, gap, tx, ty, nx, ny, gap, gap);\n};\n\n/** Filled triangle as area points (x, top, bottom): two x-monotone pieces */\nexport const triangleArea = (\n  out: number[],\n  ax: number,\n  ay: number,\n  bx: number,\n  by: number,\n  cx: number,\n  cy: number,\n  gap: number,\n): void => {\n  // sort the corners by x\n  let p = [ax, ay, bx, by, cx, cy];\n  if (p[0] > p[2]) p = [p[2], p[3], p[0], p[1], p[4], p[5]];\n  if (p[2] > p[4]) p = [p[0], p[1], p[4], p[5], p[2], p[3]];\n  if (p[0] > p[2]) p = [p[2], p[3], p[0], p[1], p[4], p[5]];\n  const [x1, y1, x2, y2, x3, y3] = p;\n  if (!(x3 - x1 > 1e-12)) return;\n  // the long side at the middle corner; the larger y is always the top, so\n  // every triangle winds the same way (overlapping ones never cancel)\n  const y13 = y1 + ((y3 - y1) * (x2 - x1)) / (x3 - x1);\n  out.push(\n    x1,\n    y1,\n    y1,\n    x2,\n    Math.max(y2, y13),\n    Math.min(y2, y13),\n    x3,\n    y3,\n    y3,\n    gap,\n    gap,\n    gap,\n  );\n};\n\n/** Corners of a filled (\"stealth\") arrowhead: tip, left, notch, right */\nconst arrowCorners = (\n  tx: number,\n  ty: number,\n  ux: number,\n  uy: number,\n  length: number,\n): number[] => {\n  const w = length * 0.5;\n  const bx = tx - ux * length;\n  const by = ty - uy * length;\n  return [\n    tx,\n    ty,\n    bx - uy * w,\n    by + ux * w,\n    tx - ux * length * 0.72,\n    ty - uy * length * 0.72,\n    bx + uy * w,\n    by - ux * w,\n  ];\n};\n\n/**\n * Filled arrowhead at (tx, ty) pointing along (ux, uy): area triangles in\n * `fill`, its outline (anti-aliased edges) in `outline`\n */\nexport const filledArrow = (\n  fill: number[],\n  outline: number[],\n  tx: number,\n  ty: number,\n  ux: number,\n  uy: number,\n  length: number,\n  gap: number,\n): void => {\n  const [x0, y0, lx, ly, nx, ny, rx, ry] = arrowCorners(tx, ty, ux, uy, length);\n  triangleArea(fill, x0, y0, lx, ly, nx, ny, gap);\n  triangleArea(fill, x0, y0, nx, ny, rx, ry, gap);\n  outline.push(lx, ly, x0, y0, rx, ry, nx, ny, lx, ly, gap, gap);\n};\n\n/** Splits a polyline into dashes (`dash` / `space` in layout units) */\nexport const dashPath = (\n  points: readonly number[],\n  dash: number,\n  space: number,\n  gap: number,\n): number[] => {\n  const out: number[] = [];\n  const total = pathLength(points);\n  const period = dash + space;\n  if (period <= 0 || total <= 0) return points.slice();\n  for (let start = 0; start < total; start += period) {\n    const end = Math.min(total, start + dash);\n    const a = pointAt(points, start);\n    out.push(a[0], a[1]);\n    let walked = 0;\n    for (let i = 2; i < points.length; i += 2) {\n      walked += Math.hypot(\n        points[i] - points[i - 2],\n        points[i + 1] - points[i - 1],\n      );\n      if (walked > start && walked < end) out.push(points[i], points[i + 1]);\n    }\n    const b = pointAt(points, end);\n    out.push(b[0], b[1], gap, gap);\n  }\n  return out;\n};\n\n/** Squared distance from (px, py) to a polyline */\nexport const distanceToPath = (\n  points: readonly number[],\n  px: number,\n  py: number,\n): number => {\n  let best = Infinity;\n  for (let i = 2; i < points.length; i += 2) {\n    const ax = points[i - 2];\n    const ay = points[i - 1];\n    const dx = points[i] - ax;\n    const dy = points[i + 1] - ay;\n    const l = dx * dx + dy * dy;\n    const t =\n      l > 0\n        ? Math.max(0, Math.min(1, ((px - ax) * dx + (py - ay) * dy) / l))\n        : 0;\n    const qx = ax + dx * t - px;\n    const qy = ay + dy * t - py;\n    best = Math.min(best, qx * qx + qy * qy);\n  }\n  return best;\n};\n"],"mappings":";AAKA,IAAaA,KACX,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,MACS;CACT,IAAMC,IACJ,KAAK,MAAMC,IAAKC,GAAIC,IAAKC,CAAE,IAC3B,KAAK,MAAMC,IAAKJ,GAAIK,IAAKH,CAAE,IAC3B,KAAK,MAAMI,IAAKF,GAAIG,IAAKF,CAAE,GACvBG,IAAW,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,KAAKT,IAAS,EAAE,CAAC,CAAC;CACjE,KAAK,IAAIU,IAAI,GAAGA,KAAKD,GAAU,KAAK;EAClC,IAAME,IAAID,IAAID,GACRG,IAAI,IAAID,GACRE,IAAID,IAAIA,IAAIA,GACZE,IAAI,IAAIF,IAAIA,IAAID,GAChBI,IAAI,IAAIH,IAAID,IAAIA,GAChBK,IAAIL,IAAIA,IAAIA;EAClB,EAAI,KACFE,IAAIX,IAAKY,IAAIb,IAAKc,IAAIV,IAAKW,IAAIT,GAC/BM,IAAIT,IAAKU,IAAIX,IAAKY,IAAIT,IAAKU,IAAIR,CACjC;CACF;AACF,GAGaS,KACX,GACA,GACA,GACA,GACA,GACA,MACa;CACb,IAAMC,IAAM,CAAChB,GAAIE,CAAE;CAYnB,OAXAL,EACEmB,GACAhB,GACAE,GACAF,KAAOiB,IAAKjB,KAAM,IAAK,GACvBE,KAAOgB,IAAKhB,KAAM,IAAK,GACvBH,KAAOkB,IAAKlB,KAAM,IAAK,GACvBE,KAAOiB,IAAKjB,KAAM,IAAK,GACvBF,GACAE,CACF,GACOe;AACT,GAMaG,KACX,GACA,MACa;CACb,IAAMH,IAAM,CAACI,EAAO,IAAIA,EAAO,EAAE;CACjC,KAAK,IAAI,IAAI,GAAG,IAAIA,EAAO,QAAQ,KAAK,GAAG;EACzC,IAAMpB,IAAKoB,EAAO,IAAI,IAChBlB,IAAKkB,EAAO,IAAI,IAChBrB,IAAKqB,EAAO,IACZnB,IAAKmB,EAAO,IAAI;EACtB,IAAIC,GAAU;GACZ,IAAMC,KAAMpB,IAAKD,KAAM;GACvB,EAAYe,GAAKhB,GAAIE,GAAIF,GAAIsB,GAAIvB,GAAIuB,GAAIvB,GAAIE,CAAE;EACjD,OAAO;GACL,IAAMsB,KAAMvB,IAAKD,KAAM;GACvB,EAAYiB,GAAKhB,GAAIE,GAAIqB,GAAIrB,GAAIqB,GAAItB,GAAIF,GAAIE,CAAE;EACjD;CACF;CACA,OAAOe;AACT,GAGMQ,KACJ,GACA,GACA,GACA,GACA,GACA,MACG;CACH,IAAMC,IAAKT,EAAIA,EAAI,SAAS,IACtBU,IAAKV,EAAIA,EAAI,SAAS,IACtBW,IAAQ,KAAK,MAAMV,IAAKQ,GAAIP,IAAKQ,CAAE,GACnCE,IAAS,KAAK,MAAMC,IAAKZ,GAAIa,IAAKZ,CAAE,GACpCa,IAAI,KAAK,IAAIC,GAAQL,IAAQ,GAAGC,IAAS,CAAC;CAChD,IAAIG,IAAI,IAAK;EACX,EAAI,KAAKd,GAAIC,CAAE;EACf;CACF;CACA,IAAMe,IAAKhB,KAAOA,IAAKQ,KAAME,IAASI,GAChCG,IAAKhB,KAAOA,IAAKQ,KAAMC,IAASI,GAChCI,IAAKlB,KAAOY,IAAKZ,KAAMW,IAAUG,GACjCK,IAAKlB,KAAOY,IAAKZ,KAAMU,IAAUG;CACvC,EAAI,KAAKE,GAAIC,CAAE;CAEf,KAAK,IAAI1B,IAAI,GAAGA,KAAK,GAAG,KAAK;EAC3B,IAAMC,IAAID,IAAI,GACRE,IAAI,IAAID;EACd,EAAI,KACFC,IAAIA,IAAIuB,IAAK,IAAIvB,IAAID,IAAIQ,IAAKR,IAAIA,IAAI0B,GACtCzB,IAAIA,IAAIwB,IAAK,IAAIxB,IAAID,IAAIS,IAAKT,IAAIA,IAAI2B,CACxC;CACF;AACF,GAMaC,KACX,GACA,GACA,MACa;CACb,IAAMC,IAAoB,CAAClB,EAAO,IAAIA,EAAO,EAAE;CAC/C,KAAK,IAAIZ,IAAI,GAAGA,IAAIY,EAAO,QAAQ,KAAK,GAAG;EACzC,IAAMpB,IAAKoB,EAAOZ,IAAI,IAChBN,IAAKkB,EAAOZ,IAAI,IAChBT,IAAKqB,EAAOZ,IACZP,IAAKmB,EAAOZ,IAAI;EACtB,IAAI,KAAK,IAAIa,IAAWtB,IAAKC,IAAKC,IAAKC,CAAE,IAAI,IAAK;GAChD,IAAImB,GAAU;IACZ,IAAMC,KAAMpB,IAAKD,KAAM;IACvB,EAAQ,KAAKD,GAAIsB,GAAIvB,GAAIuB,CAAE;GAC7B,OAAO;IACL,IAAMC,KAAMvB,IAAKD,KAAM;IACvB,EAAQ,KAAKwB,GAAIrB,GAAIqB,GAAItB,CAAE;GAC7B;EACF;EACA,EAAQ,KAAKF,GAAIE,CAAE;CACrB;CACA,OAAOsC,EAAaD,GAASN,CAAM;AACrC,GAGaO,KACX,GACA,MACa;CACb,IAAMvB,IAAM,CAACsB,EAAQ,IAAIA,EAAQ,EAAE,GAC7BE,IAAOF,EAAQ,SAAS;CAC9B,KAAK,IAAI9B,IAAI,GAAGA,IAAIgC,GAAM,KAAK,GAC7B,EACExB,GACAsB,EAAQ9B,IACR8B,EAAQ9B,IAAI,IACZ8B,EAAQ9B,IAAI,IACZ8B,EAAQ9B,IAAI,IACZwB,CACF;CAGF,OADIQ,KAAQ,KAAGxB,EAAI,KAAKsB,EAAQE,IAAOF,EAAQE,IAAO,EAAE,GACjDxB;AACT,GAGayB,KACX,GACA,GACA,GACA,IAAO,MACM;CACb,IAAMxB,KAAMgB,IAAKE,KAAM,GACjBJ,IAAI,KAAK,IAAII,IAAKF,CAAE,IAAI,GACxB1B,IAAW,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,KAAKwB,IAAI,EAAE,CAAC,CAAC,GAC1Df,IAAgB,CAAC,GACjB0B,IAAOT,IAAKE,IAAK,KAAK,KAAK,GAC3BQ,IAAKV,IAAKE,IAAK,IAAI,KAAK;CAC9B,KAAK,IAAI3B,IAAI,GAAGA,KAAKD,GAAU,KAAK;EAClC,IAAMI,IAAI+B,KAASC,IAAKD,KAAQlC,IAAKD;EACrC,EAAI,KAAKU,IAAKc,IAAI,KAAK,IAAIpB,CAAC,GAAGiC,IAAIb,IAAIc,IAAO,KAAK,IAAIlC,CAAC,CAAC;CAC3D;CACA,OAAOK;AACT,GAOa8B,KACX,GACA,GACA,GACA,GACA,GACA,MACa;CACb,IAAMC,IAAO,KACPC,IAAO,IACPC,IAAQ,KAAK,IAAIC,GAAOC,CAAG,IAAIC,IAAO,KACtCC,IAAKC,IAAQP,GACbQ,IAAKD,IAAQP,GACb/B,IAAM,CAACwC,IAAI,KAAK,IAAIH,CAAE,IAAIH,GAAON,IAAI,KAAK,IAAIS,CAAE,IAAIH,CAAK;CAY/D,OAXArD,EACEmB,GACAA,EAAI,IACJA,EAAI,IACJwC,IAAI,KAAK,IAAIF,IAAQN,CAAI,IAAIC,GAC7BL,IAAI,KAAK,IAAIU,IAAQN,CAAI,IAAIC,GAC7BO,IAAI,KAAK,IAAIF,IAAQN,CAAI,IAAIC,GAC7BL,IAAI,KAAK,IAAIU,IAAQN,CAAI,IAAIC,GAC7BO,IAAI,KAAK,IAAID,CAAE,IAAIJ,GACnBP,IAAI,KAAK,IAAIW,CAAE,IAAIJ,CACrB,GACOnC;AACT,GAGayC,KAAc,MAAsC;CAC/D,IAAI3D,IAAS;CACb,KAAK,IAAIU,IAAI,GAAGA,IAAIY,EAAO,QAAQ,KAAK,GACtC,KAAU,KAAK,MACbA,EAAOZ,KAAKY,EAAOZ,IAAI,IACvBY,EAAOZ,IAAI,KAAKY,EAAOZ,IAAI,EAC7B;CACF,OAAOV;AACT,GAGa4D,KACX,GACA,GACA,MACa;CACb,IAAMC,IAAQF,EAAWrC,CAAM;CAC/B,IAAIuC,KAAST,IAAQC,IAAM,MAAM;EAE/B,IAAI/B,EAAO,SAAS,GAAG,OAAOA;EAE9B,IAAMwC,IAAIC,EAAQzC,IADR8B,IAAQC,IAAM,IAAID,KAASA,IAAQC,KAAO,MACtBQ,CAAK;EACnC,OAAO;GAACC,EAAE;GAAIA,EAAE;GAAIA,EAAE;GAAIA,EAAE;EAAE;CAChC;CACA,IAAM5C,IAAgB,CAAC,GACjB8C,IAAaD,EAAQzC,GAAQ8B,CAAK,GAClCa,IAAWF,EAAQzC,GAAQuC,IAAQR,CAAG;CAC5C,EAAI,KAAKW,EAAW,IAAIA,EAAW,EAAE;CACrC,IAAIE,IAAS;CACb,KAAK,IAAIxD,IAAI,GAAGA,IAAIY,EAAO,QAAQ,KAAK,GAKtC,AAJA,KAAU,KAAK,MACbA,EAAOZ,KAAKY,EAAOZ,IAAI,IACvBY,EAAOZ,IAAI,KAAKY,EAAOZ,IAAI,EAC7B,GACIwD,IAASd,KAASc,IAASL,IAAQR,KACrCnC,EAAI,KAAKI,EAAOZ,IAAIY,EAAOZ,IAAI,EAAE;CAGrC,OADAQ,EAAI,KAAK+C,EAAS,IAAIA,EAAS,EAAE,GAC1B/C;AACT,GAGa6C,KACX,GACA,MACqC;CACrC,IAAIG,IAAS;CACb,KAAK,IAAIxD,IAAI,GAAGA,IAAIY,EAAO,QAAQ,KAAK,GAAG;EACzC,IAAM6C,IAAK7C,EAAOZ,KAAKY,EAAOZ,IAAI,IAC5B0D,IAAK9C,EAAOZ,IAAI,KAAKY,EAAOZ,IAAI,IAChC2D,IAAI,KAAK,MAAMF,GAAIC,CAAE;EAC3B,IAAIF,IAASG,KAAKC,KAAYD,IAAI,GAAG;GACnC,IAAM1D,KAAK2D,IAAWJ,KAAUG;GAChC,OAAO;IAAC/C,EAAOZ,IAAI,KAAKyD,IAAKxD;IAAGW,EAAOZ,IAAI,KAAK0D,IAAKzD;IAAGwD,IAAKE;IAAGD,IAAKC;GAAC;EACxE;EACA,KAAUA;CACZ;CACA,IAAME,IAAIjD,EAAO,SAAS,GACpB6C,IAAKI,KAAK,IAAIjD,EAAOiD,KAAKjD,EAAOiD,IAAI,KAAK,GAC1CH,IAAKG,KAAK,IAAIjD,EAAOiD,IAAI,KAAKjD,EAAOiD,IAAI,KAAK,GAC9CF,IAAI,KAAK,MAAMF,GAAIC,CAAE,KAAK;CAChC,OAAO;EAAC9C,EAAOiD;EAAIjD,EAAOiD,IAAI;EAAIJ,IAAKE;EAAGD,IAAKC;CAAC;AAClD,GAGaG,KAAgB,MAAgD;CAC3E,KAAK,IAAI9D,IAAIY,EAAO,SAAS,GAAGZ,KAAK,GAAG,KAAK,GAAG;EAC9C,IAAMyD,IAAK7C,EAAOA,EAAO,SAAS,KAAKA,EAAOZ,IACxC0D,IAAK9C,EAAOA,EAAO,SAAS,KAAKA,EAAOZ,IAAI,IAC5C2D,IAAI,KAAK,MAAMF,GAAIC,CAAE;EAC3B,IAAIC,IAAI,MAAM,OAAO,CAACF,IAAKE,GAAGD,IAAKC,CAAC;CACtC;CACA,OAAO,CAAC,GAAG,CAAC;AACd,GAGaI,KACX,GACA,GACA,GACA,GACA,MACW;CACX,IAAI,CAACC,GAAK,OAAOC,IAAQ;CACzB,IAAMxC,IAAK,KAAK,IAAIyC,CAAE,GAChBxC,IAAK,KAAK,IAAIyC,CAAE,GAChBC,IAAK3C,IAAK,OAAOwC,IAAQ,IAAIxC,IAAK,UAClC4C,IAAK3C,IAAK,OAAO4C,IAAS,IAAI5C,IAAK;CACzC,OAAO,KAAK,IAAI0C,GAAIC,CAAE;AACxB,GAMaE,KACX,GACA,GACA,GACA,GACA,GACA,GACA,MACS;CACT,IAAMC,IAAIlF,IAAS,KACbqC,IAAKyC,IAAKF,IAAK5E,GACfsC,IAAKyC,IAAKF,IAAK7E,GACfmF,IAAK9C,IAAKwC,IAAKK,GACfE,IAAK9C,IAAKsC,IAAKM,GACfG,IAAKhD,IAAKwC,IAAKK,GACfI,IAAKhD,IAAKsC,IAAKM;CAErB,AADAhE,EAAI,KAAKiE,GAAIC,GAAIN,GAAIC,GAAIM,GAAIC,GAAIH,GAAIC,GAAIG,GAAKA,CAAG,GACjDrE,EAAI,KAAK4D,GAAIC,GAAI1C,GAAIC,GAAIiD,GAAKA,CAAG;CACjC,IAAM9D,KAAM0D,IAAK9C,KAAM,GACjBb,KAAM4D,IAAK9C,KAAM,GACjBP,KAAMsD,IAAKhD,KAAM,GACjBL,KAAMsD,IAAKhD,KAAM;CACvB,EAAI,KAAKwC,GAAIC,GAAItD,GAAID,GAAI+D,GAAKA,GAAKT,GAAIC,GAAIhD,GAAIC,GAAIuD,GAAKA,CAAG;AAC7D,GAGaC,KACX,GACA,GACA,GACA,GACA,GACA,GACA,GACA,MACS;CAET,IAAI1B,IAAI;EAAC3B;EAAIC;EAAIC;EAAIC;EAAInB;EAAIC;CAAE;CAG/B,AAFI0C,EAAE,KAAKA,EAAE,OAAI,IAAI;EAACA,EAAE;EAAIA,EAAE;EAAIA,EAAE;EAAIA,EAAE;EAAIA,EAAE;EAAIA,EAAE;CAAE,IACpDA,EAAE,KAAKA,EAAE,OAAI,IAAI;EAACA,EAAE;EAAIA,EAAE;EAAIA,EAAE;EAAIA,EAAE;EAAIA,EAAE;EAAIA,EAAE;CAAE,IACpDA,EAAE,KAAKA,EAAE,OAAI,IAAI;EAACA,EAAE;EAAIA,EAAE;EAAIA,EAAE;EAAIA,EAAE;EAAIA,EAAE;EAAIA,EAAE;CAAE;CACxD,IAAM,CAAC7D,GAAIE,GAAIE,GAAIC,GAAIC,GAAIC,KAAMsD;CACjC,IAAI,EAAEvD,IAAKN,IAAK,QAAQ;CAGxB,IAAMwF,IAAMtF,KAAOK,IAAKL,MAAOE,IAAKJ,MAAQM,IAAKN;CACjD,EAAI,KACFA,GACAE,GACAA,GACAE,GACA,KAAK,IAAIC,GAAImF,CAAG,GAChB,KAAK,IAAInF,GAAImF,CAAG,GAChBlF,GACAC,GACAA,GACA+E,GACAA,GACAA,CACF;AACF,GAGMG,KACJ,GACA,GACA,GACA,GACA,MACa;CACb,IAAMR,IAAIlF,IAAS,IACbqC,IAAKyC,IAAKF,IAAK5E,GACfsC,IAAKyC,IAAKF,IAAK7E;CACrB,OAAO;EACL8E;EACAC;EACA1C,IAAKwC,IAAKK;EACV5C,IAAKsC,IAAKM;EACVJ,IAAKF,IAAK5E,IAAS;EACnB+E,IAAKF,IAAK7E,IAAS;EACnBqC,IAAKwC,IAAKK;EACV5C,IAAKsC,IAAKM;CACZ;AACF,GAMaS,KACX,GACA,GACA,GACA,GACA,GACA,GACA,GACA,MACS;CACT,IAAM,CAACzF,GAAIE,GAAI+E,GAAIC,GAAIrD,GAAIC,GAAIqD,GAAIC,KAAMI,EAAaZ,GAAIC,GAAIH,GAAIC,GAAI7E,CAAM;CAG5E,AAFAwF,EAAaI,GAAM1F,GAAIE,GAAI+E,GAAIC,GAAIrD,GAAIC,GAAIuD,CAAG,GAC9CC,EAAaI,GAAM1F,GAAIE,GAAI2B,GAAIC,GAAIqD,GAAIC,GAAIC,CAAG,GAC9CM,EAAQ,KAAKV,GAAIC,GAAIlF,GAAIE,GAAIiF,GAAIC,GAAIvD,GAAIC,GAAImD,GAAIC,GAAIG,GAAKA,CAAG;AAC/D,GAGaO,KACX,GACA,GACA,GACA,MACa;CACb,IAAM5E,IAAgB,CAAC,GACjB2C,IAAQF,EAAWrC,CAAM,GACzByE,IAASC,IAAOC;CACtB,IAAIF,KAAU,KAAKlC,KAAS,GAAG,OAAOvC,EAAO,MAAM;CACnD,KAAK,IAAI8B,IAAQ,GAAGA,IAAQS,GAAO,KAASkC,GAAQ;EAClD,IAAM1C,IAAM,KAAK,IAAIQ,GAAOT,IAAQ4C,CAAI,GAClCnF,IAAIkD,EAAQzC,GAAQ8B,CAAK;EAC/B,EAAI,KAAKvC,EAAE,IAAIA,EAAE,EAAE;EACnB,IAAIqD,IAAS;EACb,KAAK,IAAIxD,IAAI,GAAGA,IAAIY,EAAO,QAAQ,KAAK,GAKtC,AAJA,KAAU,KAAK,MACbA,EAAOZ,KAAKY,EAAOZ,IAAI,IACvBY,EAAOZ,IAAI,KAAKY,EAAOZ,IAAI,EAC7B,GACIwD,IAASd,KAASc,IAASb,KAAKnC,EAAI,KAAKI,EAAOZ,IAAIY,EAAOZ,IAAI,EAAE;EAEvE,IAAMI,IAAIiD,EAAQzC,GAAQ+B,CAAG;EAC7B,EAAI,KAAKvC,EAAE,IAAIA,EAAE,IAAIyE,GAAKA,CAAG;CAC/B;CACA,OAAOrE;AACT,GAGagF,KACX,GACA,GACA,MACW;CACX,IAAIC,IAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI7E,EAAO,QAAQ,KAAK,GAAG;EACzC,IAAMa,IAAKb,EAAO,IAAI,IAChBc,IAAKd,EAAO,IAAI,IAChB6C,IAAK7C,EAAO,KAAKa,GACjBiC,IAAK9C,EAAO,IAAI,KAAKc,GACrB,IAAI+B,IAAKA,IAAKC,IAAKA,GACnBzD,IACJ,IAAI,IACA,KAAK,IAAI,GAAG,KAAK,IAAI,KAAKgB,IAAKQ,KAAMgC,KAAMvC,IAAKQ,KAAMgC,KAAM,CAAC,CAAC,IAC9D,GACAgC,IAAKjE,IAAKgC,IAAKxD,IAAIgB,GACnB0E,IAAKjE,IAAKgC,IAAKzD,IAAIiB;EACzB,IAAO,KAAK,IAAIuE,GAAMC,IAAKA,IAAKC,IAAKA,CAAE;CACzC;CACA,OAAOF;AACT"}

package/dist/charts/engine/graph/index.cjs

@@ -0,0 +1 @@
+const e=require("./force.cjs"),t=require("./circular.cjs"),n=require("./dag.cjs"),r=require("./tree.cjs"),i=require("./chart.cjs");exports.arcLayout=t.arcLayout,exports.circularLayout=t.circularLayout,exports.countCrossings=n.countCrossings,exports.createForceSimulation=e.createForceSimulation,exports.createGraphChart=i.createGraphChart,exports.criticalPath=n.criticalPath,exports.dagLayout=n.dagLayout,exports.forceLayout=e.forceLayout,exports.treeLayout=r.treeLayout;

package/dist/charts/engine/graph/index.d.cts

@@ -0,0 +1,6 @@
+export { createGraphChart } from './chart.cjs';
+export { createForceSimulation, forceLayout } from './force.cjs';
+export { countCrossings, criticalPath, dagLayout } from './dag.cjs';
+export { treeLayout } from './tree.cjs';
+export { arcLayout, circularLayout } from './circular.cjs';
+export type { GraphCircularLayoutOptions, GraphCircularLayoutResult, GraphDagLayoutOptions, GraphDagLayoutResult, GraphForceLayoutOptions, GraphForceSimulation, GraphChartEventMap, GraphChartInstance, GraphChartLabels, GraphChartOptions, GraphCircularOptions, GraphCriticalPath, GraphDagOptions, GraphData, GraphDirection, GraphEdge, GraphEdgeStyle, GraphForceOptions, GraphGroup, GraphGroupToggleEvent, GraphHoverEvent, GraphInteractionOptions, GraphLayoutEndEvent, GraphLayoutResult, GraphLayoutType, GraphLegendOptions, GraphNode, GraphNodeShape, GraphPoint, GraphSelectEvent, GraphToggleEvent, GraphTooltipOptions, GraphTreeOptions, GraphTreeLayoutOptions, GraphTreeLayoutResult, } from './types.cjs';

package/dist/charts/engine/graph/index.d.ts

@@ -0,0 +1,6 @@
+export { createGraphChart } from './chart.js';
+export { createForceSimulation, forceLayout } from './force.js';
+export { countCrossings, criticalPath, dagLayout } from './dag.js';
+export { treeLayout } from './tree.js';
+export { arcLayout, circularLayout } from './circular.js';
+export type { GraphCircularLayoutOptions, GraphCircularLayoutResult, GraphDagLayoutOptions, GraphDagLayoutResult, GraphForceLayoutOptions, GraphForceSimulation, GraphChartEventMap, GraphChartInstance, GraphChartLabels, GraphChartOptions, GraphCircularOptions, GraphCriticalPath, GraphDagOptions, GraphData, GraphDirection, GraphEdge, GraphEdgeStyle, GraphForceOptions, GraphGroup, GraphGroupToggleEvent, GraphHoverEvent, GraphInteractionOptions, GraphLayoutEndEvent, GraphLayoutResult, GraphLayoutType, GraphLegendOptions, GraphNode, GraphNodeShape, GraphPoint, GraphSelectEvent, GraphToggleEvent, GraphTooltipOptions, GraphTreeOptions, GraphTreeLayoutOptions, GraphTreeLayoutResult, } from './types.js';

package/dist/charts/engine/graph/index.js

@@ -0,0 +1,6 @@
+import { createForceSimulation as e, forceLayout as t } from "./force.js";
+import { arcLayout as n, circularLayout as r } from "./circular.js";
+import { countCrossings as i, criticalPath as a, dagLayout as o } from "./dag.js";
+import { treeLayout as s } from "./tree.js";
+import { createGraphChart as c } from "./chart.js";
+export { n as arcLayout, r as circularLayout, i as countCrossings, e as createForceSimulation, c as createGraphChart, a as criticalPath, o as dagLayout, t as forceLayout, s as treeLayout };

package/dist/charts/engine/graph/labels.cjs

@@ -0,0 +1,2 @@
+const e=require("../locale.cjs");var t={en:{chart:`Network graph`,tree:`Tree diagram`,dag:`Dependency graph`,summary:`{nodes} nodes, {edges} links.`,groupsSummary:`Groups: {groups}.`,keyboardHelp:`Use the arrow keys to move between nodes, Enter to select, + and - to zoom, 0 to fit.`,nodeFocus:`{name}, {degree} links`,nodeFocusGroup:`{name} ({group}), {degree} links`,selected:`{count} selected`,selectionCleared:`Selection cleared`,expanded:`{name} expanded`,collapsed:`{name} collapsed, {count} hidden`,shown:`{name}: shown`,hidden:`{name}: hidden`,degree:`Links`,incoming:`Incoming`,outgoing:`Outgoing`,value:`Value`,group:`Group`,hiddenChildren:`Hidden`,critical:`Critical path`,zoomIn:`Zoom in`,zoomOut:`Zoom out`,fit:`Fit to view`,zoomHint:`Use {key} + scroll to zoom`,listSeparator:`, `},zh:{chart:`关系图`,tree:`树图`,dag:`依赖图`,summary:`{nodes} 个节点，{edges} 条关系。`,groupsSummary:`分组：{groups}。`,keyboardHelp:`使用方向键在节点间移动，Enter 选中，+ 和 - 缩放，0 适应视图。`,nodeFocus:`{name}，{degree} 条关系`,nodeFocusGroup:`{name}（{group}），{degree} 条关系`,selected:`已选中 {count} 个`,selectionCleared:`已清除选择`,expanded:`{name} 已展开`,collapsed:`{name} 已折叠，隐藏 {count} 个`,shown:`{name}：已显示`,hidden:`{name}：已隐藏`,degree:`关系数`,incoming:`入边`,outgoing:`出边`,value:`数值`,group:`分组`,hiddenChildren:`已折叠`,critical:`关键路径`,zoomIn:`放大`,zoomOut:`缩小`,fit:`适应视图`,zoomHint:`按住 {key} 并滚动以缩放`,listSeparator:`、`},ja:{chart:`ネットワーク図`,tree:`ツリー図`,dag:`依存関係グラフ`,summary:`ノード {nodes} 個、リンク {edges} 本。`,groupsSummary:`グループ：{groups}。`,keyboardHelp:`矢印キーでノード間を移動、Enter で選択、+ と - でズーム、0 で全体表示。`,nodeFocus:`{name}、リンク {degree} 本`,nodeFocusGroup:`{name}（{group}）、リンク {degree} 本`,selected:`{count} 個を選択`,selectionCleared:`選択を解除しました`,expanded:`{name} を展開しました`,collapsed:`{name} を折りたたみました（{count} 個非表示）`,shown:`{name}：表示`,hidden:`{name}：非表示`,degree:`リンク数`,incoming:`入力`,outgoing:`出力`,value:`値`,group:`グループ`,hiddenChildren:`非表示`,critical:`クリティカルパス`,zoomIn:`拡大`,zoomOut:`縮小`,fit:`全体表示`,zoomHint:`{key} を押しながらスクロールでズーム`,listSeparator:`、`},fr:{chart:`Graphe de relations`,tree:`Arbre`,dag:`Graphe de dépendances`,summary:`{nodes} nœuds, {edges} liens.`,groupsSummary:`Groupes : {groups}.`,keyboardHelp:`Flèches pour passer d’un nœud à l’autre, Entrée pour sélectionner, + et - pour zoomer, 0 pour tout afficher.`,nodeFocus:`{name}, {degree} liens`,nodeFocusGroup:`{name} ({group}), {degree} liens`,selected:`{count} sélectionné(s)`,selectionCleared:`Sélection effacée`,expanded:`{name} déplié`,collapsed:`{name} replié, {count} masqué(s)`,shown:`{name} : affiché`,hidden:`{name} : masqué`,degree:`Liens`,incoming:`Entrants`,outgoing:`Sortants`,value:`Valeur`,group:`Groupe`,hiddenChildren:`Masqués`,critical:`Chemin critique`,zoomIn:`Zoom avant`,zoomOut:`Zoom arrière`,fit:`Tout afficher`,zoomHint:`Utilisez {key} + molette pour zoomer`,listSeparator:`, `}},n=(e,t)=>e.replace(/\{(\w+)\}/g,(e,n)=>n in t?String(t[n]):e),r=(n,r)=>{let i=e.resolveLocale(n);return{locale:i,labels:e.localeLabels(t,i,r),count:t=>e.numberFormat(i).format(t),value:t=>Number.isFinite(t)?e.numberFormat(i,{maximumFractionDigits:2}).format(t):`–`}};exports.GRAPH_LABELS=t,exports.fill=n,exports.graphLocale=r;
+//# sourceMappingURL=labels.cjs.map

package/dist/charts/engine/graph/labels.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"labels.cjs","names":["resolveLocale","localeLabels","numberFormat","require_locale","GRAPH_LABELS","fill","template","key","values","match","graphLocale","resolved","locale","overrides","value"],"sources":["../../../../../charts/src/engine/graph/labels.ts"],"sourcesContent":["// Built-in texts of the graph charts (English, Chinese, Japanese, French)\n// and the number formatting of their tooltips.\n\nimport {\n  localeLabels,\n  numberFormat,\n  resolveLocale,\n  type LabelDictionary,\n} from \"../locale\";\nimport type { GraphChartLabels } from \"./types\";\n\nexport const GRAPH_LABELS: LabelDictionary<GraphChartLabels> = {\n  en: {\n    chart: \"Network graph\",\n    tree: \"Tree diagram\",\n    dag: \"Dependency graph\",\n    summary: \"{nodes} nodes, {edges} links.\",\n    groupsSummary: \"Groups: {groups}.\",\n    keyboardHelp:\n      \"Use the arrow keys to move between nodes, Enter to select, + and - to zoom, 0 to fit.\",\n    nodeFocus: \"{name}, {degree} links\",\n    nodeFocusGroup: \"{name} ({group}), {degree} links\",\n    selected: \"{count} selected\",\n    selectionCleared: \"Selection cleared\",\n    expanded: \"{name} expanded\",\n    collapsed: \"{name} collapsed, {count} hidden\",\n    shown: \"{name}: shown\",\n    hidden: \"{name}: hidden\",\n    degree: \"Links\",\n    incoming: \"Incoming\",\n    outgoing: \"Outgoing\",\n    value: \"Value\",\n    group: \"Group\",\n    hiddenChildren: \"Hidden\",\n    critical: \"Critical path\",\n    zoomIn: \"Zoom in\",\n    zoomOut: \"Zoom out\",\n    fit: \"Fit to view\",\n    zoomHint: \"Use {key} + scroll to zoom\",\n    listSeparator: \", \",\n  },\n  zh: {\n    chart: \"关系图\",\n    tree: \"树图\",\n    dag: \"依赖图\",\n    summary: \"{nodes} 个节点，{edges} 条关系。\",\n    groupsSummary: \"分组：{groups}。\",\n    keyboardHelp:\n      \"使用方向键在节点间移动，Enter 选中，+ 和 - 缩放，0 适应视图。\",\n    nodeFocus: \"{name}，{degree} 条关系\",\n    nodeFocusGroup: \"{name}（{group}），{degree} 条关系\",\n    selected: \"已选中 {count} 个\",\n    selectionCleared: \"已清除选择\",\n    expanded: \"{name} 已展开\",\n    collapsed: \"{name} 已折叠，隐藏 {count} 个\",\n    shown: \"{name}：已显示\",\n    hidden: \"{name}：已隐藏\",\n    degree: \"关系数\",\n    incoming: \"入边\",\n    outgoing: \"出边\",\n    value: \"数值\",\n    group: \"分组\",\n    hiddenChildren: \"已折叠\",\n    critical: \"关键路径\",\n    zoomIn: \"放大\",\n    zoomOut: \"缩小\",\n    fit: \"适应视图\",\n    zoomHint: \"按住 {key} 并滚动以缩放\",\n    listSeparator: \"、\",\n  },\n  ja: {\n    chart: \"ネットワーク図\",\n    tree: \"ツリー図\",\n    dag: \"依存関係グラフ\",\n    summary: \"ノード {nodes} 個、リンク {edges} 本。\",\n    groupsSummary: \"グループ：{groups}。\",\n    keyboardHelp:\n      \"矢印キーでノード間を移動、Enter で選択、+ と - でズーム、0 で全体表示。\",\n    nodeFocus: \"{name}、リンク {degree} 本\",\n    nodeFocusGroup: \"{name}（{group}）、リンク {degree} 本\",\n    selected: \"{count} 個を選択\",\n    selectionCleared: \"選択を解除しました\",\n    expanded: \"{name} を展開しました\",\n    collapsed: \"{name} を折りたたみました（{count} 個非表示）\",\n    shown: \"{name}：表示\",\n    hidden: \"{name}：非表示\",\n    degree: \"リンク数\",\n    incoming: \"入力\",\n    outgoing: \"出力\",\n    value: \"値\",\n    group: \"グループ\",\n    hiddenChildren: \"非表示\",\n    critical: \"クリティカルパス\",\n    zoomIn: \"拡大\",\n    zoomOut: \"縮小\",\n    fit: \"全体表示\",\n    zoomHint: \"{key} を押しながらスクロールでズーム\",\n    listSeparator: \"、\",\n  },\n  fr: {\n    chart: \"Graphe de relations\",\n    tree: \"Arbre\",\n    dag: \"Graphe de dépendances\",\n    summary: \"{nodes} nœuds, {edges} liens.\",\n    groupsSummary: \"Groupes : {groups}.\",\n    keyboardHelp:\n      \"Flèches pour passer d’un nœud à l’autre, Entrée pour sélectionner, + et - pour zoomer, 0 pour tout afficher.\",\n    nodeFocus: \"{name}, {degree} liens\",\n    nodeFocusGroup: \"{name} ({group}), {degree} liens\",\n    selected: \"{count} sélectionné(s)\",\n    selectionCleared: \"Sélection effacée\",\n    expanded: \"{name} déplié\",\n    collapsed: \"{name} replié, {count} masqué(s)\",\n    shown: \"{name} : affiché\",\n    hidden: \"{name} : masqué\",\n    degree: \"Liens\",\n    incoming: \"Entrants\",\n    outgoing: \"Sortants\",\n    value: \"Valeur\",\n    group: \"Groupe\",\n    hiddenChildren: \"Masqués\",\n    critical: \"Chemin critique\",\n    zoomIn: \"Zoom avant\",\n    zoomOut: \"Zoom arrière\",\n    fit: \"Tout afficher\",\n    zoomHint: \"Utilisez {key} + molette pour zoomer\",\n    listSeparator: \", \",\n  },\n};\n\n/** Replaces `{name}` placeholders */\nexport const fill = (\n  template: string,\n  values: Record<string, string | number>,\n): string =>\n  template.replace(/\\{(\\w+)\\}/g, (match, key: string) =>\n    key in values ? String(values[key]) : match,\n  );\n\nexport interface GraphLocale {\n  locale: string;\n  labels: GraphChartLabels;\n  count: (value: number) => string;\n  value: (value: number) => string;\n}\n\nexport const graphLocale = (\n  locale: string | undefined,\n  overrides: Partial<GraphChartLabels> | undefined,\n): GraphLocale => {\n  const resolved = resolveLocale(locale);\n  return {\n    locale: resolved,\n    labels: localeLabels(GRAPH_LABELS, resolved, overrides),\n    count: (value) => numberFormat(resolved).format(value),\n    value: (value) =>\n      Number.isFinite(value)\n        ? numberFormat(resolved, { maximumFractionDigits: 2 }).format(value)\n        : \"–\",\n  };\n};\n"],"mappings":"iCAWA,IAAaI,EAAkD,CAC7D,GAAI,CACF,MAAO,gBACP,KAAM,eACN,IAAK,mBACL,QAAS,gCACT,cAAe,oBACf,aACE,wFACF,UAAW,yBACX,eAAgB,mCAChB,SAAU,mBACV,iBAAkB,oBAClB,SAAU,kBACV,UAAW,mCACX,MAAO,gBACP,OAAQ,iBACR,OAAQ,QACR,SAAU,WACV,SAAU,WACV,MAAO,QACP,MAAO,QACP,eAAgB,SAChB,SAAU,gBACV,OAAQ,UACR,QAAS,WACT,IAAK,cACL,SAAU,6BACV,cAAe,IACjB,EACA,GAAI,CACF,MAAO,MACP,KAAM,KACN,IAAK,MACL,QAAS,2BACT,cAAe,eACf,aACE,wCACF,UAAW,sBACX,eAAgB,+BAChB,SAAU,gBACV,iBAAkB,QAClB,SAAU,aACV,UAAW,0BACX,MAAO,aACP,OAAQ,aACR,OAAQ,MACR,SAAU,KACV,SAAU,KACV,MAAO,KACP,MAAO,KACP,eAAgB,MAChB,SAAU,OACV,OAAQ,KACR,QAAS,KACT,IAAK,OACL,SAAU,kBACV,cAAe,GACjB,EACA,GAAI,CACF,MAAO,UACP,KAAM,OACN,IAAK,UACL,QAAS,+BACT,cAAe,iBACf,aACE,6CACF,UAAW,wBACX,eAAgB,iCAChB,SAAU,eACV,iBAAkB,YAClB,SAAU,iBACV,UAAW,iCACX,MAAO,YACP,OAAQ,aACR,OAAQ,OACR,SAAU,KACV,SAAU,KACV,MAAO,IACP,MAAO,OACP,eAAgB,MAChB,SAAU,WACV,OAAQ,KACR,QAAS,KACT,IAAK,OACL,SAAU,wBACV,cAAe,GACjB,EACA,GAAI,CACF,MAAO,sBACP,KAAM,QACN,IAAK,wBACL,QAAS,gCACT,cAAe,sBACf,aACE,+GACF,UAAW,yBACX,eAAgB,mCAChB,SAAU,yBACV,iBAAkB,oBAClB,SAAU,gBACV,UAAW,mCACX,MAAO,mBACP,OAAQ,kBACR,OAAQ,QACR,SAAU,WACV,SAAU,WACV,MAAO,SACP,MAAO,SACP,eAAgB,UAChB,SAAU,kBACV,OAAQ,aACR,QAAS,eACT,IAAK,gBACL,SAAU,uCACV,cAAe,IACjB,CACF,EAGaC,GACX,EACA,IAEAC,EAAS,QAAQ,cAAe,EAAO,IACrCC,KAAOC,EAAS,OAAOA,EAAOD,EAAI,EAAIE,CACxC,EASWC,GACX,EACA,IACgB,CAChB,IAAMC,EAAWX,EAAAA,cAAcY,CAAM,EACrC,MAAO,CACL,OAAQD,EACR,OAAQV,EAAAA,aAAaG,EAAcO,EAAUE,CAAS,EACtD,MAAQ,GAAUX,EAAAA,aAAaS,CAAQ,CAAC,CAAC,OAAOG,CAAK,EACrD,MAAQ,GACN,OAAO,SAASA,CAAK,EACjBZ,EAAAA,aAAaS,EAAU,CAAE,sBAAuB,CAAE,CAAC,CAAC,CAAC,OAAOG,CAAK,EACjE,GACR,CACF"}

package/dist/charts/engine/graph/labels.d.cts

@@ -0,0 +1,12 @@
+import { LabelDictionary } from '../locale.cjs';
+import { GraphChartLabels } from './types.cjs';
+export declare const GRAPH_LABELS: LabelDictionary<GraphChartLabels>;
+/** Replaces `{name}` placeholders */
+export declare const fill: (template: string, values: Record<string, string | number>) => string;
+export interface GraphLocale {
+    locale: string;
+    labels: GraphChartLabels;
+    count: (value: number) => string;
+    value: (value: number) => string;
+}
+export declare const graphLocale: (locale: string | undefined, overrides: Partial<GraphChartLabels> | undefined) => GraphLocale;

package/dist/charts/engine/graph/labels.d.ts

@@ -0,0 +1,12 @@
+import { LabelDictionary } from '../locale.js';
+import { GraphChartLabels } from './types.js';
+export declare const GRAPH_LABELS: LabelDictionary<GraphChartLabels>;
+/** Replaces `{name}` placeholders */
+export declare const fill: (template: string, values: Record<string, string | number>) => string;
+export interface GraphLocale {
+    locale: string;
+    labels: GraphChartLabels;
+    count: (value: number) => string;
+    value: (value: number) => string;
+}
+export declare const graphLocale: (locale: string | undefined, overrides: Partial<GraphChartLabels> | undefined) => GraphLocale;

package/dist/charts/engine/graph/labels.js

@@ -0,0 +1,128 @@
+import { localeLabels as e, numberFormat as t, resolveLocale as n } from "../locale.js";
+//#region src/engine/graph/labels.ts
+var r = {
+	en: {
+		chart: "Network graph",
+		tree: "Tree diagram",
+		dag: "Dependency graph",
+		summary: "{nodes} nodes, {edges} links.",
+		groupsSummary: "Groups: {groups}.",
+		keyboardHelp: "Use the arrow keys to move between nodes, Enter to select, + and - to zoom, 0 to fit.",
+		nodeFocus: "{name}, {degree} links",
+		nodeFocusGroup: "{name} ({group}), {degree} links",
+		selected: "{count} selected",
+		selectionCleared: "Selection cleared",
+		expanded: "{name} expanded",
+		collapsed: "{name} collapsed, {count} hidden",
+		shown: "{name}: shown",
+		hidden: "{name}: hidden",
+		degree: "Links",
+		incoming: "Incoming",
+		outgoing: "Outgoing",
+		value: "Value",
+		group: "Group",
+		hiddenChildren: "Hidden",
+		critical: "Critical path",
+		zoomIn: "Zoom in",
+		zoomOut: "Zoom out",
+		fit: "Fit to view",
+		zoomHint: "Use {key} + scroll to zoom",
+		listSeparator: ", "
+	},
+	zh: {
+		chart: "关系图",
+		tree: "树图",
+		dag: "依赖图",
+		summary: "{nodes} 个节点，{edges} 条关系。",
+		groupsSummary: "分组：{groups}。",
+		keyboardHelp: "使用方向键在节点间移动，Enter 选中，+ 和 - 缩放，0 适应视图。",
+		nodeFocus: "{name}，{degree} 条关系",
+		nodeFocusGroup: "{name}（{group}），{degree} 条关系",
+		selected: "已选中 {count} 个",
+		selectionCleared: "已清除选择",
+		expanded: "{name} 已展开",
+		collapsed: "{name} 已折叠，隐藏 {count} 个",
+		shown: "{name}：已显示",
+		hidden: "{name}：已隐藏",
+		degree: "关系数",
+		incoming: "入边",
+		outgoing: "出边",
+		value: "数值",
+		group: "分组",
+		hiddenChildren: "已折叠",
+		critical: "关键路径",
+		zoomIn: "放大",
+		zoomOut: "缩小",
+		fit: "适应视图",
+		zoomHint: "按住 {key} 并滚动以缩放",
+		listSeparator: "、"
+	},
+	ja: {
+		chart: "ネットワーク図",
+		tree: "ツリー図",
+		dag: "依存関係グラフ",
+		summary: "ノード {nodes} 個、リンク {edges} 本。",
+		groupsSummary: "グループ：{groups}。",
+		keyboardHelp: "矢印キーでノード間を移動、Enter で選択、+ と - でズーム、0 で全体表示。",
+		nodeFocus: "{name}、リンク {degree} 本",
+		nodeFocusGroup: "{name}（{group}）、リンク {degree} 本",
+		selected: "{count} 個を選択",
+		selectionCleared: "選択を解除しました",
+		expanded: "{name} を展開しました",
+		collapsed: "{name} を折りたたみました（{count} 個非表示）",
+		shown: "{name}：表示",
+		hidden: "{name}：非表示",
+		degree: "リンク数",
+		incoming: "入力",
+		outgoing: "出力",
+		value: "値",
+		group: "グループ",
+		hiddenChildren: "非表示",
+		critical: "クリティカルパス",
+		zoomIn: "拡大",
+		zoomOut: "縮小",
+		fit: "全体表示",
+		zoomHint: "{key} を押しながらスクロールでズーム",
+		listSeparator: "、"
+	},
+	fr: {
+		chart: "Graphe de relations",
+		tree: "Arbre",
+		dag: "Graphe de dépendances",
+		summary: "{nodes} nœuds, {edges} liens.",
+		groupsSummary: "Groupes : {groups}.",
+		keyboardHelp: "Flèches pour passer d’un nœud à l’autre, Entrée pour sélectionner, + et - pour zoomer, 0 pour tout afficher.",
+		nodeFocus: "{name}, {degree} liens",
+		nodeFocusGroup: "{name} ({group}), {degree} liens",
+		selected: "{count} sélectionné(s)",
+		selectionCleared: "Sélection effacée",
+		expanded: "{name} déplié",
+		collapsed: "{name} replié, {count} masqué(s)",
+		shown: "{name} : affiché",
+		hidden: "{name} : masqué",
+		degree: "Liens",
+		incoming: "Entrants",
+		outgoing: "Sortants",
+		value: "Valeur",
+		group: "Groupe",
+		hiddenChildren: "Masqués",
+		critical: "Chemin critique",
+		zoomIn: "Zoom avant",
+		zoomOut: "Zoom arrière",
+		fit: "Tout afficher",
+		zoomHint: "Utilisez {key} + molette pour zoomer",
+		listSeparator: ", "
+	}
+}, i = (e, t) => e.replace(/\{(\w+)\}/g, (e, n) => n in t ? String(t[n]) : e), a = (i, a) => {
+	let o = n(i);
+	return {
+		locale: o,
+		labels: e(r, o, a),
+		count: (e) => t(o).format(e),
+		value: (e) => Number.isFinite(e) ? t(o, { maximumFractionDigits: 2 }).format(e) : "–"
+	};
+};
+//#endregion
+export { r as GRAPH_LABELS, i as fill, a as graphLocale };
+
+//# sourceMappingURL=labels.js.map