minerva-design 1.2.0 → 1.4.0

package/dist/charts/engine/shapes/treemap.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"treemap.cjs","names":["sum","uniqueKeys","positive","emptyLayout","finite","font","relativeLuminance","resolveWith","mix","toCss","ellipsize","readableFill","textOn","clamp","require_color","require_overlay","require_scene","HEADER","squarify","out","values","rect","total","v","scale","areas","w","h","worst","s2","s","side2","side","max","min","place","cw","yy","y","i","row","hh","rh","xx","x","ww","rowSum","rowMin","rowMax","a","build","leafCount","walk","keys","nodes","nd","t","parentPath","top","j","key","parentKey","path","node","children","ch","hidden","o","treemapValues","visit","b","shrink","r","d","layoutTreemap","tree","rootTotal","shown","measureShown","shownTotal","gap","headers","nameFont","theme","valueFont","headerFont","items","dark","level","sorted","list","rects","step","cell","color","parentColor","content","title","measure","fill","css","ink","name","value","percent","area","enter"],"sources":["../../../../../charts/src/engine/shapes/treemap.ts"],"sourcesContent":["// Treemap layout: squarified rectangles, parent headers, a palette color per\n// top-level node and lighter shades for its children.\n\nimport { mix, toCss, type Rgba } from \"../color\";\nimport { font } from \"../overlay\";\nimport {\n  clamp,\n  ellipsize,\n  emptyLayout,\n  finite,\n  positive,\n  readableFill,\n  relativeLuminance,\n  resolveWith,\n  sum,\n  textOn,\n  uniqueKeys,\n  type LayoutContext,\n  type LayoutResult,\n  type ShapeItem,\n  type ShapeNode,\n  type ShapeRect,\n} from \"./scene\";\nimport type { TreemapChartOptions, TreemapNode } from \"./types\";\n\nconst HEADER = 20;\n\n/**\n * Squarified treemap (Bruls et al.): rectangles of areas proportional to\n * `values` (best sorted descending) filling `rect`, with aspect ratios close to 1.\n */\nexport const squarify = (\n  values: readonly number[],\n  rect: ShapeRect,\n): ShapeRect[] => {\n  const out: ShapeRect[] = values.map(() => ({\n    x: rect.x,\n    y: rect.y,\n    width: 0,\n    height: 0,\n  }));\n  const total = sum(values.map((v) => Math.max(0, v)));\n  if (total <= 0 || rect.width <= 0 || rect.height <= 0) return out;\n  const scale = (rect.width * rect.height) / total;\n  const areas = values.map((v) => Math.max(0, v) * scale);\n  let { x, y, width: w, height: h } = rect;\n\n  const worst = (s: number, min: number, max: number, side: number) => {\n    const s2 = s * s;\n    const side2 = side * side;\n    return Math.max((side2 * max) / s2, s2 / (side2 * min));\n  };\n  const place = (row: number[], s: number) => {\n    if (w >= h) {\n      const cw = h > 0 ? Math.min(w, s / h) : 0;\n      let yy = y;\n      for (const i of row) {\n        const hh = cw > 0 ? areas[i] / cw : 0;\n        out[i] = { x, y: yy, width: cw, height: hh };\n        yy += hh;\n      }\n      x += cw;\n      w = Math.max(0, w - cw);\n    } else {\n      const rh = w > 0 ? Math.min(h, s / w) : 0;\n      let xx = x;\n      for (const i of row) {\n        const ww = rh > 0 ? areas[i] / rh : 0;\n        out[i] = { x: xx, y, width: ww, height: rh };\n        xx += ww;\n      }\n      y += rh;\n      h = Math.max(0, h - rh);\n    }\n  };\n\n  let row: number[] = [];\n  let rowSum = 0;\n  let rowMin = Infinity;\n  let rowMax = 0;\n  areas.forEach((a, i) => {\n    if (a <= 0) return;\n    if (row.length) {\n      const side = Math.min(w, h);\n      const next = worst(\n        rowSum + a,\n        Math.min(rowMin, a),\n        Math.max(rowMax, a),\n        side,\n      );\n      if (next > worst(rowSum, rowMin, rowMax, side)) {\n        place(row, rowSum);\n        row = [];\n        rowSum = 0;\n        rowMin = Infinity;\n        rowMax = 0;\n      }\n    }\n    row.push(i);\n    rowSum += a;\n    rowMin = Math.min(rowMin, a);\n    rowMax = Math.max(rowMax, a);\n  });\n  if (row.length) place(row, rowSum);\n  return out;\n};\n\ninterface Built {\n  node: TreemapNode;\n  key: string;\n  path: string[];\n  top: number;\n  /** Index in the flattened leaves (leaves only) */\n  leaf: number;\n  target: number;\n  children: Built[];\n}\n\n/** Tree with the target values; hidden top-level nodes count 0 */\nconst build = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n): Built[] => {\n  let leafCount = 0;\n  const walk = (\n    nodes: readonly TreemapNode[],\n    parentKey: string,\n    parentPath: string[],\n    top: number,\n  ): Built[] => {\n    const keys = uniqueKeys(nodes.map((nd) => nd.name));\n    return nodes.map((node, j) => {\n      const t = parentPath.length ? top : j;\n      const key = `${parentKey}/${keys[j]}`;\n      const path = [...parentPath, node.name];\n      if (node.children?.length) {\n        const children = walk(node.children, key, path, t);\n        return {\n          node,\n          key,\n          path,\n          top: t,\n          leaf: -1,\n          target: sum(children.map((ch) => ch.target)),\n          children,\n        };\n      }\n      return {\n        node,\n        key,\n        path,\n        top: t,\n        leaf: leafCount++,\n        target: hidden.has(t) ? 0 : positive(node.value),\n        children: [],\n      };\n    });\n  };\n  return walk(o.data, \"\", [], 0);\n};\n\nexport const treemapValues = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n  out: Map<string, number>,\n) => {\n  const visit = (nodes: Built[]) =>\n    nodes.forEach((b) => {\n      if (b.children.length) visit(b.children);\n      else out.set(b.key, b.target);\n    });\n  visit(build(o, hidden));\n};\n\n/** Leaves in the flattened order (the hover / click `index`) */\nexport const treemapLeaves = (data: readonly TreemapNode[]) => {\n  const leaves: { node: TreemapNode; path: string[] }[] = [];\n  const visit = (nodes: readonly TreemapNode[], path: string[]) =>\n    nodes.forEach((node) => {\n      const p = [...path, node.name];\n      if (node.children?.length) visit(node.children, p);\n      else leaves.push({ node, path: p });\n    });\n  visit(data, []);\n  return leaves;\n};\n\nconst shrink = (r: ShapeRect, d: number): ShapeRect => ({\n  x: r.x + d,\n  y: r.y + d,\n  width: Math.max(0, r.width - 2 * d),\n  height: Math.max(0, r.height - 2 * d),\n});\n\nexport const layoutTreemap = (\n  o: TreemapChartOptions,\n  c: LayoutContext,\n): LayoutResult => {\n  const { theme, area, measure, hidden } = c;\n  const tree = build(o, hidden);\n  const rootTotal = sum(tree.map((b) => b.target));\n  // displayed (animated) values\n  const shown = new Map<Built, number>();\n  const measureShown = (b: Built): number => {\n    const v = b.children.length\n      ? sum(b.children.map(measureShown))\n      : Math.max(0, c.value(b.key, b.target));\n    shown.set(b, v);\n    return v;\n  };\n  const shownTotal = sum(tree.map(measureShown));\n  if (rootTotal <= 0 && shownTotal <= 1e-9) return emptyLayout(c);\n\n  const gap = Math.max(0, finite(o.gap, 2));\n  const headers = o.headers !== false;\n  const nameFont = font(theme, 12, 500);\n  const valueFont = font(theme, 11);\n  const headerFont = font(theme, 11, 600);\n  const nodes: ShapeNode[] = [];\n  const items: ShapeItem[] = [];\n  // dark themes: fills slightly toward the background so that labels read well\n  const dark = relativeLuminance(theme.background) < 0.2;\n\n  const level = (list: Built[], rect: ShapeRect, parentColor: Rgba | null) => {\n    const sorted = list\n      .filter((b) => (shown.get(b) ?? 0) > 1e-9)\n      .sort((a, b) => (shown.get(b) ?? 0) - (shown.get(a) ?? 0));\n    const rects = squarify(\n      sorted.map((b) => shown.get(b) ?? 0),\n      rect,\n    );\n    const step = Math.min(0.14, 0.5 / Math.max(1, sorted.length - 1));\n    sorted.forEach((b, j) => {\n      const cell = shrink(rects[j], gap / 2);\n      if (cell.width < 1 || cell.height < 1) return;\n      const color = parentColor\n        ? b.node.color\n          ? resolveWith(theme, b.node.color, parentColor)\n          : mix(parentColor, theme.background, j * step)\n        : c.color(b.node.color, b.top);\n      if (b.children.length) {\n        let content = cell;\n        if (headers && cell.height > HEADER + 14 && cell.width > 36) {\n          nodes.push({\n            kind: \"rect\",\n            x: cell.x,\n            y: cell.y,\n            width: cell.width,\n            height: cell.height,\n            radius: 4,\n            fill: toCss(color, 0.14),\n          });\n          const title = ellipsize(\n            b.node.name,\n            cell.width - 12,\n            headerFont,\n            measure,\n          );\n          if (title)\n            nodes.push({\n              kind: \"text\",\n              x: cell.x + 6,\n              y: cell.y + HEADER / 2 + 1,\n              text: title,\n              font: headerFont,\n              color: toCss(theme.text, 0.85),\n              align: \"left\",\n              baseline: \"middle\",\n            });\n          content = {\n            x: cell.x + 2,\n            y: cell.y + HEADER,\n            width: cell.width - 4,\n            height: cell.height - HEADER - 2,\n          };\n        }\n        level(b.children, content, color);\n        return;\n      }\n      const fill = readableFill(\n        dark ? mix(color, theme.background, 0.18) : color,\n      );\n      const css = toCss(fill);\n      nodes.push({\n        kind: \"rect\",\n        x: cell.x,\n        y: cell.y,\n        width: cell.width,\n        height: cell.height,\n        radius: Math.min(4, cell.width / 2, cell.height / 2),\n        fill: css,\n        hit: b.leaf,\n        brighten: true,\n      });\n      if (cell.width >= 36 && cell.height >= 22) {\n        const ink = textOn(fill);\n        const name = ellipsize(b.node.name, cell.width - 12, nameFont, measure);\n        if (name)\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 6,\n            text: name,\n            font: nameFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n        const value = c.format(b.target);\n        if (\n          name &&\n          cell.height >= 38 &&\n          measure(value, valueFont) <= cell.width - 12\n        )\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 22,\n            text: value,\n            font: valueFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n      }\n      if (b.target > 0) {\n        const percent = rootTotal > 0 ? b.target / rootTotal : 0;\n        items.push({\n          index: b.leaf,\n          name: b.node.name,\n          value: b.target,\n          percent,\n          share: c.percent(percent),\n          color: css,\n          path: b.path,\n          x: cell.x + cell.width / 2,\n          y: cell.y + cell.height / 2,\n          rows: [\n            { name: c.labels.value, value: c.format(b.target) },\n            { name: c.labels.share, value: c.percent(percent) },\n          ],\n        });\n      }\n    });\n  };\n  level(tree, area, null);\n  items.sort((a, b) => a.index - b.index);\n\n  const enter = clamp(c.enter, 0, 1);\n  return {\n    nodes,\n    items,\n    dim: 0.55,\n    empty: false,\n    ...(enter < 1\n      ? {\n          enter: {\n            alpha: enter,\n            scale: 0.94 + 0.06 * enter,\n            cx: area.x + area.width / 2,\n            cy: area.y + area.height / 2,\n          },\n        }\n      : {}),\n  };\n};\n"],"mappings":"qFAyBA,IAAMiB,EAAS,GAMFC,GACX,EACA,IACgB,CAChB,IAAMC,EAAmBC,EAAO,SAAW,CACzC,EAAGC,EAAK,EACR,EAAGA,EAAK,EACR,MAAO,EACP,OAAQ,CACV,EAAE,EACIC,EAAQtB,EAAAA,IAAIoB,EAAO,IAAK,GAAM,KAAK,IAAI,EAAGG,CAAC,CAAC,CAAC,EACnD,GAAID,GAAS,GAAKD,EAAK,OAAS,GAAKA,EAAK,QAAU,EAAG,OAAOF,EAC9D,IAAMK,EAASH,EAAK,MAAQA,EAAK,OAAUC,EACrCG,EAAQL,EAAO,IAAK,GAAM,KAAK,IAAI,EAAGG,CAAC,EAAIC,CAAK,EAClD,CAAE,IAAG,IAAG,MAAOE,EAAG,OAAQC,GAAMN,EAE9BO,GAAS,EAAW,EAAa,EAAa,IAAiB,CACnE,IAAMC,EAAKC,EAAIA,EACTC,EAAQC,EAAOA,EACrB,OAAO,KAAK,IAAKD,EAAQE,EAAOJ,EAAIA,GAAME,EAAQG,EAAI,CACxD,EACMC,GAAS,EAAe,IAAc,CAC1C,GAAIT,GAAKC,EAAG,CACV,IAAMS,EAAKT,EAAI,EAAI,KAAK,IAAID,EAAGI,EAAIH,CAAC,EAAI,EACpCU,EAAKC,EACT,IAAK,IAAMC,KAAKC,EAAK,CACnB,IAAMC,EAAKL,EAAK,EAAIX,EAAMc,GAAKH,EAAK,EACpC,EAAIG,GAAK,CAAE,IAAG,EAAGF,EAAI,MAAOD,EAAI,OAAQK,CAAG,EAC3C,GAAMA,CACR,CACA,GAAKL,EACL,EAAI,KAAK,IAAI,EAAGV,EAAIU,CAAE,CACxB,KAAO,CACL,IAAMM,EAAKhB,EAAI,EAAI,KAAK,IAAIC,EAAGG,EAAIJ,CAAC,EAAI,EACpCiB,EAAKC,EACT,IAAK,IAAML,KAAKC,EAAK,CACnB,IAAMK,EAAKH,EAAK,EAAIjB,EAAMc,GAAKG,EAAK,EACpC,EAAIH,GAAK,CAAE,EAAGI,EAAI,IAAG,MAAOE,EAAI,OAAQH,CAAG,EAC3C,GAAMG,CACR,CACA,GAAKH,EACL,EAAI,KAAK,IAAI,EAAGf,EAAIe,CAAE,CACxB,CACF,EAEIF,EAAgB,CAAC,EACjBM,EAAS,EACTC,EAAS,IACTC,EAAS,EAyBb,OAxBAvB,EAAM,SAAS,EAAG,IAAM,CACtB,GAAI,KAAK,GACT,IAAIe,EAAI,OAAQ,CACd,IAAMR,EAAO,KAAK,IAAIN,EAAGC,CAAC,EACbC,EACXkB,EAASG,EACT,KAAK,IAAIF,EAAQE,CAAC,EAClB,KAAK,IAAID,EAAQC,CAAC,EAClBjB,CAEE,EAAOJ,EAAMkB,EAAQC,EAAQC,EAAQhB,CAAI,IAC3CG,EAAMK,EAAKM,CAAM,EACjB,EAAM,CAAC,EACP,EAAS,EACT,EAAS,IACT,EAAS,EAEb,CACAN,EAAI,KAAKD,CAAC,EACV,GAAUU,EACV,EAAS,KAAK,IAAIF,EAAQE,CAAC,EAC3B,EAAS,KAAK,IAAID,EAAQC,CAAC,CAJ3B,CAKF,CAAC,EACGT,EAAI,QAAQL,EAAMK,EAAKM,CAAM,EAC1B3B,CACT,EAcM+B,GACJ,EACA,IACY,CACZ,IAAIC,EAAY,EACVC,GACJ,EACA,EACA,EACA,IACY,CACZ,IAAMC,EAAOpD,EAAAA,WAAWqD,EAAM,IAAK,GAAOC,EAAG,IAAI,CAAC,EAClD,OAAOD,EAAM,KAAK,EAAM,IAAM,CAC5B,IAAME,EAAIC,EAAW,OAASC,EAAMC,EAC9BC,EAAM,GAAGC,EAAU,GAAGR,EAAKM,KAC3BG,EAAO,CAAC,GAAGL,EAAYM,EAAK,IAAI,EACtC,GAAIA,EAAK,UAAU,OAAQ,CACzB,IAAMC,EAAWZ,EAAKW,EAAK,SAAUH,EAAKE,EAAMN,CAAC,EACjD,MAAO,CACL,OACA,MACA,OACA,IAAKA,EACL,KAAM,GACN,OAAQxD,EAAAA,IAAIgE,EAAS,IAAK,GAAOC,EAAG,MAAM,CAAC,EAC3C,UACF,CACF,CACA,MAAO,CACL,OACA,MACA,OACA,IAAKT,EACL,KAAM,IACN,OAAQU,EAAO,IAAIV,CAAC,EAAI,EAAItD,EAAAA,SAAS6D,EAAK,KAAK,EAC/C,SAAU,CAAC,CACb,CACF,CAAC,CACH,EACA,OAAOX,EAAKe,EAAE,KAAM,GAAI,CAAC,EAAG,CAAC,CAC/B,EAEaC,GACX,EACA,EACA,IACG,CACH,IAAMC,EAAS,GACbf,EAAM,QAAS,GAAM,CACfgB,EAAE,SAAS,OAAQD,EAAMC,EAAE,QAAQ,EAClCnD,EAAI,IAAImD,EAAE,IAAKA,EAAE,MAAM,CAC9B,CAAC,EACHD,EAAMnB,EAAMiB,EAAGD,CAAM,CAAC,CACxB,EAeMK,GAAU,EAAc,KAA0B,CACtD,EAAGC,EAAE,EAAIC,EACT,EAAGD,EAAE,EAAIC,EACT,MAAO,KAAK,IAAI,EAAGD,EAAE,MAAQ,EAAIC,CAAC,EAClC,OAAQ,KAAK,IAAI,EAAGD,EAAE,OAAS,EAAIC,CAAC,CACtC,GAEaC,GACX,EACA,IACiB,CACjB,GAAM,CAAE,QAAO,OAAM,UAAS,UAAW,EACnCC,EAAOzB,EAAM,EAAGgB,CAAM,EACtBU,EAAY5E,EAAAA,IAAI2E,EAAK,IAAK,GAAML,EAAE,MAAM,CAAC,EAEzCO,EAAQ,IAAI,IACZC,EAAgB,GAAqB,CACzC,IAAMvD,EAAI+C,EAAE,SAAS,OACjBtE,EAAAA,IAAIsE,EAAE,SAAS,IAAIQ,CAAY,CAAC,EAChC,KAAK,IAAI,EAAG,EAAE,MAAMR,EAAE,IAAKA,EAAE,MAAM,CAAC,EAExC,OADAO,EAAM,IAAIP,EAAG/C,CAAC,EACPA,CACT,EACMwD,EAAa/E,EAAAA,IAAI2E,EAAK,IAAIG,CAAY,CAAC,EAC7C,GAAIF,GAAa,GAAKG,GAAc,KAAM,OAAO5E,EAAAA,YAAY,CAAC,EAE9D,IAAM6E,EAAM,KAAK,IAAI,EAAG5E,EAAAA,OAAO,EAAE,IAAK,CAAC,CAAC,EAClC6E,EAAU,EAAE,UAAY,GACxBC,EAAW7E,EAAAA,KAAK8E,EAAO,GAAI,GAAG,EAC9BC,EAAY/E,EAAAA,KAAK8E,EAAO,EAAE,EAC1BE,EAAahF,EAAAA,KAAK8E,EAAO,GAAI,GAAG,EAChC7B,EAAqB,CAAC,EACtBgC,EAAqB,CAAC,EAEtBC,EAAOjF,EAAAA,kBAAkB6E,EAAM,UAAU,EAAI,GAE7CK,GAAS,EAAe,EAAiB,IAA6B,CAC1E,IAAMC,EAASC,EACZ,OAAQ,IAAOb,EAAM,IAAIP,CAAC,GAAK,GAAK,IAAI,CAAC,CACzC,MAAM,EAAG,KAAOO,EAAM,IAAIP,CAAC,GAAK,IAAMO,EAAM,IAAI5B,CAAC,GAAK,EAAE,EACrD0C,EAAQzE,EACZuE,EAAO,IAAK,GAAMZ,EAAM,IAAIP,CAAC,GAAK,CAAC,EACnCjD,CACF,EACMuE,EAAO,KAAK,IAAI,IAAM,GAAM,KAAK,IAAI,EAAGH,EAAO,OAAS,CAAC,CAAC,EAChEA,EAAO,SAAS,EAAG,IAAM,CACvB,IAAMI,EAAOtB,EAAOoB,EAAMhC,GAAIqB,EAAM,CAAC,EACrC,GAAIa,EAAK,MAAQ,GAAKA,EAAK,OAAS,EAAG,OACvC,IAAMC,EAAQC,EACVzB,EAAE,KAAK,MACL/D,EAAAA,YAAY4E,EAAOb,EAAE,KAAK,MAAOyB,CAAW,EAC5CvF,EAAAA,IAAIuF,EAAaZ,EAAM,WAAYxB,EAAIiC,CAAI,EAC7C,EAAE,MAAMtB,EAAE,KAAK,MAAOA,EAAE,GAAG,EAC/B,GAAIA,EAAE,SAAS,OAAQ,CACrB,IAAI0B,EAAUH,EACd,GAAIZ,GAAWY,EAAK,OAAS,IAAeA,EAAK,MAAQ,GAAI,CAC3DvC,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EACR,EAAGA,EAAK,EACR,MAAOA,EAAK,MACZ,OAAQA,EAAK,OACb,OAAQ,EACR,KAAMpF,EAAAA,MAAMqF,EAAO,GAAI,CACzB,CAAC,EACD,IAAMG,EAAQvF,EAAAA,UACZ4D,EAAE,KAAK,KACPuB,EAAK,MAAQ,GACbR,EACAa,CACF,EACID,GACF3C,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI5E,EAAS,EAAI,EACzB,KAAMgF,EACN,KAAMZ,EACN,MAAO5E,EAAAA,MAAM0E,EAAM,KAAM,GAAI,EAC7B,MAAO,OACP,SAAU,QACZ,CAAC,EACH,EAAU,CACR,EAAGU,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI5E,EACZ,MAAO4E,EAAK,MAAQ,EACpB,OAAQA,EAAK,OAAS5E,EAAS,CACjC,CACF,CACAuE,EAAMlB,EAAE,SAAU0B,EAASF,CAAK,EAChC,MACF,CACA,IAAMK,EAAOxF,EAAAA,aACX4E,EAAO/E,EAAAA,IAAIsF,EAAOX,EAAM,WAAY,GAAI,EAAIW,CAC9C,EACMM,EAAM3F,EAAAA,MAAM0F,CAAI,EAYtB,GAXA7C,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EACR,EAAGA,EAAK,EACR,MAAOA,EAAK,MACZ,OAAQA,EAAK,OACb,OAAQ,KAAK,IAAI,EAAGA,EAAK,MAAQ,EAAGA,EAAK,OAAS,CAAC,EACnD,KAAMO,EACN,IAAK9B,EAAE,KACP,SAAU,EACZ,CAAC,EACGuB,EAAK,OAAS,IAAMA,EAAK,QAAU,GAAI,CACzC,IAAMQ,EAAMzF,EAAAA,OAAOuF,CAAI,EACjBG,EAAO5F,EAAAA,UAAU4D,EAAE,KAAK,KAAMuB,EAAK,MAAQ,GAAIX,EAAUgB,CAAO,EAClEI,GACFhD,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI,EACZ,KAAMS,EACN,KAAMpB,EACN,MAAOmB,EACP,MAAO,OACP,SAAU,MACV,IAAK/B,EAAE,IACT,CAAC,EACH,IAAMiC,EAAQ,EAAE,OAAOjC,EAAE,MAAM,EAE7BgC,GACAT,EAAK,QAAU,IACfK,EAAQK,EAAOnB,CAAS,GAAKS,EAAK,MAAQ,IAE1CvC,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI,GACZ,KAAMU,EACN,KAAMnB,EACN,MAAOiB,EACP,MAAO,OACP,SAAU,MACV,IAAK/B,EAAE,IACT,CAAC,CACL,CACA,GAAIA,EAAE,OAAS,EAAG,CAChB,IAAMkC,EAAU5B,EAAY,EAAIN,EAAE,OAASM,EAAY,EACvDU,EAAM,KAAK,CACT,MAAOhB,EAAE,KACT,KAAMA,EAAE,KAAK,KACb,MAAOA,EAAE,OACT,UACA,MAAO,EAAE,QAAQkC,CAAO,EACxB,MAAOJ,EACP,KAAM9B,EAAE,KACR,EAAGuB,EAAK,EAAIA,EAAK,MAAQ,EACzB,EAAGA,EAAK,EAAIA,EAAK,OAAS,EAC1B,KAAM,CACJ,CAAE,KAAM,EAAE,OAAO,MAAO,MAAO,EAAE,OAAOvB,EAAE,MAAM,CAAE,EAClD,CAAE,KAAM,EAAE,OAAO,MAAO,MAAO,EAAE,QAAQkC,CAAO,CAAE,CACpD,CACF,CAAC,CACH,CACF,CAAC,CACH,EACAhB,EAAMb,EAAM8B,EAAM,IAAI,EACtBnB,EAAM,MAAM,EAAG,IAAMrC,EAAE,MAAQqB,EAAE,KAAK,EAEtC,IAAMoC,EAAQ7F,EAAAA,MAAM,EAAE,MAAO,EAAG,CAAC,EACjC,MAAO,CACL,QACA,QACA,IAAK,IACL,MAAO,GACP,GAAI6F,EAAQ,EACR,CACE,MAAO,CACL,MAAOA,EACP,MAAO,IAAO,IAAOA,EACrB,GAAID,EAAK,EAAIA,EAAK,MAAQ,EAC1B,GAAIA,EAAK,EAAIA,EAAK,OAAS,CAC7B,CACF,EACA,CAAC,CACP,CACF"}

package/dist/charts/engine/shapes/treemap.d.cts

@@ -0,0 +1,14 @@
+import { LayoutContext, LayoutResult, ShapeRect } from './scene.cjs';
+import { TreemapChartOptions, TreemapNode } from './types.cjs';
+/**
+ * Squarified treemap (Bruls et al.): rectangles of areas proportional to
+ * `values` (best sorted descending) filling `rect`, with aspect ratios close to 1.
+ */
+export declare const squarify: (values: readonly number[], rect: ShapeRect) => ShapeRect[];
+export declare const treemapValues: (o: TreemapChartOptions, hidden: ReadonlySet<number>, out: Map<string, number>) => void;
+/** Leaves in the flattened order (the hover / click `index`) */
+export declare const treemapLeaves: (data: readonly TreemapNode[]) => {
+    node: TreemapNode;
+    path: string[];
+}[];
+export declare const layoutTreemap: (o: TreemapChartOptions, c: LayoutContext) => LayoutResult;

package/dist/charts/engine/shapes/treemap.d.ts

@@ -0,0 +1,14 @@
+import { LayoutContext, LayoutResult, ShapeRect } from './scene.js';
+import { TreemapChartOptions, TreemapNode } from './types.js';
+/**
+ * Squarified treemap (Bruls et al.): rectangles of areas proportional to
+ * `values` (best sorted descending) filling `rect`, with aspect ratios close to 1.
+ */
+export declare const squarify: (values: readonly number[], rect: ShapeRect) => ShapeRect[];
+export declare const treemapValues: (o: TreemapChartOptions, hidden: ReadonlySet<number>, out: Map<string, number>) => void;
+/** Leaves in the flattened order (the hover / click `index`) */
+export declare const treemapLeaves: (data: readonly TreemapNode[]) => {
+    node: TreemapNode;
+    path: string[];
+}[];
+export declare const layoutTreemap: (o: TreemapChartOptions, c: LayoutContext) => LayoutResult;

package/dist/charts/engine/shapes/treemap.js

@@ -0,0 +1,213 @@
+import { mix as e, toCss as t } from "../color.js";
+import { font as n } from "../overlay.js";
+import { clamp as r, ellipsize as i, emptyLayout as a, finite as o, positive as s, readableFill as c, relativeLuminance as l, resolveWith as u, sum as d, textOn as f, uniqueKeys as p } from "./scene.js";
+//#region src/engine/shapes/treemap.ts
+var m = 20, h = (e, t) => {
+	let n = e.map(() => ({
+		x: t.x,
+		y: t.y,
+		width: 0,
+		height: 0
+	})), r = d(e.map((e) => Math.max(0, e)));
+	if (r <= 0 || t.width <= 0 || t.height <= 0) return n;
+	let i = t.width * t.height / r, a = e.map((e) => Math.max(0, e) * i), { x: o, y: s, width: c, height: l } = t, u = (e, t, n, r) => {
+		let i = e * e, a = r * r;
+		return Math.max(a * n / i, i / (a * t));
+	}, f = (e, t) => {
+		if (c >= l) {
+			let r = l > 0 ? Math.min(c, t / l) : 0, i = s;
+			for (let t of e) {
+				let e = r > 0 ? a[t] / r : 0;
+				n[t] = {
+					x: o,
+					y: i,
+					width: r,
+					height: e
+				}, i += e;
+			}
+			o += r, c = Math.max(0, c - r);
+		} else {
+			let r = c > 0 ? Math.min(l, t / c) : 0, i = o;
+			for (let t of e) {
+				let e = r > 0 ? a[t] / r : 0;
+				n[t] = {
+					x: i,
+					y: s,
+					width: e,
+					height: r
+				}, i += e;
+			}
+			s += r, l = Math.max(0, l - r);
+		}
+	}, p = [], m = 0, h = Infinity, g = 0;
+	return a.forEach((e, t) => {
+		if (!(e <= 0)) {
+			if (p.length) {
+				let t = Math.min(c, l);
+				u(m + e, Math.min(h, e), Math.max(g, e), t) > u(m, h, g, t) && (f(p, m), p = [], m = 0, h = Infinity, g = 0);
+			}
+			p.push(t), m += e, h = Math.min(h, e), g = Math.max(g, e);
+		}
+	}), p.length && f(p, m), n;
+}, g = (e, t) => {
+	let n = 0, r = (e, i, a, o) => {
+		let c = p(e.map((e) => e.name));
+		return e.map((e, l) => {
+			let u = a.length ? o : l, f = `${i}/${c[l]}`, p = [...a, e.name];
+			if (e.children?.length) {
+				let t = r(e.children, f, p, u);
+				return {
+					node: e,
+					key: f,
+					path: p,
+					top: u,
+					leaf: -1,
+					target: d(t.map((e) => e.target)),
+					children: t
+				};
+			}
+			return {
+				node: e,
+				key: f,
+				path: p,
+				top: u,
+				leaf: n++,
+				target: t.has(u) ? 0 : s(e.value),
+				children: []
+			};
+		});
+	};
+	return r(e.data, "", [], 0);
+}, _ = (e, t, n) => {
+	let r = (e) => e.forEach((e) => {
+		e.children.length ? r(e.children) : n.set(e.key, e.target);
+	});
+	r(g(e, t));
+}, v = (e, t) => ({
+	x: e.x + t,
+	y: e.y + t,
+	width: Math.max(0, e.width - 2 * t),
+	height: Math.max(0, e.height - 2 * t)
+}), y = (s, p) => {
+	let { theme: _, area: y, measure: b, hidden: x } = p, S = g(s, x), C = d(S.map((e) => e.target)), w = /* @__PURE__ */ new Map(), T = (e) => {
+		let t = e.children.length ? d(e.children.map(T)) : Math.max(0, p.value(e.key, e.target));
+		return w.set(e, t), t;
+	}, E = d(S.map(T));
+	if (C <= 0 && E <= 1e-9) return a(p);
+	let D = Math.max(0, o(s.gap, 2)), O = s.headers !== !1, k = n(_, 12, 500), A = n(_, 11), j = n(_, 11, 600), M = [], N = [], P = l(_.background) < .2, F = (n, r, a) => {
+		let o = n.filter((e) => (w.get(e) ?? 0) > 1e-9).sort((e, t) => (w.get(t) ?? 0) - (w.get(e) ?? 0)), s = h(o.map((e) => w.get(e) ?? 0), r), l = Math.min(.14, .5 / Math.max(1, o.length - 1));
+		o.forEach((n, r) => {
+			let o = v(s[r], D / 2);
+			if (o.width < 1 || o.height < 1) return;
+			let d = a ? n.node.color ? u(_, n.node.color, a) : e(a, _.background, r * l) : p.color(n.node.color, n.top);
+			if (n.children.length) {
+				let e = o;
+				if (O && o.height > 34 && o.width > 36) {
+					M.push({
+						kind: "rect",
+						x: o.x,
+						y: o.y,
+						width: o.width,
+						height: o.height,
+						radius: 4,
+						fill: t(d, .14)
+					});
+					let r = i(n.node.name, o.width - 12, j, b);
+					r && M.push({
+						kind: "text",
+						x: o.x + 6,
+						y: o.y + m / 2 + 1,
+						text: r,
+						font: j,
+						color: t(_.text, .85),
+						align: "left",
+						baseline: "middle"
+					}), e = {
+						x: o.x + 2,
+						y: o.y + m,
+						width: o.width - 4,
+						height: o.height - m - 2
+					};
+				}
+				F(n.children, e, d);
+				return;
+			}
+			let h = c(P ? e(d, _.background, .18) : d), g = t(h);
+			if (M.push({
+				kind: "rect",
+				x: o.x,
+				y: o.y,
+				width: o.width,
+				height: o.height,
+				radius: Math.min(4, o.width / 2, o.height / 2),
+				fill: g,
+				hit: n.leaf,
+				brighten: !0
+			}), o.width >= 36 && o.height >= 22) {
+				let e = f(h), t = i(n.node.name, o.width - 12, k, b);
+				t && M.push({
+					kind: "text",
+					x: o.x + 6,
+					y: o.y + 6,
+					text: t,
+					font: k,
+					color: e,
+					align: "left",
+					baseline: "top",
+					hit: n.leaf
+				});
+				let r = p.format(n.target);
+				t && o.height >= 38 && b(r, A) <= o.width - 12 && M.push({
+					kind: "text",
+					x: o.x + 6,
+					y: o.y + 22,
+					text: r,
+					font: A,
+					color: e,
+					align: "left",
+					baseline: "top",
+					hit: n.leaf
+				});
+			}
+			if (n.target > 0) {
+				let e = C > 0 ? n.target / C : 0;
+				N.push({
+					index: n.leaf,
+					name: n.node.name,
+					value: n.target,
+					percent: e,
+					share: p.percent(e),
+					color: g,
+					path: n.path,
+					x: o.x + o.width / 2,
+					y: o.y + o.height / 2,
+					rows: [{
+						name: p.labels.value,
+						value: p.format(n.target)
+					}, {
+						name: p.labels.share,
+						value: p.percent(e)
+					}]
+				});
+			}
+		});
+	};
+	F(S, y, null), N.sort((e, t) => e.index - t.index);
+	let I = r(p.enter, 0, 1);
+	return {
+		nodes: M,
+		items: N,
+		dim: .55,
+		empty: !1,
+		...I < 1 ? { enter: {
+			alpha: I,
+			scale: .94 + .06 * I,
+			cx: y.x + y.width / 2,
+			cy: y.y + y.height / 2
+		} } : {}
+	};
+};
+//#endregion
+export { y as layoutTreemap, h as squarify, _ as treemapValues };
+
+//# sourceMappingURL=treemap.js.map

package/dist/charts/engine/shapes/treemap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"treemap.js","names":["HEADER","squarify","out","values","rect","total","sum","v","scale","areas","w","h","worst","s2","s","side2","side","max","min","place","cw","yy","y","i","row","hh","rh","xx","x","ww","rowSum","rowMin","rowMax","a","build","leafCount","walk","keys","uniqueKeys","nodes","nd","t","parentPath","top","j","key","parentKey","path","node","children","ch","hidden","positive","o","treemapValues","visit","b","shrink","r","d","layoutTreemap","c","tree","rootTotal","shown","measureShown","shownTotal","emptyLayout","gap","finite","headers","nameFont","font","theme","valueFont","headerFont","items","dark","relativeLuminance","level","sorted","list","rects","step","cell","color","parentColor","resolveWith","mix","content","toCss","title","ellipsize","measure","fill","readableFill","css","ink","textOn","name","value","percent","area","enter","clamp"],"sources":["../../../../../charts/src/engine/shapes/treemap.ts"],"sourcesContent":["// Treemap layout: squarified rectangles, parent headers, a palette color per\n// top-level node and lighter shades for its children.\n\nimport { mix, toCss, type Rgba } from \"../color\";\nimport { font } from \"../overlay\";\nimport {\n  clamp,\n  ellipsize,\n  emptyLayout,\n  finite,\n  positive,\n  readableFill,\n  relativeLuminance,\n  resolveWith,\n  sum,\n  textOn,\n  uniqueKeys,\n  type LayoutContext,\n  type LayoutResult,\n  type ShapeItem,\n  type ShapeNode,\n  type ShapeRect,\n} from \"./scene\";\nimport type { TreemapChartOptions, TreemapNode } from \"./types\";\n\nconst HEADER = 20;\n\n/**\n * Squarified treemap (Bruls et al.): rectangles of areas proportional to\n * `values` (best sorted descending) filling `rect`, with aspect ratios close to 1.\n */\nexport const squarify = (\n  values: readonly number[],\n  rect: ShapeRect,\n): ShapeRect[] => {\n  const out: ShapeRect[] = values.map(() => ({\n    x: rect.x,\n    y: rect.y,\n    width: 0,\n    height: 0,\n  }));\n  const total = sum(values.map((v) => Math.max(0, v)));\n  if (total <= 0 || rect.width <= 0 || rect.height <= 0) return out;\n  const scale = (rect.width * rect.height) / total;\n  const areas = values.map((v) => Math.max(0, v) * scale);\n  let { x, y, width: w, height: h } = rect;\n\n  const worst = (s: number, min: number, max: number, side: number) => {\n    const s2 = s * s;\n    const side2 = side * side;\n    return Math.max((side2 * max) / s2, s2 / (side2 * min));\n  };\n  const place = (row: number[], s: number) => {\n    if (w >= h) {\n      const cw = h > 0 ? Math.min(w, s / h) : 0;\n      let yy = y;\n      for (const i of row) {\n        const hh = cw > 0 ? areas[i] / cw : 0;\n        out[i] = { x, y: yy, width: cw, height: hh };\n        yy += hh;\n      }\n      x += cw;\n      w = Math.max(0, w - cw);\n    } else {\n      const rh = w > 0 ? Math.min(h, s / w) : 0;\n      let xx = x;\n      for (const i of row) {\n        const ww = rh > 0 ? areas[i] / rh : 0;\n        out[i] = { x: xx, y, width: ww, height: rh };\n        xx += ww;\n      }\n      y += rh;\n      h = Math.max(0, h - rh);\n    }\n  };\n\n  let row: number[] = [];\n  let rowSum = 0;\n  let rowMin = Infinity;\n  let rowMax = 0;\n  areas.forEach((a, i) => {\n    if (a <= 0) return;\n    if (row.length) {\n      const side = Math.min(w, h);\n      const next = worst(\n        rowSum + a,\n        Math.min(rowMin, a),\n        Math.max(rowMax, a),\n        side,\n      );\n      if (next > worst(rowSum, rowMin, rowMax, side)) {\n        place(row, rowSum);\n        row = [];\n        rowSum = 0;\n        rowMin = Infinity;\n        rowMax = 0;\n      }\n    }\n    row.push(i);\n    rowSum += a;\n    rowMin = Math.min(rowMin, a);\n    rowMax = Math.max(rowMax, a);\n  });\n  if (row.length) place(row, rowSum);\n  return out;\n};\n\ninterface Built {\n  node: TreemapNode;\n  key: string;\n  path: string[];\n  top: number;\n  /** Index in the flattened leaves (leaves only) */\n  leaf: number;\n  target: number;\n  children: Built[];\n}\n\n/** Tree with the target values; hidden top-level nodes count 0 */\nconst build = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n): Built[] => {\n  let leafCount = 0;\n  const walk = (\n    nodes: readonly TreemapNode[],\n    parentKey: string,\n    parentPath: string[],\n    top: number,\n  ): Built[] => {\n    const keys = uniqueKeys(nodes.map((nd) => nd.name));\n    return nodes.map((node, j) => {\n      const t = parentPath.length ? top : j;\n      const key = `${parentKey}/${keys[j]}`;\n      const path = [...parentPath, node.name];\n      if (node.children?.length) {\n        const children = walk(node.children, key, path, t);\n        return {\n          node,\n          key,\n          path,\n          top: t,\n          leaf: -1,\n          target: sum(children.map((ch) => ch.target)),\n          children,\n        };\n      }\n      return {\n        node,\n        key,\n        path,\n        top: t,\n        leaf: leafCount++,\n        target: hidden.has(t) ? 0 : positive(node.value),\n        children: [],\n      };\n    });\n  };\n  return walk(o.data, \"\", [], 0);\n};\n\nexport const treemapValues = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n  out: Map<string, number>,\n) => {\n  const visit = (nodes: Built[]) =>\n    nodes.forEach((b) => {\n      if (b.children.length) visit(b.children);\n      else out.set(b.key, b.target);\n    });\n  visit(build(o, hidden));\n};\n\n/** Leaves in the flattened order (the hover / click `index`) */\nexport const treemapLeaves = (data: readonly TreemapNode[]) => {\n  const leaves: { node: TreemapNode; path: string[] }[] = [];\n  const visit = (nodes: readonly TreemapNode[], path: string[]) =>\n    nodes.forEach((node) => {\n      const p = [...path, node.name];\n      if (node.children?.length) visit(node.children, p);\n      else leaves.push({ node, path: p });\n    });\n  visit(data, []);\n  return leaves;\n};\n\nconst shrink = (r: ShapeRect, d: number): ShapeRect => ({\n  x: r.x + d,\n  y: r.y + d,\n  width: Math.max(0, r.width - 2 * d),\n  height: Math.max(0, r.height - 2 * d),\n});\n\nexport const layoutTreemap = (\n  o: TreemapChartOptions,\n  c: LayoutContext,\n): LayoutResult => {\n  const { theme, area, measure, hidden } = c;\n  const tree = build(o, hidden);\n  const rootTotal = sum(tree.map((b) => b.target));\n  // displayed (animated) values\n  const shown = new Map<Built, number>();\n  const measureShown = (b: Built): number => {\n    const v = b.children.length\n      ? sum(b.children.map(measureShown))\n      : Math.max(0, c.value(b.key, b.target));\n    shown.set(b, v);\n    return v;\n  };\n  const shownTotal = sum(tree.map(measureShown));\n  if (rootTotal <= 0 && shownTotal <= 1e-9) return emptyLayout(c);\n\n  const gap = Math.max(0, finite(o.gap, 2));\n  const headers = o.headers !== false;\n  const nameFont = font(theme, 12, 500);\n  const valueFont = font(theme, 11);\n  const headerFont = font(theme, 11, 600);\n  const nodes: ShapeNode[] = [];\n  const items: ShapeItem[] = [];\n  // dark themes: fills slightly toward the background so that labels read well\n  const dark = relativeLuminance(theme.background) < 0.2;\n\n  const level = (list: Built[], rect: ShapeRect, parentColor: Rgba | null) => {\n    const sorted = list\n      .filter((b) => (shown.get(b) ?? 0) > 1e-9)\n      .sort((a, b) => (shown.get(b) ?? 0) - (shown.get(a) ?? 0));\n    const rects = squarify(\n      sorted.map((b) => shown.get(b) ?? 0),\n      rect,\n    );\n    const step = Math.min(0.14, 0.5 / Math.max(1, sorted.length - 1));\n    sorted.forEach((b, j) => {\n      const cell = shrink(rects[j], gap / 2);\n      if (cell.width < 1 || cell.height < 1) return;\n      const color = parentColor\n        ? b.node.color\n          ? resolveWith(theme, b.node.color, parentColor)\n          : mix(parentColor, theme.background, j * step)\n        : c.color(b.node.color, b.top);\n      if (b.children.length) {\n        let content = cell;\n        if (headers && cell.height > HEADER + 14 && cell.width > 36) {\n          nodes.push({\n            kind: \"rect\",\n            x: cell.x,\n            y: cell.y,\n            width: cell.width,\n            height: cell.height,\n            radius: 4,\n            fill: toCss(color, 0.14),\n          });\n          const title = ellipsize(\n            b.node.name,\n            cell.width - 12,\n            headerFont,\n            measure,\n          );\n          if (title)\n            nodes.push({\n              kind: \"text\",\n              x: cell.x + 6,\n              y: cell.y + HEADER / 2 + 1,\n              text: title,\n              font: headerFont,\n              color: toCss(theme.text, 0.85),\n              align: \"left\",\n              baseline: \"middle\",\n            });\n          content = {\n            x: cell.x + 2,\n            y: cell.y + HEADER,\n            width: cell.width - 4,\n            height: cell.height - HEADER - 2,\n          };\n        }\n        level(b.children, content, color);\n        return;\n      }\n      const fill = readableFill(\n        dark ? mix(color, theme.background, 0.18) : color,\n      );\n      const css = toCss(fill);\n      nodes.push({\n        kind: \"rect\",\n        x: cell.x,\n        y: cell.y,\n        width: cell.width,\n        height: cell.height,\n        radius: Math.min(4, cell.width / 2, cell.height / 2),\n        fill: css,\n        hit: b.leaf,\n        brighten: true,\n      });\n      if (cell.width >= 36 && cell.height >= 22) {\n        const ink = textOn(fill);\n        const name = ellipsize(b.node.name, cell.width - 12, nameFont, measure);\n        if (name)\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 6,\n            text: name,\n            font: nameFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n        const value = c.format(b.target);\n        if (\n          name &&\n          cell.height >= 38 &&\n          measure(value, valueFont) <= cell.width - 12\n        )\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 22,\n            text: value,\n            font: valueFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n      }\n      if (b.target > 0) {\n        const percent = rootTotal > 0 ? b.target / rootTotal : 0;\n        items.push({\n          index: b.leaf,\n          name: b.node.name,\n          value: b.target,\n          percent,\n          share: c.percent(percent),\n          color: css,\n          path: b.path,\n          x: cell.x + cell.width / 2,\n          y: cell.y + cell.height / 2,\n          rows: [\n            { name: c.labels.value, value: c.format(b.target) },\n            { name: c.labels.share, value: c.percent(percent) },\n          ],\n        });\n      }\n    });\n  };\n  level(tree, area, null);\n  items.sort((a, b) => a.index - b.index);\n\n  const enter = clamp(c.enter, 0, 1);\n  return {\n    nodes,\n    items,\n    dim: 0.55,\n    empty: false,\n    ...(enter < 1\n      ? {\n          enter: {\n            alpha: enter,\n            scale: 0.94 + 0.06 * enter,\n            cx: area.x + area.width / 2,\n            cy: area.y + area.height / 2,\n          },\n        }\n      : {}),\n  };\n};\n"],"mappings":";;;;AAyBA,IAAMA,IAAS,IAMFC,KACX,GACA,MACgB;CAChB,IAAMC,IAAmBC,EAAO,WAAW;EACzC,GAAGC,EAAK;EACR,GAAGA,EAAK;EACR,OAAO;EACP,QAAQ;CACV,EAAE,GACIC,IAAQC,EAAIH,EAAO,KAAK,MAAM,KAAK,IAAI,GAAGI,CAAC,CAAC,CAAC;CACnD,IAAIF,KAAS,KAAKD,EAAK,SAAS,KAAKA,EAAK,UAAU,GAAG,OAAOF;CAC9D,IAAMM,IAASJ,EAAK,QAAQA,EAAK,SAAUC,GACrCI,IAAQN,EAAO,KAAK,MAAM,KAAK,IAAI,GAAGI,CAAC,IAAIC,CAAK,GAClD,EAAE,MAAG,MAAG,OAAOE,GAAG,QAAQC,MAAMP,GAE9BQ,KAAS,GAAW,GAAa,GAAa,MAAiB;EACnE,IAAMC,IAAKC,IAAIA,GACTC,IAAQC,IAAOA;EACrB,OAAO,KAAK,IAAKD,IAAQE,IAAOJ,GAAIA,KAAME,IAAQG,EAAI;CACxD,GACMC,KAAS,GAAe,MAAc;EAC1C,IAAIT,KAAKC,GAAG;GACV,IAAMS,IAAKT,IAAI,IAAI,KAAK,IAAID,GAAGI,IAAIH,CAAC,IAAI,GACpCU,IAAKC;GACT,KAAK,IAAMC,KAAKC,GAAK;IACnB,IAAMC,IAAKL,IAAK,IAAIX,EAAMc,KAAKH,IAAK;IAEpC,AADA,EAAIG,KAAK;KAAE;KAAG,GAAGF;KAAI,OAAOD;KAAI,QAAQK;IAAG,GAC3C,KAAMA;GACR;GAEA,AADA,KAAKL,GACL,IAAI,KAAK,IAAI,GAAGV,IAAIU,CAAE;EACxB,OAAO;GACL,IAAMM,IAAKhB,IAAI,IAAI,KAAK,IAAIC,GAAGG,IAAIJ,CAAC,IAAI,GACpCiB,IAAKC;GACT,KAAK,IAAML,KAAKC,GAAK;IACnB,IAAMK,IAAKH,IAAK,IAAIjB,EAAMc,KAAKG,IAAK;IAEpC,AADA,EAAIH,KAAK;KAAE,GAAGI;KAAI;KAAG,OAAOE;KAAI,QAAQH;IAAG,GAC3C,KAAMG;GACR;GAEA,AADA,KAAKH,GACL,IAAI,KAAK,IAAI,GAAGf,IAAIe,CAAE;EACxB;CACF,GAEIF,IAAgB,CAAC,GACjBM,IAAS,GACTC,IAAS,UACTC,IAAS;CAyBb,OAxBAvB,EAAM,SAAS,GAAG,MAAM;EACtB,IAAI,OAAK,IACT;OAAIe,EAAI,QAAQ;IACd,IAAMR,IAAO,KAAK,IAAIN,GAAGC,CAAC;IAO1B,AANaC,EACXkB,IAASG,GACT,KAAK,IAAIF,GAAQE,CAAC,GAClB,KAAK,IAAID,GAAQC,CAAC,GAClBjB,CAEE,IAAOJ,EAAMkB,GAAQC,GAAQC,GAAQhB,CAAI,MAC3CG,EAAMK,GAAKM,CAAM,GACjB,IAAM,CAAC,GACP,IAAS,GACT,IAAS,UACT,IAAS;GAEb;GAIA,AAHAN,EAAI,KAAKD,CAAC,GACV,KAAUU,GACV,IAAS,KAAK,IAAIF,GAAQE,CAAC,GAC3B,IAAS,KAAK,IAAID,GAAQC,CAAC;EAJ3B;CAKF,CAAC,GACGT,EAAI,UAAQL,EAAMK,GAAKM,CAAM,GAC1B5B;AACT,GAcMgC,KACJ,GACA,MACY;CACZ,IAAIC,IAAY,GACVC,KACJ,GACA,GACA,GACA,MACY;EACZ,IAAMC,IAAOC,EAAWC,EAAM,KAAK,MAAOC,EAAG,IAAI,CAAC;EAClD,OAAOD,EAAM,KAAK,GAAM,MAAM;GAC5B,IAAME,IAAIC,EAAW,SAASC,IAAMC,GAC9BC,IAAM,GAAGC,EAAU,GAAGT,EAAKO,MAC3BG,IAAO,CAAC,GAAGL,GAAYM,EAAK,IAAI;GACtC,IAAIA,EAAK,UAAU,QAAQ;IACzB,IAAMC,IAAWb,EAAKY,EAAK,UAAUH,GAAKE,GAAMN,CAAC;IACjD,OAAO;KACL;KACA;KACA;KACA,KAAKA;KACL,MAAM;KACN,QAAQnC,EAAI2C,EAAS,KAAK,MAAOC,EAAG,MAAM,CAAC;KAC3C;IACF;GACF;GACA,OAAO;IACL;IACA;IACA;IACA,KAAKT;IACL,MAAM;IACN,QAAQU,EAAO,IAAIV,CAAC,IAAI,IAAIW,EAASJ,EAAK,KAAK;IAC/C,UAAU,CAAC;GACb;EACF,CAAC;CACH;CACA,OAAOZ,EAAKiB,EAAE,MAAM,IAAI,CAAC,GAAG,CAAC;AAC/B,GAEaC,KACX,GACA,GACA,MACG;CACH,IAAMC,KAAS,MACbhB,EAAM,SAAS,MAAM;EACnB,AAAIiB,EAAE,SAAS,SAAQD,EAAMC,EAAE,QAAQ,IAClCtD,EAAI,IAAIsD,EAAE,KAAKA,EAAE,MAAM;CAC9B,CAAC;CACH,EAAMtB,EAAMmB,GAAGF,CAAM,CAAC;AACxB,GAeMM,KAAU,GAAc,OAA0B;CACtD,GAAGC,EAAE,IAAIC;CACT,GAAGD,EAAE,IAAIC;CACT,OAAO,KAAK,IAAI,GAAGD,EAAE,QAAQ,IAAIC,CAAC;CAClC,QAAQ,KAAK,IAAI,GAAGD,EAAE,SAAS,IAAIC,CAAC;AACtC,IAEaC,KACX,GACA,MACiB;CACjB,IAAM,EAAE,UAAO,SAAM,YAAS,cAAWC,GACnCC,IAAO5B,EAAMmB,GAAGF,CAAM,GACtBY,IAAYzD,EAAIwD,EAAK,KAAK,MAAMN,EAAE,MAAM,CAAC,GAEzCQ,oBAAQ,IAAI,IAAmB,GAC/BC,KAAgB,MAAqB;EACzC,IAAM1D,IAAIiD,EAAE,SAAS,SACjBlD,EAAIkD,EAAE,SAAS,IAAIS,CAAY,CAAC,IAChC,KAAK,IAAI,GAAGJ,EAAE,MAAML,EAAE,KAAKA,EAAE,MAAM,CAAC;EAExC,OADAQ,EAAM,IAAIR,GAAGjD,CAAC,GACPA;CACT,GACM2D,IAAa5D,EAAIwD,EAAK,IAAIG,CAAY,CAAC;CAC7C,IAAIF,KAAa,KAAKG,KAAc,MAAM,OAAOC,EAAYN,CAAC;CAE9D,IAAMO,IAAM,KAAK,IAAI,GAAGC,EAAOhB,EAAE,KAAK,CAAC,CAAC,GAClCiB,IAAUjB,EAAE,YAAY,IACxBkB,IAAWC,EAAKC,GAAO,IAAI,GAAG,GAC9BC,IAAYF,EAAKC,GAAO,EAAE,GAC1BE,IAAaH,EAAKC,GAAO,IAAI,GAAG,GAChClC,IAAqB,CAAC,GACtBqC,IAAqB,CAAC,GAEtBC,IAAOC,EAAkBL,EAAM,UAAU,IAAI,IAE7CM,KAAS,GAAe,GAAiB,MAA6B;EAC1E,IAAMC,IAASC,EACZ,QAAQ,OAAOjB,EAAM,IAAIR,CAAC,KAAK,KAAK,IAAI,CAAC,CACzC,MAAM,GAAG,OAAOQ,EAAM,IAAIR,CAAC,KAAK,MAAMQ,EAAM,IAAI/B,CAAC,KAAK,EAAE,GACrDiD,IAAQjF,EACZ+E,EAAO,KAAK,MAAMhB,EAAM,IAAIR,CAAC,KAAK,CAAC,GACnCpD,CACF,GACM+E,IAAO,KAAK,IAAI,KAAM,KAAM,KAAK,IAAI,GAAGH,EAAO,SAAS,CAAC,CAAC;EAChE,EAAO,SAAS,GAAG,MAAM;GACvB,IAAMI,IAAO3B,EAAOyB,EAAMtC,IAAIwB,IAAM,CAAC;GACrC,IAAIgB,EAAK,QAAQ,KAAKA,EAAK,SAAS,GAAG;GACvC,IAAMC,IAAQC,IACV9B,EAAE,KAAK,QACL+B,EAAYd,GAAOjB,EAAE,KAAK,OAAO8B,CAAW,IAC5CE,EAAIF,GAAab,EAAM,YAAY7B,IAAIuC,CAAI,IAC7CtB,EAAE,MAAML,EAAE,KAAK,OAAOA,EAAE,GAAG;GAC/B,IAAIA,EAAE,SAAS,QAAQ;IACrB,IAAIiC,IAAUL;IACd,IAAId,KAAWc,EAAK,SAAS,MAAeA,EAAK,QAAQ,IAAI;KAC3D,EAAM,KAAK;MACT,MAAM;MACN,GAAGA,EAAK;MACR,GAAGA,EAAK;MACR,OAAOA,EAAK;MACZ,QAAQA,EAAK;MACb,QAAQ;MACR,MAAMM,EAAML,GAAO,GAAI;KACzB,CAAC;KACD,IAAMM,IAAQC,EACZpC,EAAE,KAAK,MACP4B,EAAK,QAAQ,IACbT,GACAkB,CACF;KAYA,AAXIF,KACFpD,EAAM,KAAK;MACT,MAAM;MACN,GAAG6C,EAAK,IAAI;MACZ,GAAGA,EAAK,IAAIpF,IAAS,IAAI;MACzB,MAAM2F;MACN,MAAMhB;MACN,OAAOe,EAAMjB,EAAM,MAAM,GAAI;MAC7B,OAAO;MACP,UAAU;KACZ,CAAC,GACH,IAAU;MACR,GAAGW,EAAK,IAAI;MACZ,GAAGA,EAAK,IAAIpF;MACZ,OAAOoF,EAAK,QAAQ;MACpB,QAAQA,EAAK,SAASpF,IAAS;KACjC;IACF;IACA,EAAMwD,EAAE,UAAUiC,GAASJ,CAAK;IAChC;GACF;GACA,IAAMS,IAAOC,EACXlB,IAAOW,EAAIH,GAAOZ,EAAM,YAAY,GAAI,IAAIY,CAC9C,GACMW,IAAMN,EAAMI,CAAI;GAYtB,IAXAvD,EAAM,KAAK;IACT,MAAM;IACN,GAAG6C,EAAK;IACR,GAAGA,EAAK;IACR,OAAOA,EAAK;IACZ,QAAQA,EAAK;IACb,QAAQ,KAAK,IAAI,GAAGA,EAAK,QAAQ,GAAGA,EAAK,SAAS,CAAC;IACnD,MAAMY;IACN,KAAKxC,EAAE;IACP,UAAU;GACZ,CAAC,GACG4B,EAAK,SAAS,MAAMA,EAAK,UAAU,IAAI;IACzC,IAAMa,IAAMC,EAAOJ,CAAI,GACjBK,IAAOP,EAAUpC,EAAE,KAAK,MAAM4B,EAAK,QAAQ,IAAIb,GAAUsB,CAAO;IACtE,AAAIM,KACF5D,EAAM,KAAK;KACT,MAAM;KACN,GAAG6C,EAAK,IAAI;KACZ,GAAGA,EAAK,IAAI;KACZ,MAAMe;KACN,MAAM5B;KACN,OAAO0B;KACP,OAAO;KACP,UAAU;KACV,KAAKzC,EAAE;IACT,CAAC;IACH,IAAM4C,IAAQvC,EAAE,OAAOL,EAAE,MAAM;IAC/B,AACE2C,KACAf,EAAK,UAAU,MACfS,EAAQO,GAAO1B,CAAS,KAAKU,EAAK,QAAQ,MAE1C7C,EAAM,KAAK;KACT,MAAM;KACN,GAAG6C,EAAK,IAAI;KACZ,GAAGA,EAAK,IAAI;KACZ,MAAMgB;KACN,MAAM1B;KACN,OAAOuB;KACP,OAAO;KACP,UAAU;KACV,KAAKzC,EAAE;IACT,CAAC;GACL;GACA,IAAIA,EAAE,SAAS,GAAG;IAChB,IAAM6C,IAAUtC,IAAY,IAAIP,EAAE,SAASO,IAAY;IACvD,EAAM,KAAK;KACT,OAAOP,EAAE;KACT,MAAMA,EAAE,KAAK;KACb,OAAOA,EAAE;KACT;KACA,OAAOK,EAAE,QAAQwC,CAAO;KACxB,OAAOL;KACP,MAAMxC,EAAE;KACR,GAAG4B,EAAK,IAAIA,EAAK,QAAQ;KACzB,GAAGA,EAAK,IAAIA,EAAK,SAAS;KAC1B,MAAM,CACJ;MAAE,MAAMvB,EAAE,OAAO;MAAO,OAAOA,EAAE,OAAOL,EAAE,MAAM;KAAE,GAClD;MAAE,MAAMK,EAAE,OAAO;MAAO,OAAOA,EAAE,QAAQwC,CAAO;KAAE,CACpD;IACF,CAAC;GACH;EACF,CAAC;CACH;CAEA,AADAtB,EAAMjB,GAAMwC,GAAM,IAAI,GACtB1B,EAAM,MAAM,GAAG,MAAM3C,EAAE,QAAQuB,EAAE,KAAK;CAEtC,IAAM+C,IAAQC,EAAM3C,EAAE,OAAO,GAAG,CAAC;CACjC,OAAO;EACL;EACA;EACA,KAAK;EACL,OAAO;EACP,GAAI0C,IAAQ,IACR,EACE,OAAO;GACL,OAAOA;GACP,OAAO,MAAO,MAAOA;GACrB,IAAID,EAAK,IAAIA,EAAK,QAAQ;GAC1B,IAAIA,EAAK,IAAIA,EAAK,SAAS;EAC7B,EACF,IACA,CAAC;CACP;AACF"}