minerva-design 1.3.0 → 1.5.0

package/dist/native/charts/src/engine/shapes/runtime.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runtime.js","names":["now","prefersReducedMotion","g","createShapeRuntime","options","initial","hidden","syncHidden","count","toggleCount","i","sorted","set","a","b","entered","entryStart","update","lastT","focus","currentFocus","resolveSunburstPath","animated","reducedMotion","displayed","targets","shapeValues","blendValues","transition","from","mutate","sameValues","next","index","proposed","nowHidden","before","path","enter","time","p","easeOutCubic","t","scene","layoutShapeScene","input"],"sources":["../../../../../../../charts/src/engine/shapes/runtime.ts"],"sourcesContent":["// Animation and visibility state shared by the DOM and canvas hosts: entry\n// animation, interpolation from the displayed values on updates / toggles.\n\nimport {\n  blendValues,\n  layoutShapeScene,\n  sameValues,\n  shapeValues,\n  toggleCount,\n  type ShapeLayoutInput,\n} from \"./layout\";\nimport { easeOutCubic, type ShapeScene } from \"./scene\";\nimport { resolveSunburstPath } from \"./sunburst\";\nimport type {\n  ShapeChartOptions,\n  ShapeDrillEvent,\n  ShapeToggleEvent,\n} from \"./types\";\n\n/** Duration of the entry animation, ms */\nexport const ENTER_MS = 600;\n/** Duration of the update animation, ms */\nexport const UPDATE_MS = 400;\n\nexport const now = () =>\n  typeof performance !== \"undefined\" && typeof performance.now === \"function\"\n    ? performance.now()\n    : Date.now();\n\n/** Whether the user prefers reduced motion (false without `matchMedia`) */\nexport const prefersReducedMotion = () => {\n  const g = globalThis as {\n    matchMedia?: (query: string) => { matches: boolean } | null;\n  };\n  try {\n    return !!g.matchMedia?.(\"(prefers-reduced-motion: reduce)\")?.matches;\n  } catch {\n    return false;\n  }\n};\n\nexport type ShapeFrameInput = Omit<\n  ShapeLayoutInput,\n  \"options\" | \"hidden\" | \"enter\" | \"from\" | \"t\" | \"focus\"\n>;\n\nexport interface ShapeRuntime {\n  readonly options: ShapeChartOptions;\n  readonly hidden: ReadonlySet<number>;\n  setOptions(options: ShapeChartOptions): void;\n  /**\n   * Hides / shows an entry (only proposes it when `options.hidden` controls\n   * the state); null when the index is out of range\n   */\n  toggle(index: number): ShapeToggleEvent | null;\n  /** Hidden indexes, ascending */\n  hiddenIndexes(): number[];\n  /**\n   * Sunburst: focuses the node at `path` (only proposes it when\n   * `options.drillPath` controls the focus); null when nothing would change\n   */\n  drill(path: readonly string[]): ShapeDrillEvent | null;\n  /** Sunburst: names from the root to the focused node */\n  drillPath(): string[];\n  /** Lays the scene out at time `time`; `animating` asks for another frame */\n  frame(\n    time: number,\n    input: ShapeFrameInput,\n  ): { scene: ShapeScene; animating: boolean };\n}\n\nexport const createShapeRuntime = (\n  initial: ShapeChartOptions,\n  reducedMotion: () => boolean = prefersReducedMotion,\n): ShapeRuntime => {\n  let options = initial;\n  const hidden = new Set<number>();\n  /** Replaces the hidden set by the controlled `hidden` option (if any) */\n  const syncHidden = () => {\n    const count = toggleCount(options);\n    if (options.hidden) {\n      hidden.clear();\n      for (const i of options.hidden)\n        if (Number.isInteger(i) && i >= 0 && i < count) hidden.add(i);\n    } else for (const i of [...hidden]) if (i >= count) hidden.delete(i);\n  };\n  syncHidden();\n  const sorted = (set: ReadonlySet<number>) => [...set].sort((a, b) => a - b);\n  let entered = false;\n  let entryStart: number | null = null;\n  let update: { from: Map<string, number>; start: number | null } | null = null;\n  let lastT = 1;\n  /** Sunburst focus of an uncontrolled chart */\n  let focus: string[] = [];\n  /** Focus in effect: the controlled `drillPath`, else the drilled one, made valid */\n  const currentFocus = (): string[] =>\n    options.type === \"sunburst\"\n      ? resolveSunburstPath(options, options.drillPath ?? focus, hidden)\n      : [];\n\n  const animated = () => options.animation !== false && !reducedMotion();\n\n  /** Values currently on screen */\n  const displayed = () => {\n    const targets = shapeValues(options, hidden, currentFocus());\n    return update && lastT < 1\n      ? blendValues(update.from, targets, lastT)\n      : targets;\n  };\n\n  const transition = (mutate: () => void) => {\n    const from = displayed();\n    mutate();\n    if (!animated()) {\n      update = null;\n      entered = true;\n      return;\n    }\n    if (!sameValues(from, shapeValues(options, hidden, currentFocus()))) {\n      update = { from, start: null };\n      lastT = 0;\n    }\n  };\n\n  return {\n    get options() {\n      return options;\n    },\n    hidden,\n    setOptions(next) {\n      if (next.type !== options.type) {\n        options = next;\n        hidden.clear();\n        focus = [];\n        syncHidden();\n        entered = false;\n        entryStart = null;\n        update = null;\n        lastT = 1;\n        return;\n      }\n      transition(() => {\n        options = next;\n        syncHidden();\n      });\n    },\n    toggle(index) {\n      if (!(Number.isInteger(index) && index >= 0)) return null;\n      if (index >= toggleCount(options)) return null;\n      const proposed = new Set(hidden);\n      const nowHidden = !proposed.has(index);\n      if (nowHidden) proposed.add(index);\n      else proposed.delete(index);\n      if (!options.hidden)\n        transition(() => {\n          if (nowHidden) hidden.add(index);\n          else hidden.delete(index);\n        });\n      return { index, hidden: nowHidden, hiddenIndexes: sorted(proposed) };\n    },\n    hiddenIndexes: () => sorted(hidden),\n    drill(path) {\n      if (options.type !== \"sunburst\") return null;\n      const before = currentFocus();\n      const next = resolveSunburstPath(options, path, hidden);\n      if (next.join(\"\\u0000\") === before.join(\"\\u0000\")) return null;\n      if (!options.drillPath)\n        transition(() => {\n          focus = next;\n        });\n      return { path: next };\n    },\n    drillPath: () => currentFocus(),\n    frame(time, input) {\n      let enter = 1;\n      if (!entered) {\n        if (!animated()) entered = true;\n        else {\n          if (entryStart === null) entryStart = time;\n          const p = (time - entryStart) / ENTER_MS;\n          enter = easeOutCubic(p);\n          if (p >= 1) {\n            entered = true;\n            enter = 1;\n          }\n        }\n      }\n      let t = 1;\n      if (update) {\n        if (!animated()) update = null;\n        else {\n          if (update.start === null) update.start = time;\n          const p = (time - update.start) / UPDATE_MS;\n          t = p >= 1 ? 1 : easeOutCubic(p);\n        }\n      }\n      lastT = t;\n      const scene = layoutShapeScene({\n        ...input,\n        options,\n        hidden,\n        enter,\n        from: update?.from ?? null,\n        t,\n        focus: currentFocus(),\n      });\n      if (update && t >= 1) update = null;\n      return { scene, animating: !entered || update !== null };\n    },\n  };\n};\n"],"mappings":";;;AAwBA,IAAaA,UACX,OAAO,cAAgB,OAAe,OAAO,YAAY,OAAQ,aAC7D,YAAY,IAAI,IAChB,KAAK,IAAI,GAGFC,UAA6B;CACxC,IAAMC,IAAI;CAGV,IAAI;EACF,OAAO,CAAC,CAACA,EAAE,aAAa,kCAAkC,CAAC,EAAE;CAC/D,QAAQ;EACN,OAAO;CACT;AACF,GAgCaC,KACX,GACA,IAA+BF,MACd;CACjB,IAAIG,IAAUC,GACRC,oBAAS,IAAI,IAAY,GAEzBC,UAAmB;EACvB,IAAMC,IAAQC,EAAYL,CAAO;EACjC,IAAIA,EAAQ,QAAQ;GAClB,EAAO,MAAM;GACb,KAAK,IAAMM,KAAKN,EAAQ,QACtB,AAAI,OAAO,UAAUM,CAAC,KAAKA,KAAK,KAAKA,IAAIF,KAAOF,EAAO,IAAII,CAAC;EAChE,OAAO,KAAK,IAAMA,KAAK,CAAC,GAAGJ,CAAM,GAAG,AAAII,KAAKF,KAAOF,EAAO,OAAOI,CAAC;CACrE;CACA,EAAW;CACX,IAAMC,KAAU,MAA6B,CAAC,GAAGC,CAAG,CAAC,CAAC,MAAM,GAAG,MAAMC,IAAIC,CAAC,GACtEC,IAAU,IACVC,IAA4B,MAC5BC,IAAqE,MACrEC,IAAQ,GAERC,IAAkB,CAAC,GAEjBC,UACJhB,EAAQ,SAAS,aACbiB,EAAoBjB,GAASA,EAAQ,aAAae,GAAOb,CAAM,IAC/D,CAAC,GAEDgB,UAAiBlB,EAAQ,cAAc,MAAS,CAACmB,EAAc,GAG/DC,UAAkB;EACtB,IAAMC,IAAUC,EAAYtB,GAASE,GAAQc,EAAa,CAAC;EAC3D,OAAOH,KAAUC,IAAQ,IACrBS,EAAYV,EAAO,MAAMQ,GAASP,CAAK,IACvCO;CACN,GAEMG,KAAc,MAAuB;EACzC,IAAMC,IAAOL,EAAU;EAEvB,IADAM,EAAO,GACH,CAACR,EAAS,GAAG;GAEf,AADA,IAAS,MACT,IAAU;GACV;EACF;EACA,AAAKS,EAAWF,GAAMH,EAAYtB,GAASE,GAAQc,EAAa,CAAC,CAAC,MAChE,IAAS;GAAE;GAAM,OAAO;EAAK,GAC7B,IAAQ;CAEZ;CAEA,OAAO;EACL,IAAI,UAAU;GACZ,OAAOhB;EACT;EACA;EACA,WAAW,GAAM;GACf,IAAI4B,EAAK,SAAS5B,EAAQ,MAAM;IAQ9B,AAPA,IAAU4B,GACV1B,EAAO,MAAM,GACb,IAAQ,CAAC,GACTC,EAAW,GACX,IAAU,IACV,IAAa,MACb,IAAS,MACT,IAAQ;IACR;GACF;GACA,QAAiB;IAEf,AADA,IAAUyB,GACVzB,EAAW;GACb,CAAC;EACH;EACA,OAAO,GAAO;GAEZ,IADI,EAAE,OAAO,UAAU0B,CAAK,KAAKA,KAAS,MACtCA,KAASxB,EAAYL,CAAO,GAAG,OAAO;GAC1C,IAAM8B,IAAW,IAAI,IAAI5B,CAAM,GACzB6B,IAAY,CAACD,EAAS,IAAID,CAAK;GAQrC,OAPIE,IAAWD,EAAS,IAAID,CAAK,IAC5BC,EAAS,OAAOD,CAAK,GACrB7B,EAAQ,UACXwB,QAAiB;IACf,AAAIO,IAAW7B,EAAO,IAAI2B,CAAK,IAC1B3B,EAAO,OAAO2B,CAAK;GAC1B,CAAC,GACI;IAAE;IAAO,QAAQE;IAAW,eAAexB,EAAOuB,CAAQ;GAAE;EACrE;EACA,qBAAqBvB,EAAOL,CAAM;EAClC,MAAM,GAAM;GACV,IAAIF,EAAQ,SAAS,YAAY,OAAO;GACxC,IAAMgC,IAAShB,EAAa,GACtBY,IAAOX,EAAoBjB,GAASiC,GAAM/B,CAAM;GAMtD,OALI0B,EAAK,KAAK,IAAQ,MAAMI,EAAO,KAAK,IAAQ,IAAU,QACrDhC,EAAQ,aACXwB,QAAiB;IACf,IAAQI;GACV,CAAC,GACI,EAAE,MAAMA,EAAK;EACtB;EACA,iBAAiBZ,EAAa;EAC9B,MAAM,GAAM,GAAO;GACjB,IAAIkB,IAAQ;GACZ,IAAI,CAACvB,GAAS;IACZ,IAAI,CAACO,EAAS,GAAG,IAAU;SACtB;KACH,AAAIN,MAAe,SAAM,IAAauB;KACtC,IAAMC,KAAKD,IAAOvB,KAAA;KAElB,AADA,IAAQyB,EAAaD,CAAC,GAClBA,KAAK,MACP,IAAU,IACV,IAAQ;IAEZ;GACF;GACA,IAAIE,IAAI;GACR,IAAIzB,GAAQ;IACV,IAAI,CAACK,EAAS,GAAG,IAAS;SACrB;KACH,AAAIL,EAAO,UAAU,SAAM,EAAO,QAAQsB;KAC1C,IAAMC,KAAKD,IAAOtB,EAAO,SAAA;KACzB,IAAIuB,KAAK,IAAI,IAAIC,EAAaD,CAAC;IACjC;GACF;GACA,IAAQE;GACR,IAAMC,IAAQC,EAAiB;IAC7B,GAAGC;IACH;IACA;IACA;IACA,MAAM5B,GAAQ,QAAQ;IACtB;IACA,OAAOG,EAAa;GACtB,CAAC;GAED,OADIH,KAAUyB,KAAK,MAAG,IAAS,OACxB;IAAE;IAAO,WAAW,CAAC3B,KAAWE,MAAW;GAAK;EACzD;CACF;AACF"}

package/dist/native/charts/src/engine/shapes/sankey.cjs

@@ -0,0 +1,2 @@
+const e=require("../color.cjs"),t=require("../overlay.cjs"),n=require("./scene.cjs"),r=require("./labels.cjs");var i=e=>{let t=[],r=[],i=[],a=new Map;for(let n of e.nodes??[])a.set(n.name,a.get(n.name)??t.length),t.push(n.name),r.push(n.color),i.push(typeof n.column==`number`&&Number.isFinite(n.column)?Math.max(0,Math.round(n.column)):void 0);let o=t.length,s=e=>{if(typeof e==`number`)return Number.isInteger(e)&&e>=0&&e<o?e:-1;if(typeof e!=`string`)return-1;let n=a.get(e);return n===void 0?(a.set(e,t.length),t.push(e),r.push(void 0),i.push(void 0),t.length-1):n},c=[],l=(e,t)=>{let n=new Set([e]),r=[e];for(;r.length;){let e=r.pop();if(e===t)return!0;for(let t of c[e]??[])n.has(t)||(n.add(t),r.push(t))}return!1},u=[];return(e.links??[]).forEach((e,t)=>{if(!e)return;let r=s(e.source),i=s(e.target);r<0||i<0||r===i||l(i,r)||((c[r]??(c[r]=[])).push(i),u.push({link:t,source:r,target:i,value:n.positive(e.value),...e.color?{color:e.color}:{}}))}),{names:t,colors:r,columns:i,edges:u}},a=e=>n.uniqueKeys(e.edges.map(t=>`${e.names[t.source]}\u2192${e.names[t.target]}`)),o=(e,t,n)=>{let r=i(e);a(r).forEach((e,i)=>{let a=r.edges[i];n.set(e,t.has(a.source)||t.has(a.target)?0:a.value)})},s=(e,t=`justify`)=>{let n=e.names.length,r=Array.from({length:n},()=>[]),i=Array.from({length:n},()=>[]);for(let t of e.edges)r[t.source].push(t.target),i[t.target].push(t.source);let a=[],o=i.map(e=>e.length),s=[];for(o.forEach((e,t)=>{e||s.push(t)});s.length;){let e=s.shift();a.push(e);for(let t of r[e])--o[t]===0&&s.push(t)}let c=Array(n).fill(0);for(let e of a)for(let t of r[e])c[t]=Math.max(c[t],c[e]+1);let l=Array(n).fill(0);for(let e=a.length-1;e>=0;e--){let t=a[e];for(let e of r[t])l[t]=Math.max(l[t],l[e]+1)}let u=Math.max(0,...c),d=c.map((e,n)=>{switch(t){case`left`:return e;case`right`:return u-l[n];case`center`:return i[n].length?e:r[n].length?Math.min(...r[n].map(e=>c[e]))-1:0;default:return r[n].length?e:u}});return e.columns.forEach((e,t)=>{e!==void 0&&(d[t]=e)}),d},c=(e,t,n,r,i,a)=>{let o=e=>e.outs.map(e=>t[e]),s=e=>e.ins.map(e=>t[e]),c=e=>{e.outs.sort((e,n)=>t[e].target.y0-t[n].target.y0),e.ins.sort((e,n)=>t[e].source.y0-t[n].source.y0)},l=(e,t)=>{let n=e.y0-(e.outs.length-1)*i/2;for(let r of o(e)){if(r.target===t)break;n+=r.width+i}for(let r of s(t)){if(r.source===e)break;n-=r.width}return n},u=(e,t)=>{let n=t.y0-(t.ins.length-1)*i/2;for(let r of s(t)){if(r.source===e)break;n+=r.width+i}for(let r of o(e)){if(r.target===t)break;n-=r.width}return n},d=(e,t,n,r)=>{for(let a=n;a<e.length;a++){let n=e[a],o=(t-n.y0)*r;o>1e-6&&(n.y0+=o,n.y1+=o),t=n.y1+i}},f=(e,t,n,r)=>{for(let a=n;a>=0;a--){let n=e[a],o=(n.y1-t)*r;o>1e-6&&(n.y0-=o,n.y1-=o),t=n.y0-i}},p=(e,t)=>{let a=e.length>>1,o=e[a];o&&(f(e,o.y0-i,a-1,t),d(e,o.y1+i,a+1,t),f(e,r,e.length-1,t),d(e,n,0,t))},m=(e,t)=>e.y0-t.y0;for(let t of e){let e=n;for(let n of t){let t=n.y1-n.y0;n.y0=e,n.y1=e+t,e=n.y1+i}let a=(r-e+i)/(t.length+1);t.forEach((e,t)=>{e.y0+=a*(t+1),e.y1+=a*(t+1)})}for(let t of e)t.forEach(c);for(let t=0;t<a;t++){let n=.99**t,r=Math.max(1-n,(t+1)/a);for(let t=e.length-2;t>=0;t--){let i=e[t];for(let e of i){let t=0,r=0;for(let n of o(e)){let i=n.value*(n.target.col-e.col);t+=u(e,n.target)*i,r+=i}if(!(r>0))continue;let i=(t/r-e.y0)*n;e.y0+=i,e.y1+=i,c(e)}i.sort(m),p(i,r)}for(let t=1;t<e.length;t++){let i=e[t];for(let e of i){let t=0,r=0;for(let n of s(e)){let i=n.value*(e.col-n.source.col);t+=l(n.source,e)*i,r+=i}if(!(r>0))continue;let i=(t/r-e.y0)*n;e.y0+=i,e.y1+=i,c(e)}i.sort(m),p(i,r)}}for(let t of e)t.forEach(c)},l=6,u=16,d=(o,d)=>{let{theme:f,area:p,measure:m,hidden:h}=d,g=i(o),_=a(g),v=g.names.length,y=g.edges.map(e=>h.has(e.source)||h.has(e.target)?0:e.value),b=y.map((e,t)=>Math.max(0,d.value(_[t],e)));if(n.sum(b)<=1e-9)return n.emptyLayout(d);let x=s(g,o.align),S=Array(v).fill(0),C=Array(v).fill(0),w=Array(v).fill(0),T=Array(v).fill(0);g.edges.forEach((e,t)=>{C[e.source]+=y[t],S[e.target]+=y[t],T[e.source]+=b[t],w[e.target]+=b[t]});let E=g.names.map((e,t)=>{let n=Math.max(w[t],T[t]);return n>1e-9?{i:t,col:x[t],value:n,x0:0,x1:0,y0:0,y1:0,outs:[],ins:[]}:null}),D=[...new Set(E.filter(e=>e).map(e=>e.col))].sort((e,t)=>e-t),O=new Map(D.map((e,t)=>[e,t])),k=D.map(()=>[]);for(let e of E)e&&(e.col=O.get(e.col)??0,k[e.col].push(e));let A=[];g.edges.forEach((e,t)=>{let n=E[e.source],r=E[e.target];!n||!r||b[t]<=1e-9||(n.outs.push(A.length),r.ins.push(A.length),A.push({k:t,source:n,target:r,value:b[t],width:0,y0:0,y1:0}))});let j=n.clamp(n.finite(o.nodeWidth,12),1,64),M=k.length,N=p.y+2,P=p.y+p.height-2,F=Math.max(1,P-N),I=Math.max(1,...k.map(e=>e.length)),L=Math.min(Math.max(0,n.finite(o.nodePadding,12)),I>1?F*.5/(I-1):1/0),R=Math.min(...k.map(e=>(F-(e.length-1)*L)/Math.max(1e-9,n.sum(e.map(e=>e.value))))),z=M>1?(p.width-j)/(M-1):0;k.forEach((e,t)=>{let n=M>1?p.x+t*z:p.x+(p.width-j)/2;for(let t of e)t.x0=n,t.x1=n+j,t.y0=0,t.y1=t.value*R});for(let e of A)e.width=e.value*R;c(k,A,N,P,L,Math.round(n.clamp(n.finite(o.iterations,32),0,200)));for(let e of k)for(let t of e){let e=t.y0;for(let n of t.outs)A[n].y0=e+A[n].width/2,e+=A[n].width;e=t.y0;for(let n of t.ins)A[n].y1=e+A[n].width/2,e+=A[n].width}let B=g.names.map((e,t)=>d.color(g.colors[t],t)).map(t=>e.toCss(t)),V=e.mix(f.grid,f.textMuted,.45),H=o.linkColor??`gradient`,U=n.clamp(n.finite(o.linkOpacity,.4),.02,1),W=Math.min(1,U+.3),G=[],K=[],q=e=>v+g.edges[e.k].link,J=e=>[...e.ins.map(e=>q(A[e])),...e.outs.map(e=>q(A[e]))],Y=A.slice().sort((e,t)=>t.width-e.width);for(let t of Y){let n=g.edges[t.k].color,r,i;n?r=i=e.toCss(d.color(n,t.source.i)):H===`source`?r=i=B[t.source.i]:H===`target`?r=i=B[t.target.i]:H===`neutral`?r=i=e.toCss(V):(r=B[t.source.i],i=B[t.target.i]),G.push({kind:`link`,x0:t.source.x1,y0:t.y0,x1:t.target.x0,y1:t.y1,width:t.width,color0:r,color1:i,alpha:U,activeAlpha:W,hit:q(t),also:[t.source.i,t.target.i]})}for(let e of k)for(let t of e)G.push({kind:`rect`,x:t.x0,y:t.y0,width:t.x1-t.x0,height:Math.max(1,t.y1-t.y0),radius:Math.min(2,j/2),fill:B[t.i],hit:t.i,also:J(t),brighten:!0});if(o.labels!==!1){let r=t.font(f,12,500),i=t.font(f,12),a=e.toCss(f.background,.8),s=[],c=M>1?Math.max(0,z-j-12):p.width,h=k.flat().slice().sort((e,t)=>Number(t.col===M-1)-Number(e.col===M-1)||t.value-e.value);for(let t of h){let h=M>1&&t.col===M-1,_=o.labelValues===!1?``:d.format(Math.max(S[t.i],C[t.i])),v=_?m(_,i):0,y=n.ellipsize(g.names[t.i],c-(_?v+6:0),r,m);if(!y&&_&&(_=``,v=0,y=n.ellipsize(g.names[t.i],c,r,m)),!y)continue;let b=m(y,r)+(_?6+v:0),x=h?[!0,!1]:[!1,!0],w=Math.max(0,(t.y1-t.y0)/2-u/2+2),T=[0];for(let e=6;e<=w;e+=6)T.push(e,-e);let E=null;for(let e of x){let n=e?t.x0-l:t.x1+l,r=e?n-b:n;if(!(r<p.x-2||r+b>p.x+p.width+2)){for(let e of T){let n=(t.y0+t.y1)/2+e,i={x0:r,x1:r+b,y0:n-u/2,y1:n+u/2};if(!(i.y0<p.y-4||i.y1>p.y+p.height+4||s.some(e=>e.x0<i.x1&&i.x0<e.x1&&e.y0<i.y1&&i.y0<e.y1))){E=i;break}}if(E)break}}if(!E)continue;s.push(E);let D=(E.y0+E.y1)/2,O=J(t);G.push({kind:`text`,x:E.x0,y:D,text:y,font:r,color:e.toCss(f.text),align:`left`,baseline:`middle`,halo:a,hit:t.i,also:O}),_&&G.push({kind:`text`,x:E.x1,y:D,text:_,font:i,color:e.toCss(f.textMuted),align:`right`,baseline:`middle`,halo:a,hit:t.i,also:O})}}let X=n.sum(g.names.map((e,t)=>S[t]<=0?C[t]:0));for(let e of k)for(let t of e.slice().sort((e,t)=>e.y0-t.y0)){let e=Math.max(S[t.i],C[t.i]);if(e<=0)continue;let n=X>0?e/X:0;K.push({index:t.i,name:g.names[t.i],value:e,percent:n,share:d.percent(n),color:B[t.i],x:(t.x0+t.x1)/2,y:(t.y0+t.y1)/2,rows:[{name:d.labels.value,value:d.format(e)},...S[t.i]>0?[{name:d.labels.incoming,value:d.format(S[t.i])}]:[],...C[t.i]>0?[{name:d.labels.outgoing,value:d.format(C[t.i])}]:[]]})}let Z=A.slice().sort((e,t)=>e.source.col-t.source.col||e.y0-t.y0||e.target.y0-t.target.y0);for(let e of Z){let t=g.edges[e.k],n=y[e.k];if(n<=0)continue;let i=g.names[t.source],a=g.names[t.target],o=C[t.source]>0?n/C[t.source]:0,s=S[t.target]>0?n/S[t.target]:0;K.push({index:q(e),name:`${i} \u2192 ${a}`,value:n,percent:o,share:d.percent(o),color:B[t.source],x:(e.source.x1+e.target.x0)/2,y:(e.y0+e.y1)/2,rows:[{name:d.labels.value,value:d.format(n)},{name:r.interpolate(d.labels.ofName,{name:i}),value:d.percent(o)},{name:r.interpolate(d.labels.ofName,{name:a}),value:d.percent(s)}],event:{source:i,target:a}})}let Q=n.clamp(d.enter,0,1);return{nodes:G,items:K,dim:.3,empty:!1,...Q<1?{enter:{alpha:Q,scale:.97+.03*Q,cx:p.x+p.width/2,cy:p.y+p.height/2}}:{}}};exports.layoutSankey=d,exports.resolveSankey=i,exports.sankeyColumns=s,exports.sankeyValues=o;
+//# sourceMappingURL=sankey.cjs.map

package/dist/native/charts/src/engine/shapes/sankey.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sankey.cjs","names":["positive","uniqueKeys","sum","emptyLayout","clamp","finite","toCss","mix","font","ellipsize","interpolate","require_color","require_overlay","require_scene","require_labels","resolveSankey","names","colors","columns","byName","node","o","declared","resolve","end","known","out","reaches","seen","from","stack","n","to","m","edges","l","source","target","i","edgeKeys","g","e","sankeyValues","k","key","hidden","sankeyColumns","outs","ins","order","pending","queue","p","depth","height","t","last","align","d","col","relax","outsOf","insOf","reorder","a","b","targetTop","y","py","sourceTop","down","nodes","dy","alpha","up","collide","mid","subject","bottom","top","byY","h","extra","it","iterations","beta","c","w","v","LABEL_GAP","LABEL_LINE","layoutSankey","keys","targets","shown","columnOf","inT","outT","inV","outV","laid","value","used","rank","nodeWidth","ncols","area","maxCount","ky","step","x0","css","neutral","theme","mode","opacity","activeAlpha","items","linkIndex","linksOf","drawn","own","c0","c1","nameFont","valueFont","halo","boxes","room","valueW","measure","name","width","sides","reach","offsets","box","left","x","candidate","also","entering","percent","linkItems","ge","ofSource","ofTarget","enter"],"sources":["../../../../../../../charts/src/engine/shapes/sankey.ts"],"sourcesContent":["// Sankey layout: nodes in columns (longest path from the sources), heights\n// proportional to their flow, vertical positions relaxed toward the weighted\n// center of their neighbours (fewer crossings, straighter flows), links as\n// S-curves of constant thickness with a gradient from the source color.\n\nimport { mix, toCss, type Rgba } from \"../color\";\nimport { font } from \"../overlay\";\nimport { interpolate } from \"./labels\";\nimport {\n  clamp,\n  ellipsize,\n  emptyLayout,\n  finite,\n  positive,\n  sum,\n  uniqueKeys,\n  type LayoutContext,\n  type LayoutResult,\n  type ShapeItem,\n  type ShapeNode,\n} from \"./scene\";\nimport type { SankeyChartOptions } from \"./types\";\n\n/** A link that takes part in the layout */\nexport interface SankeyEdge {\n  /** Index in `options.links` */\n  link: number;\n  source: number;\n  target: number;\n  /** Target value (negative values count as 0) */\n  value: number;\n  color?: string;\n}\n\n/** Nodes (declared first, then the ones only named by links) and valid links */\nexport interface SankeyGraph {\n  names: string[];\n  colors: (string | undefined)[];\n  columns: (number | undefined)[];\n  edges: SankeyEdge[];\n}\n\n/**\n * Resolves the links' ends (names or indexes), appends the nodes only named\n * by links, drops self links, invalid ends and the links closing a cycle.\n */\nexport const resolveSankey = (o: SankeyChartOptions): SankeyGraph => {\n  const names: string[] = [];\n  const colors: (string | undefined)[] = [];\n  const columns: (number | undefined)[] = [];\n  const byName = new Map<string, number>();\n  for (const node of o.nodes ?? []) {\n    byName.set(node.name, byName.get(node.name) ?? names.length);\n    names.push(node.name);\n    colors.push(node.color);\n    columns.push(\n      typeof node.column === \"number\" && Number.isFinite(node.column)\n        ? Math.max(0, Math.round(node.column))\n        : undefined,\n    );\n  }\n  const declared = names.length;\n  const resolve = (end: string | number): number => {\n    if (typeof end === \"number\")\n      return Number.isInteger(end) && end >= 0 && end < declared ? end : -1;\n    if (typeof end !== \"string\") return -1;\n    const known = byName.get(end);\n    if (known !== undefined) return known;\n    byName.set(end, names.length);\n    names.push(end);\n    colors.push(undefined);\n    columns.push(undefined);\n    return names.length - 1;\n  };\n  const out: number[][] = [];\n  const reaches = (from: number, to: number) => {\n    const seen = new Set<number>([from]);\n    const stack = [from];\n    while (stack.length) {\n      const n = stack.pop() as number;\n      if (n === to) return true;\n      for (const m of out[n] ?? [])\n        if (!seen.has(m)) {\n          seen.add(m);\n          stack.push(m);\n        }\n    }\n    return false;\n  };\n  const edges: SankeyEdge[] = [];\n  (o.links ?? []).forEach((l, i) => {\n    if (!l) return;\n    const source = resolve(l.source);\n    const target = resolve(l.target);\n    if (source < 0 || target < 0 || source === target) return;\n    if (reaches(target, source)) return;\n    (out[source] ??= []).push(target);\n    edges.push({\n      link: i,\n      source,\n      target,\n      value: positive(l.value),\n      ...(l.color ? { color: l.color } : {}),\n    });\n  });\n  return { names, colors, columns, edges };\n};\n\nconst edgeKeys = (g: SankeyGraph) =>\n  uniqueKeys(\n    g.edges.map((e) => `${g.names[e.source]}\\u2192${g.names[e.target]}`),\n  );\n\n/** Target values of the links (0 when an end is hidden) */\nexport const sankeyValues = (\n  o: SankeyChartOptions,\n  hidden: ReadonlySet<number>,\n  out: Map<string, number>,\n) => {\n  const g = resolveSankey(o);\n  edgeKeys(g).forEach((key, k) => {\n    const e = g.edges[k];\n    out.set(key, hidden.has(e.source) || hidden.has(e.target) ? 0 : e.value);\n  });\n};\n\n/** Column of every node (`align` and the explicit `column`s) */\nexport const sankeyColumns = (\n  g: SankeyGraph,\n  align: SankeyChartOptions[\"align\"] = \"justify\",\n): number[] => {\n  const n = g.names.length;\n  const outs: number[][] = Array.from({ length: n }, () => []);\n  const ins: number[][] = Array.from({ length: n }, () => []);\n  for (const e of g.edges) {\n    outs[e.source].push(e.target);\n    ins[e.target].push(e.source);\n  }\n  // longest path from the sources (depth) and to the sinks (height)\n  const order: number[] = [];\n  const pending = ins.map((l) => l.length);\n  const queue: number[] = [];\n  pending.forEach((p, i) => {\n    if (!p) queue.push(i);\n  });\n  while (queue.length) {\n    const i = queue.shift() as number;\n    order.push(i);\n    for (const t of outs[i]) if (--pending[t] === 0) queue.push(t);\n  }\n  const depth = new Array<number>(n).fill(0);\n  for (const i of order)\n    for (const t of outs[i]) depth[t] = Math.max(depth[t], depth[i] + 1);\n  const height = new Array<number>(n).fill(0);\n  for (let k = order.length - 1; k >= 0; k--) {\n    const i = order[k];\n    for (const t of outs[i]) height[i] = Math.max(height[i], height[t] + 1);\n  }\n  const last = Math.max(0, ...depth);\n  const columns = depth.map((d, i) => {\n    switch (align) {\n      case \"left\":\n        return d;\n      case \"right\":\n        return last - height[i];\n      case \"center\":\n        return ins[i].length\n          ? d\n          : outs[i].length\n            ? Math.min(...outs[i].map((t) => depth[t])) - 1\n            : 0;\n      default:\n        return outs[i].length ? d : last;\n    }\n  });\n  g.columns.forEach((col, i) => {\n    if (col !== undefined) columns[i] = col;\n  });\n  return columns;\n};\n\ninterface LaidNode {\n  i: number;\n  col: number;\n  value: number;\n  x0: number;\n  x1: number;\n  y0: number;\n  y1: number;\n  /** Links leaving / entering the node (indexes in `edges`) */\n  outs: number[];\n  ins: number[];\n}\n\ninterface LaidEdge {\n  k: number;\n  source: LaidNode;\n  target: LaidNode;\n  value: number;\n  width: number;\n  y0: number;\n  y1: number;\n}\n\n/** Vertical positions (d3-sankey's initialization, relaxation and collision passes) */\nconst relax = (\n  columns: LaidNode[][],\n  edges: LaidEdge[],\n  top: number,\n  bottom: number,\n  py: number,\n  iterations: number,\n) => {\n  const outsOf = (n: LaidNode) => n.outs.map((k) => edges[k]);\n  const insOf = (n: LaidNode) => n.ins.map((k) => edges[k]);\n\n  const reorder = (n: LaidNode) => {\n    n.outs.sort((a, b) => edges[a].target.y0 - edges[b].target.y0);\n    n.ins.sort((a, b) => edges[a].source.y0 - edges[b].source.y0);\n  };\n  /** Top of `target` for which the link from `source` would be horizontal */\n  const targetTop = (source: LaidNode, target: LaidNode) => {\n    let y = source.y0 - ((source.outs.length - 1) * py) / 2;\n    for (const e of outsOf(source)) {\n      if (e.target === target) break;\n      y += e.width + py;\n    }\n    for (const e of insOf(target)) {\n      if (e.source === source) break;\n      y -= e.width;\n    }\n    return y;\n  };\n  const sourceTop = (source: LaidNode, target: LaidNode) => {\n    let y = target.y0 - ((target.ins.length - 1) * py) / 2;\n    for (const e of insOf(target)) {\n      if (e.source === source) break;\n      y += e.width + py;\n    }\n    for (const e of outsOf(source)) {\n      if (e.target === target) break;\n      y -= e.width;\n    }\n    return y;\n  };\n  const down = (nodes: LaidNode[], y: number, from: number, alpha: number) => {\n    for (let i = from; i < nodes.length; i++) {\n      const n = nodes[i];\n      const dy = (y - n.y0) * alpha;\n      if (dy > 1e-6) {\n        n.y0 += dy;\n        n.y1 += dy;\n      }\n      y = n.y1 + py;\n    }\n  };\n  const up = (nodes: LaidNode[], y: number, from: number, alpha: number) => {\n    for (let i = from; i >= 0; i--) {\n      const n = nodes[i];\n      const dy = (n.y1 - y) * alpha;\n      if (dy > 1e-6) {\n        n.y0 -= dy;\n        n.y1 -= dy;\n      }\n      y = n.y0 - py;\n    }\n  };\n  const collide = (nodes: LaidNode[], alpha: number) => {\n    const mid = nodes.length >> 1;\n    const subject = nodes[mid];\n    if (!subject) return;\n    up(nodes, subject.y0 - py, mid - 1, alpha);\n    down(nodes, subject.y1 + py, mid + 1, alpha);\n    up(nodes, bottom, nodes.length - 1, alpha);\n    down(nodes, top, 0, alpha);\n  };\n  const byY = (a: LaidNode, b: LaidNode) => a.y0 - b.y0;\n\n  // initial positions: stacked in the data order, the free space spread out\n  for (const nodes of columns) {\n    let y = top;\n    for (const n of nodes) {\n      const h = n.y1 - n.y0;\n      n.y0 = y;\n      n.y1 = y + h;\n      y = n.y1 + py;\n    }\n    const extra = (bottom - y + py) / (nodes.length + 1);\n    nodes.forEach((n, i) => {\n      n.y0 += extra * (i + 1);\n      n.y1 += extra * (i + 1);\n    });\n  }\n  for (const nodes of columns) nodes.forEach(reorder);\n\n  for (let it = 0; it < iterations; it++) {\n    const alpha = Math.pow(0.99, it);\n    const beta = Math.max(1 - alpha, (it + 1) / iterations);\n    // right to left: nodes move toward their targets\n    for (let c = columns.length - 2; c >= 0; c--) {\n      const nodes = columns[c];\n      for (const n of nodes) {\n        let y = 0;\n        let w = 0;\n        for (const e of outsOf(n)) {\n          const v = e.value * (e.target.col - n.col);\n          y += sourceTop(n, e.target) * v;\n          w += v;\n        }\n        if (!(w > 0)) continue;\n        const dy = (y / w - n.y0) * alpha;\n        n.y0 += dy;\n        n.y1 += dy;\n        reorder(n);\n      }\n      nodes.sort(byY);\n      collide(nodes, beta);\n    }\n    // left to right: nodes move toward their sources\n    for (let c = 1; c < columns.length; c++) {\n      const nodes = columns[c];\n      for (const n of nodes) {\n        let y = 0;\n        let w = 0;\n        for (const e of insOf(n)) {\n          const v = e.value * (n.col - e.source.col);\n          y += targetTop(e.source, n) * v;\n          w += v;\n        }\n        if (!(w > 0)) continue;\n        const dy = (y / w - n.y0) * alpha;\n        n.y0 += dy;\n        n.y1 += dy;\n        reorder(n);\n      }\n      nodes.sort(byY);\n      collide(nodes, beta);\n    }\n  }\n  for (const nodes of columns) nodes.forEach(reorder);\n};\n\nconst LABEL_GAP = 6;\nconst LABEL_LINE = 16;\n\nexport const layoutSankey = (\n  o: SankeyChartOptions,\n  c: LayoutContext,\n): LayoutResult => {\n  const { theme, area, measure, hidden } = c;\n  const g = resolveSankey(o);\n  const keys = edgeKeys(g);\n  const n = g.names.length;\n  const targets = g.edges.map((e) =>\n    hidden.has(e.source) || hidden.has(e.target) ? 0 : e.value,\n  );\n  const shown = targets.map((t, k) => Math.max(0, c.value(keys[k], t)));\n  if (sum(shown) <= 1e-9) return emptyLayout(c);\n\n  const columnOf = sankeyColumns(g, o.align);\n  const inT = new Array<number>(n).fill(0);\n  const outT = new Array<number>(n).fill(0);\n  const inV = new Array<number>(n).fill(0);\n  const outV = new Array<number>(n).fill(0);\n  g.edges.forEach((e, k) => {\n    outT[e.source] += targets[k];\n    inT[e.target] += targets[k];\n    outV[e.source] += shown[k];\n    inV[e.target] += shown[k];\n  });\n\n  // nodes with a flow, by column (empty columns removed)\n  const laid: (LaidNode | null)[] = g.names.map((_, i) => {\n    const value = Math.max(inV[i], outV[i]);\n    return value > 1e-9\n      ? {\n          i,\n          col: columnOf[i],\n          value,\n          x0: 0,\n          x1: 0,\n          y0: 0,\n          y1: 0,\n          outs: [],\n          ins: [],\n        }\n      : null;\n  });\n  const used = [\n    ...new Set(laid.filter((l) => l).map((l) => (l as LaidNode).col)),\n  ].sort((a, b) => a - b);\n  const rank = new Map(used.map((col, k) => [col, k]));\n  const columns: LaidNode[][] = used.map(() => []);\n  for (const l of laid)\n    if (l) {\n      l.col = rank.get(l.col) ?? 0;\n      columns[l.col].push(l);\n    }\n  const edges: LaidEdge[] = [];\n  g.edges.forEach((e, k) => {\n    const source = laid[e.source];\n    const target = laid[e.target];\n    if (!source || !target || shown[k] <= 1e-9) return;\n    source.outs.push(edges.length);\n    target.ins.push(edges.length);\n    edges.push({\n      k,\n      source,\n      target,\n      value: shown[k],\n      width: 0,\n      y0: 0,\n      y1: 0,\n    });\n  });\n\n  // geometry\n  const nodeWidth = clamp(finite(o.nodeWidth, 12), 1, 64);\n  const ncols = columns.length;\n  const top = area.y + 2;\n  const bottom = area.y + area.height - 2;\n  const height = Math.max(1, bottom - top);\n  const maxCount = Math.max(1, ...columns.map((col) => col.length));\n  const py = Math.min(\n    Math.max(0, finite(o.nodePadding, 12)),\n    maxCount > 1 ? (height * 0.5) / (maxCount - 1) : Infinity,\n  );\n  const ky = Math.min(\n    ...columns.map(\n      (col) =>\n        (height - (col.length - 1) * py) /\n        Math.max(1e-9, sum(col.map((l) => l.value))),\n    ),\n  );\n  const step = ncols > 1 ? (area.width - nodeWidth) / (ncols - 1) : 0;\n  columns.forEach((col, k) => {\n    const x0 =\n      ncols > 1 ? area.x + k * step : area.x + (area.width - nodeWidth) / 2;\n    for (const l of col) {\n      l.x0 = x0;\n      l.x1 = x0 + nodeWidth;\n      l.y0 = 0;\n      l.y1 = l.value * ky;\n    }\n  });\n  for (const e of edges) e.width = e.value * ky;\n  relax(\n    columns,\n    edges,\n    top,\n    bottom,\n    py,\n    Math.round(clamp(finite(o.iterations, 32), 0, 200)),\n  );\n  // where the links leave / reach the nodes\n  for (const col of columns)\n    for (const l of col) {\n      let y = l.y0;\n      for (const k of l.outs) {\n        edges[k].y0 = y + edges[k].width / 2;\n        y += edges[k].width;\n      }\n      y = l.y0;\n      for (const k of l.ins) {\n        edges[k].y1 = y + edges[k].width / 2;\n        y += edges[k].width;\n      }\n    }\n\n  // colors\n  const colors: Rgba[] = g.names.map((_, i) => c.color(g.colors[i], i));\n  const css = colors.map((col) => toCss(col));\n  const neutral = mix(theme.grid, theme.textMuted, 0.45);\n  const mode = o.linkColor ?? \"gradient\";\n  const opacity = clamp(finite(o.linkOpacity, 0.4), 0.02, 1);\n  const activeAlpha = Math.min(1, opacity + 0.3);\n\n  const nodes: ShapeNode[] = [];\n  const items: ShapeItem[] = [];\n  const linkIndex = (e: LaidEdge) => n + g.edges[e.k].link;\n  const linksOf = (l: LaidNode) => [\n    ...l.ins.map((k) => linkIndex(edges[k])),\n    ...l.outs.map((k) => linkIndex(edges[k])),\n  ];\n\n  // links: widest first, so the thin ones stay on top (and hoverable)\n  const drawn = edges.slice().sort((a, b) => b.width - a.width);\n  for (const e of drawn) {\n    const own = g.edges[e.k].color;\n    let c0: string;\n    let c1: string;\n    if (own) c0 = c1 = toCss(c.color(own, e.source.i));\n    else if (mode === \"source\") c0 = c1 = css[e.source.i];\n    else if (mode === \"target\") c0 = c1 = css[e.target.i];\n    else if (mode === \"neutral\") c0 = c1 = toCss(neutral);\n    else {\n      c0 = css[e.source.i];\n      c1 = css[e.target.i];\n    }\n    nodes.push({\n      kind: \"link\",\n      x0: e.source.x1,\n      y0: e.y0,\n      x1: e.target.x0,\n      y1: e.y1,\n      width: e.width,\n      color0: c0,\n      color1: c1,\n      alpha: opacity,\n      activeAlpha,\n      hit: linkIndex(e),\n      also: [e.source.i, e.target.i],\n    });\n  }\n\n  // node bars\n  for (const col of columns)\n    for (const l of col)\n      nodes.push({\n        kind: \"rect\",\n        x: l.x0,\n        y: l.y0,\n        width: l.x1 - l.x0,\n        height: Math.max(1, l.y1 - l.y0),\n        radius: Math.min(2, nodeWidth / 2),\n        fill: css[l.i],\n        hit: l.i,\n        also: linksOf(l),\n        brighten: true,\n      });\n\n  // labels: right of the nodes, left of the last column; the biggest first\n  if (o.labels !== false) {\n    const nameFont = font(theme, 12, 500);\n    const valueFont = font(theme, 12);\n    const halo = toCss(theme.background, 0.8);\n    const boxes: { x0: number; x1: number; y0: number; y1: number }[] = [];\n    const room =\n      ncols > 1 ? Math.max(0, step - nodeWidth - LABEL_GAP * 2) : area.width;\n    // the last column first (its labels have a single side), then the biggest\n    const order = columns\n      .flat()\n      .slice()\n      .sort(\n        (a, b) =>\n          Number(b.col === ncols - 1) - Number(a.col === ncols - 1) ||\n          b.value - a.value,\n      );\n    for (const l of order) {\n      const last = ncols > 1 && l.col === ncols - 1;\n      let value =\n        o.labelValues === false ? \"\" : c.format(Math.max(inT[l.i], outT[l.i]));\n      let valueW = value ? measure(value, valueFont) : 0;\n      let name = ellipsize(\n        g.names[l.i],\n        room - (value ? valueW + 6 : 0),\n        nameFont,\n        measure,\n      );\n      if (!name && value) {\n        value = \"\";\n        valueW = 0;\n        name = ellipsize(g.names[l.i], room, nameFont, measure);\n      }\n      if (!name) continue;\n      const nameW = measure(name, nameFont);\n      const width = nameW + (value ? 6 + valueW : 0);\n      // candidates: the preferred side (inward for the last column), then\n      // the other one when it stays in the drawing; each nudged along the bar\n      const sides = last ? [true, false] : [false, true];\n      const reach = Math.max(0, (l.y1 - l.y0) / 2 - LABEL_LINE / 2 + 2);\n      const offsets = [0];\n      for (let d = 6; d <= reach; d += 6) offsets.push(d, -d);\n      let box: { x0: number; x1: number; y0: number; y1: number } | null = null;\n      for (const left of sides) {\n        const x = left ? l.x0 - LABEL_GAP : l.x1 + LABEL_GAP;\n        const x0 = left ? x - width : x;\n        if (x0 < area.x - 2 || x0 + width > area.x + area.width + 2) continue;\n        for (const dy of offsets) {\n          const y = (l.y0 + l.y1) / 2 + dy;\n          const candidate = {\n            x0,\n            x1: x0 + width,\n            y0: y - LABEL_LINE / 2,\n            y1: y + LABEL_LINE / 2,\n          };\n          if (\n            candidate.y0 < area.y - 4 ||\n            candidate.y1 > area.y + area.height + 4 ||\n            boxes.some(\n              (b) =>\n                b.x0 < candidate.x1 &&\n                candidate.x0 < b.x1 &&\n                b.y0 < candidate.y1 &&\n                candidate.y0 < b.y1,\n            )\n          )\n            continue;\n          box = candidate;\n          break;\n        }\n        if (box) break;\n      }\n      if (!box) continue;\n      boxes.push(box);\n      const y = (box.y0 + box.y1) / 2;\n      const also = linksOf(l);\n      nodes.push({\n        kind: \"text\",\n        x: box.x0,\n        y,\n        text: name,\n        font: nameFont,\n        color: toCss(theme.text),\n        align: \"left\",\n        baseline: \"middle\",\n        halo,\n        hit: l.i,\n        also,\n      });\n      if (value)\n        nodes.push({\n          kind: \"text\",\n          x: box.x1,\n          y,\n          text: value,\n          font: valueFont,\n          color: toCss(theme.textMuted),\n          align: \"right\",\n          baseline: \"middle\",\n          halo,\n          hit: l.i,\n          also,\n        });\n    }\n  }\n\n  // items: nodes by column and position, then links\n  const entering = sum(g.names.map((_, i) => (inT[i] <= 0 ? outT[i] : 0)));\n  for (const col of columns)\n    for (const l of col.slice().sort((a, b) => a.y0 - b.y0)) {\n      const value = Math.max(inT[l.i], outT[l.i]);\n      if (value <= 0) continue;\n      const percent = entering > 0 ? value / entering : 0;\n      items.push({\n        index: l.i,\n        name: g.names[l.i],\n        value,\n        percent,\n        share: c.percent(percent),\n        color: css[l.i],\n        x: (l.x0 + l.x1) / 2,\n        y: (l.y0 + l.y1) / 2,\n        rows: [\n          { name: c.labels.value, value: c.format(value) },\n          ...(inT[l.i] > 0\n            ? [{ name: c.labels.incoming, value: c.format(inT[l.i]) }]\n            : []),\n          ...(outT[l.i] > 0\n            ? [{ name: c.labels.outgoing, value: c.format(outT[l.i]) }]\n            : []),\n        ],\n      });\n    }\n  const linkItems = edges\n    .slice()\n    .sort(\n      (a, b) =>\n        a.source.col - b.source.col || a.y0 - b.y0 || a.target.y0 - b.target.y0,\n    );\n  for (const e of linkItems) {\n    const ge = g.edges[e.k];\n    const value = targets[e.k];\n    if (value <= 0) continue;\n    const source = g.names[ge.source];\n    const target = g.names[ge.target];\n    const ofSource = outT[ge.source] > 0 ? value / outT[ge.source] : 0;\n    const ofTarget = inT[ge.target] > 0 ? value / inT[ge.target] : 0;\n    items.push({\n      index: linkIndex(e),\n      name: `${source} \\u2192 ${target}`,\n      value,\n      percent: ofSource,\n      share: c.percent(ofSource),\n      color: css[ge.source],\n      x: (e.source.x1 + e.target.x0) / 2,\n      y: (e.y0 + e.y1) / 2,\n      rows: [\n        { name: c.labels.value, value: c.format(value) },\n        {\n          name: interpolate(c.labels.ofName, { name: source }),\n          value: c.percent(ofSource),\n        },\n        {\n          name: interpolate(c.labels.ofName, { name: target }),\n          value: c.percent(ofTarget),\n        },\n      ],\n      event: { source, target },\n    });\n  }\n\n  const enter = clamp(c.enter, 0, 1);\n  return {\n    nodes,\n    items,\n    dim: 0.3,\n    empty: false,\n    ...(enter < 1\n      ? {\n          enter: {\n            alpha: enter,\n            scale: 0.97 + 0.03 * enter,\n            cx: area.x + area.width / 2,\n            cy: area.y + area.height / 2,\n          },\n        }\n      : {}),\n  };\n};\n"],"mappings":"+GA8CA,IAAae,EAAiB,GAAuC,CACnE,IAAMC,EAAkB,CAAC,EACnBC,EAAiC,CAAC,EAClCC,EAAkC,CAAC,EACnCC,EAAS,IAAI,IACnB,IAAK,IAAMC,KAAQC,EAAE,OAAS,CAAC,EAC7BF,EAAO,IAAIC,EAAK,KAAMD,EAAO,IAAIC,EAAK,IAAI,GAAKJ,EAAM,MAAM,EAC3DA,EAAM,KAAKI,EAAK,IAAI,EACpBH,EAAO,KAAKG,EAAK,KAAK,EACtBF,EAAQ,KACN,OAAOE,EAAK,QAAW,UAAY,OAAO,SAASA,EAAK,MAAM,EAC1D,KAAK,IAAI,EAAG,KAAK,MAAMA,EAAK,MAAM,CAAC,EACnC,IAAA,EACN,EAEF,IAAME,EAAWN,EAAM,OACjBO,EAAW,GAAiC,CAChD,GAAI,OAAOC,GAAQ,SACjB,OAAO,OAAO,UAAUA,CAAG,GAAKA,GAAO,GAAKA,EAAMF,EAAWE,EAAM,GACrE,GAAI,OAAOA,GAAQ,SAAU,MAAO,GACpC,IAAMC,EAAQN,EAAO,IAAIK,CAAG,EAM5B,OALIC,IAAU,IAAA,IACdN,EAAO,IAAIK,EAAKR,EAAM,MAAM,EAC5BA,EAAM,KAAKQ,CAAG,EACdP,EAAO,KAAK,IAAA,EAAS,EACrBC,EAAQ,KAAK,IAAA,EAAS,EACfF,EAAM,OAAS,GALUS,CAMlC,EACMC,EAAkB,CAAC,EACnBC,GAAW,EAAc,IAAe,CAC5C,IAAMC,EAAO,IAAI,IAAY,CAACC,CAAI,CAAC,EAC7BC,EAAQ,CAACD,CAAI,EACnB,KAAOC,EAAM,QAAQ,CACnB,IAAMC,EAAID,EAAM,IAAI,EACpB,GAAIC,IAAMC,EAAI,MAAO,GACrB,IAAK,IAAMC,KAAKP,EAAIK,IAAM,CAAC,EACpBH,EAAK,IAAIK,CAAC,IACbL,EAAK,IAAIK,CAAC,EACVH,EAAM,KAAKG,CAAC,EAElB,CACA,MAAO,EACT,EACMC,EAAsB,CAAC,EAgB7B,OAfCb,EAAE,OAAS,CAAC,EAAA,CAAG,SAAS,EAAG,IAAM,CAChC,GAAI,CAACc,EAAG,OACR,IAAMC,EAASb,EAAQY,EAAE,MAAM,EACzBE,EAASd,EAAQY,EAAE,MAAM,EAC3BC,EAAS,GAAKC,EAAS,GAAKD,IAAWC,GACvCV,EAAQU,EAAQD,CAAM,KACzBV,EAAIU,KAAJ,EAAIA,GAAY,CAAC,GAAA,CAAG,KAAKC,CAAM,EAChCH,EAAM,KAAK,CACT,KAAMI,EACN,SACA,SACA,MAAOtC,EAAAA,SAASmC,EAAE,KAAK,EACvB,GAAIA,EAAE,MAAQ,CAAE,MAAOA,EAAE,KAAM,EAAI,CAAC,CACtC,CAAC,EACH,CAAC,EACM,CAAE,QAAO,SAAQ,UAAS,OAAM,CACzC,EAEMI,EAAY,GAChBtC,EAAAA,WACEuC,EAAE,MAAM,IAAK,GAAM,GAAGA,EAAE,MAAMC,EAAE,QAAQ,QAAQD,EAAE,MAAMC,EAAE,SAAS,CACrE,EAGWC,GACX,EACA,EACA,IACG,CACH,IAAMF,EAAIzB,EAAcM,CAAC,EACzBkB,EAASC,CAAC,CAAC,CAAC,SAAS,EAAK,IAAM,CAC9B,IAAMC,EAAID,EAAE,MAAMG,GAClBjB,EAAI,IAAIkB,EAAKC,EAAO,IAAIJ,EAAE,MAAM,GAAKI,EAAO,IAAIJ,EAAE,MAAM,EAAI,EAAIA,EAAE,KAAK,CACzE,CAAC,CACH,EAGaK,GACX,EACA,EAAqC,YACxB,CACb,IAAM,EAAIN,EAAE,MAAM,OACZO,EAAmB,MAAM,KAAK,CAAE,OAAQ,CAAE,MAAS,CAAC,CAAC,EACrDC,EAAkB,MAAM,KAAK,CAAE,OAAQ,CAAE,MAAS,CAAC,CAAC,EAC1D,IAAK,IAAMP,KAAKD,EAAE,MAChBO,EAAKN,EAAE,OAAO,CAAC,KAAKA,EAAE,MAAM,EAC5BO,EAAIP,EAAE,OAAO,CAAC,KAAKA,EAAE,MAAM,EAG7B,IAAMQ,EAAkB,CAAC,EACnBC,EAAUF,EAAI,IAAK,GAAMb,EAAE,MAAM,EACjCgB,EAAkB,CAAC,EAIzB,IAHAD,EAAQ,SAAS,EAAG,IAAM,CACnBE,GAAGD,EAAM,KAAKb,CAAC,CACtB,CAAC,EACMa,EAAM,QAAQ,CACnB,IAAMb,EAAIa,EAAM,MAAM,EACtBF,EAAM,KAAKX,CAAC,EACZ,IAAK,IAAM,KAAKS,EAAKT,GAAQ,EAAEY,EAAQ,KAAO,GAAGC,EAAM,KAAK,CAAC,CAC/D,CACA,IAAME,EAAY,MAAc,CAAC,CAAC,CAAC,KAAK,CAAC,EACzC,IAAK,IAAMf,KAAKW,EACd,IAAK,IAAM,KAAKF,EAAKT,GAAI,EAAM,GAAK,KAAK,IAAIe,EAAM,GAAIA,EAAMf,GAAK,CAAC,EACrE,IAAMgB,EAAa,MAAc,CAAC,CAAC,CAAC,KAAK,CAAC,EAC1C,IAAK,IAAIX,EAAIM,EAAM,OAAS,EAAGN,GAAK,EAAG,IAAK,CAC1C,IAAML,EAAIW,EAAMN,GAChB,IAAK,IAAMY,KAAKR,EAAKT,GAAI,EAAOA,GAAK,KAAK,IAAIgB,EAAOhB,GAAIgB,EAAOC,GAAK,CAAC,CACxE,CACA,IAAMC,EAAO,KAAK,IAAI,EAAG,GAAGH,CAAK,EAC3BnC,EAAUmC,EAAM,KAAK,EAAG,IAAM,CAClC,OAAQI,EAAR,CACE,IAAK,OACH,OAAOC,EACT,IAAK,QACH,OAAOF,EAAOF,EAAOhB,GACvB,IAAK,SACH,OAAOU,EAAIV,EAAE,CAAC,OACVoB,EACAX,EAAKT,EAAE,CAAC,OACN,KAAK,IAAI,GAAGS,EAAKT,EAAE,CAAC,IAAK,GAAMe,EAAME,EAAE,CAAC,EAAI,EAC5C,EACR,QACE,OAAOR,EAAKT,EAAE,CAAC,OAASoB,EAAIF,CAChC,CACF,CAAC,EAID,OAHAhB,EAAE,QAAQ,SAAS,EAAK,IAAM,CACxBmB,IAAQ,IAAA,KAAW,EAAQrB,GAAKqB,EACtC,CAAC,EACMzC,CACT,EA0BM0C,GACJ,EACA,EACA,EACA,EACA,EACA,IACG,CACH,IAAMC,EAAU,GAAgB9B,EAAE,KAAK,IAAK,GAAMG,EAAMS,EAAE,EACpDmB,EAAS,GAAgB/B,EAAE,IAAI,IAAK,GAAMG,EAAMS,EAAE,EAElDoB,EAAW,GAAgB,CAC/BhC,EAAE,KAAK,MAAM,EAAG,IAAMG,EAAM8B,EAAE,CAAC,OAAO,GAAK9B,EAAM+B,EAAE,CAAC,OAAO,EAAE,EAC7DlC,EAAE,IAAI,MAAM,EAAG,IAAMG,EAAM8B,EAAE,CAAC,OAAO,GAAK9B,EAAM+B,EAAE,CAAC,OAAO,EAAE,CAC9D,EAEMC,GAAa,EAAkB,IAAqB,CACxD,IAAIC,EAAI/B,EAAO,IAAOA,EAAO,KAAK,OAAS,GAAKgC,EAAM,EACtD,IAAK,IAAM3B,KAAKoB,EAAOzB,CAAM,EAAG,CAC9B,GAAIK,EAAE,SAAWJ,EAAQ,MACzB,GAAKI,EAAE,MAAQ2B,CACjB,CACA,IAAK,IAAM3B,KAAKqB,EAAMzB,CAAM,EAAG,CAC7B,GAAII,EAAE,SAAWL,EAAQ,MACzB,GAAKK,EAAE,KACT,CACA,OAAO0B,CACT,EACME,GAAa,EAAkB,IAAqB,CACxD,IAAIF,EAAI9B,EAAO,IAAOA,EAAO,IAAI,OAAS,GAAK+B,EAAM,EACrD,IAAK,IAAM3B,KAAKqB,EAAMzB,CAAM,EAAG,CAC7B,GAAII,EAAE,SAAWL,EAAQ,MACzB,GAAKK,EAAE,MAAQ2B,CACjB,CACA,IAAK,IAAM3B,KAAKoB,EAAOzB,CAAM,EAAG,CAC9B,GAAIK,EAAE,SAAWJ,EAAQ,MACzB,GAAKI,EAAE,KACT,CACA,OAAO0B,CACT,EACMG,GAAQ,EAAmB,EAAW,EAAc,IAAkB,CAC1E,IAAK,IAAIhC,EAAIT,EAAMS,EAAIiC,EAAM,OAAQ,IAAK,CACxC,IAAM,EAAIA,EAAMjC,GACVkC,GAAML,EAAI,EAAE,IAAMM,EACpBD,EAAK,OACP,EAAE,IAAMA,EACR,EAAE,IAAMA,GAEV,EAAI,EAAE,GAAKJ,CACb,CACF,EACMM,GAAM,EAAmB,EAAW,EAAc,IAAkB,CACxE,IAAK,IAAIpC,EAAIT,EAAMS,GAAK,EAAG,IAAK,CAC9B,IAAM,EAAIiC,EAAMjC,GACVkC,GAAM,EAAE,GAAKL,GAAKM,EACpBD,EAAK,OACP,EAAE,IAAMA,EACR,EAAE,IAAMA,GAEV,EAAI,EAAE,GAAKJ,CACb,CACF,EACMO,GAAW,EAAmB,IAAkB,CACpD,IAAMC,EAAML,EAAM,QAAU,EACtBM,EAAUN,EAAMK,GACjBC,IACLH,EAAGH,EAAOM,EAAQ,GAAKT,EAAIQ,EAAM,EAAGH,CAAK,EACzCH,EAAKC,EAAOM,EAAQ,GAAKT,EAAIQ,EAAM,EAAGH,CAAK,EAC3CC,EAAGH,EAAOO,EAAQP,EAAM,OAAS,EAAGE,CAAK,EACzCH,EAAKC,EAAOQ,EAAK,EAAGN,CAAK,EAC3B,EACMO,GAAO,EAAa,IAAgBhB,EAAE,GAAKC,EAAE,GAGnD,IAAK,IAAMM,KAASrD,EAAS,CAC3B,IAAIiD,EAAIY,EACR,IAAK,IAAM,KAAKR,EAAO,CACrB,IAAMU,EAAI,EAAE,GAAK,EAAE,GACnB,EAAE,GAAKd,EACP,EAAE,GAAKA,EAAIc,EACX,EAAI,EAAE,GAAKb,CACb,CACA,IAAMc,GAASJ,EAASX,EAAIC,IAAOG,EAAM,OAAS,GAClDA,EAAM,SAAS,EAAG,IAAM,CACtB,EAAE,IAAMW,GAAS5C,EAAI,GACrB,EAAE,IAAM4C,GAAS5C,EAAI,EACvB,CAAC,CACH,CACA,IAAK,IAAMiC,KAASrD,EAASqD,EAAM,QAAQR,CAAO,EAElD,IAAK,IAAIoB,EAAK,EAAGA,EAAKC,EAAY,IAAM,CACtC,IAAMX,EAAiB,KAAMU,EACvBE,EAAO,KAAK,IAAI,EAAIZ,GAAQU,EAAK,GAAKC,CAAU,EAEtD,IAAK,IAAIE,EAAIpE,EAAQ,OAAS,EAAGoE,GAAK,EAAG,IAAK,CAC5C,IAAMf,EAAQrD,EAAQoE,GACtB,IAAK,IAAMvD,KAAKwC,EAAO,CACrB,IAAIJ,EAAI,EACJoB,EAAI,EACR,IAAK,IAAM9C,KAAKoB,EAAO9B,CAAC,EAAG,CACzB,IAAMyD,EAAI/C,EAAE,OAASA,EAAE,OAAO,IAAMV,EAAE,KACtC,GAAKsC,EAAUtC,EAAGU,EAAE,MAAM,EAAI+C,EAC9B,GAAKA,CACP,CACA,GAAI,EAAED,EAAI,GAAI,SACd,IAAMf,GAAML,EAAIoB,EAAIxD,EAAE,IAAM0C,EAC5B,EAAE,IAAMD,EACR,EAAE,IAAMA,EACRT,EAAQhC,CAAC,CACX,CACAwC,EAAM,KAAKS,CAAG,EACdL,EAAQJ,EAAOc,CAAI,CACrB,CAEA,IAAK,IAAIC,EAAI,EAAGA,EAAIpE,EAAQ,OAAQ,IAAK,CACvC,IAAMqD,EAAQrD,EAAQoE,GACtB,IAAK,IAAMvD,KAAKwC,EAAO,CACrB,IAAIJ,EAAI,EACJoB,EAAI,EACR,IAAK,IAAM9C,KAAKqB,EAAM/B,CAAC,EAAG,CACxB,IAAMyD,EAAI/C,EAAE,OAASV,EAAE,IAAMU,EAAE,OAAO,KACtC,GAAKyB,EAAUzB,EAAE,OAAQV,CAAC,EAAIyD,EAC9B,GAAKA,CACP,CACA,GAAI,EAAED,EAAI,GAAI,SACd,IAAMf,GAAML,EAAIoB,EAAIxD,EAAE,IAAM0C,EAC5B,EAAE,IAAMD,EACR,EAAE,IAAMA,EACRT,EAAQhC,CAAC,CACX,CACAwC,EAAM,KAAKS,CAAG,EACdL,EAAQJ,EAAOc,CAAI,CACrB,CACF,CACA,IAAK,IAAMd,KAASrD,EAASqD,EAAM,QAAQR,CAAO,CACpD,EAEM0B,EAAY,EACZC,EAAa,GAENC,GACX,EACA,IACiB,CACjB,GAAM,CAAE,QAAO,OAAM,UAAS,UAAWL,EACnC,EAAIvE,EAAc,CAAC,EACnB6E,EAAOrD,EAAS,CAAC,EACjBR,EAAI,EAAE,MAAM,OACZ8D,EAAU,EAAE,MAAM,IAAK,GAC3BhD,EAAO,IAAI,EAAE,MAAM,GAAKA,EAAO,IAAI,EAAE,MAAM,EAAI,EAAI,EAAE,KACvD,EACMiD,EAAQD,EAAQ,KAAK,EAAG,IAAM,KAAK,IAAI,EAAGP,EAAE,MAAMM,EAAKjD,GAAIY,CAAC,CAAC,CAAC,EACpE,GAAIrD,EAAAA,IAAI4F,CAAK,GAAK,KAAM,OAAO3F,EAAAA,YAAYmF,CAAC,EAE5C,IAAMS,EAAWjD,EAAc,EAAG,EAAE,KAAK,EACnCkD,EAAU,MAAcjE,CAAC,CAAC,CAAC,KAAK,CAAC,EACjCkE,EAAW,MAAclE,CAAC,CAAC,CAAC,KAAK,CAAC,EAClCmE,EAAU,MAAcnE,CAAC,CAAC,CAAC,KAAK,CAAC,EACjCoE,EAAW,MAAcpE,CAAC,CAAC,CAAC,KAAK,CAAC,EACxC,EAAE,MAAM,SAAS,EAAG,IAAM,CACxB,EAAK,EAAE,SAAW8D,EAAQlD,GAC1B,EAAI,EAAE,SAAWkD,EAAQlD,GACzB,EAAK,EAAE,SAAWmD,EAAMnD,GACxB,EAAI,EAAE,SAAWmD,EAAMnD,EACzB,CAAC,EAGD,IAAMyD,EAA4B,EAAE,MAAM,KAAK,EAAG,IAAM,CACtD,IAAMC,EAAQ,KAAK,IAAIH,EAAI5D,GAAI6D,EAAK7D,EAAE,EACtC,OAAO+D,EAAQ,KACX,CACE,IACA,IAAKN,EAASzD,GACd,QACA,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,GAAI,EACJ,KAAM,CAAC,EACP,IAAK,CAAC,CACR,EACA,IACN,CAAC,EACKgE,EAAO,CACX,GAAG,IAAI,IAAIF,EAAK,OAAQ,GAAMjE,CAAC,CAAC,CAAC,IAAK,GAAOA,EAAe,GAAG,CAAC,CAClE,CAAC,CAAC,MAAM,EAAG,IAAM6B,EAAIC,CAAC,EAChBsC,EAAO,IAAI,IAAID,EAAK,KAAK,EAAK,IAAM,CAAC3C,EAAKhB,CAAC,CAAC,CAAC,EAC7CzB,EAAwBoF,EAAK,QAAU,CAAC,CAAC,EAC/C,IAAK,IAAMnE,KAAKiE,EACVjE,IACF,EAAE,IAAMoE,EAAK,IAAIpE,EAAE,GAAG,GAAK,EAC3BjB,EAAQiB,EAAE,IAAI,CAAC,KAAKA,CAAC,GAEzB,IAAMD,EAAoB,CAAC,EAC3B,EAAE,MAAM,SAAS,EAAG,IAAM,CACxB,IAAME,EAASgE,EAAK,EAAE,QAChB/D,EAAS+D,EAAK,EAAE,QAClB,CAAChE,GAAU,CAACC,GAAUyD,EAAMnD,IAAM,OACtCP,EAAO,KAAK,KAAKF,EAAM,MAAM,EAC7BG,EAAO,IAAI,KAAKH,EAAM,MAAM,EAC5BA,EAAM,KAAK,CACT,IACA,SACA,SACA,MAAO4D,EAAMnD,GACb,MAAO,EACP,GAAI,EACJ,GAAI,CACN,CAAC,EACH,CAAC,EAGD,IAAM6D,EAAYpG,EAAAA,MAAMC,EAAAA,OAAO,EAAE,UAAW,EAAE,EAAG,EAAG,EAAE,EAChDoG,EAAQvF,EAAQ,OAChB6D,EAAM2B,EAAK,EAAI,EACf5B,EAAS4B,EAAK,EAAIA,EAAK,OAAS,EAChCpD,EAAS,KAAK,IAAI,EAAGwB,EAASC,CAAG,EACjC4B,EAAW,KAAK,IAAI,EAAG,GAAGzF,EAAQ,IAAK,GAAQyC,EAAI,MAAM,CAAC,EAC1DS,EAAK,KAAK,IACd,KAAK,IAAI,EAAG/D,EAAAA,OAAO,EAAE,YAAa,EAAE,CAAC,EACrCsG,EAAW,EAAKrD,EAAS,IAAQqD,EAAW,GAAK,GACnD,EACMC,EAAK,KAAK,IACd,GAAG1F,EAAQ,IACR,IACEoC,GAAUK,EAAI,OAAS,GAAKS,GAC7B,KAAK,IAAI,KAAMlE,EAAAA,IAAIyD,EAAI,IAAK,GAAMxB,EAAE,KAAK,CAAC,CAAC,CAC/C,CACF,EACM0E,EAAOJ,EAAQ,GAAKC,EAAK,MAAQF,IAAcC,EAAQ,GAAK,EAClEvF,EAAQ,SAAS,EAAK,IAAM,CAC1B,IAAM4F,EACJL,EAAQ,EAAIC,EAAK,EAAI/D,EAAIkE,EAAOH,EAAK,GAAKA,EAAK,MAAQF,GAAa,EACtE,IAAK,IAAMrE,KAAKwB,EACd,EAAE,GAAKmD,EACP,EAAE,GAAKA,EAAKN,EACZ,EAAE,GAAK,EACP,EAAE,GAAKrE,EAAE,MAAQyE,CAErB,CAAC,EACD,IAAK,IAAM,KAAK1E,EAAO,EAAE,MAAQ,EAAE,MAAQ0E,EAC3ChD,EACE1C,EACAgB,EACA6C,EACAD,EACAV,EACA,KAAK,MAAMhE,EAAAA,MAAMC,EAAAA,OAAO,EAAE,WAAY,EAAE,EAAG,EAAG,GAAG,CAAC,CACpD,EAEA,IAAK,IAAMsD,KAAOzC,EAChB,IAAK,IAAMiB,KAAKwB,EAAK,CACnB,IAAIQ,EAAIhC,EAAE,GACV,IAAK,IAAMQ,KAAKR,EAAE,KAChB,EAAMQ,EAAE,CAAC,GAAKwB,EAAIjC,EAAMS,EAAE,CAAC,MAAQ,EACnC,GAAKT,EAAMS,EAAE,CAAC,MAEhB,EAAIR,EAAE,GACN,IAAK,IAAMQ,KAAKR,EAAE,IAChB,EAAMQ,EAAE,CAAC,GAAKwB,EAAIjC,EAAMS,EAAE,CAAC,MAAQ,EACnC,GAAKT,EAAMS,EAAE,CAAC,KAElB,CAIF,IAAMoE,EADiB,EAAE,MAAM,KAAK,EAAG,IAAMzB,EAAE,MAAM,EAAE,OAAOhD,GAAIA,CAAC,CACvD,CAAA,CAAO,IAAK,GAAQhC,EAAAA,MAAMqD,CAAG,CAAC,EACpCqD,EAAUzG,EAAAA,IAAI0G,EAAM,KAAMA,EAAM,UAAW,GAAI,EAC/CC,EAAO,EAAE,WAAa,WACtBC,EAAU/G,EAAAA,MAAMC,EAAAA,OAAO,EAAE,YAAa,EAAG,EAAG,IAAM,CAAC,EACnD+G,EAAc,KAAK,IAAI,EAAGD,EAAU,EAAG,EAEvC5C,EAAqB,CAAC,EACtB8C,EAAqB,CAAC,EACtBC,EAAa,GAAgBvF,EAAI,EAAE,MAAM,EAAE,EAAE,CAAC,KAC9CwF,EAAW,GAAgB,CAC/B,GAAGpF,EAAE,IAAI,IAAK,GAAMmF,EAAUpF,EAAMS,EAAE,CAAC,EACvC,GAAGR,EAAE,KAAK,IAAK,GAAMmF,EAAUpF,EAAMS,EAAE,CAAC,CAC1C,EAGM6E,EAAQtF,EAAM,MAAM,CAAC,CAAC,MAAM,EAAG,IAAM+B,EAAE,MAAQD,EAAE,KAAK,EAC5D,IAAK,IAAMvB,KAAK+E,EAAO,CACrB,IAAMC,EAAM,EAAE,MAAMhF,EAAE,EAAE,CAAC,MACrBiF,EACAC,EACAF,EAAK,EAAK,EAAKnH,EAAAA,MAAMgF,EAAE,MAAMmC,EAAKhF,EAAE,OAAO,CAAC,CAAC,EACxCyE,IAAS,SAAU,EAAK,EAAKH,EAAItE,EAAE,OAAO,GAC1CyE,IAAS,SAAU,EAAK,EAAKH,EAAItE,EAAE,OAAO,GAC1CyE,IAAS,UAAW,EAAK,EAAK5G,EAAAA,MAAM0G,CAAO,GAElD,EAAKD,EAAItE,EAAE,OAAO,GAClB,EAAKsE,EAAItE,EAAE,OAAO,IAEpB8B,EAAM,KAAK,CACT,KAAM,OACN,GAAI9B,EAAE,OAAO,GACb,GAAIA,EAAE,GACN,GAAIA,EAAE,OAAO,GACb,GAAIA,EAAE,GACN,MAAOA,EAAE,MACT,OAAQiF,EACR,OAAQC,EACR,MAAOR,EACP,cACA,IAAKG,EAAU7E,CAAC,EAChB,KAAM,CAACA,EAAE,OAAO,EAAGA,EAAE,OAAO,CAAC,CAC/B,CAAC,CACH,CAGA,IAAK,IAAMkB,KAAOzC,EAChB,IAAK,IAAMiB,KAAKwB,EACdY,EAAM,KAAK,CACT,KAAM,OACN,EAAGpC,EAAE,GACL,EAAGA,EAAE,GACL,MAAOA,EAAE,GAAKA,EAAE,GAChB,OAAQ,KAAK,IAAI,EAAGA,EAAE,GAAKA,EAAE,EAAE,EAC/B,OAAQ,KAAK,IAAI,EAAGqE,EAAY,CAAC,EACjC,KAAMO,EAAI5E,EAAE,GACZ,IAAKA,EAAE,EACP,KAAMoF,EAAQpF,CAAC,EACf,SAAU,EACZ,CAAC,EAGL,GAAI,EAAE,SAAW,GAAO,CACtB,IAAMyF,EAAWpH,EAAAA,KAAKyG,EAAO,GAAI,GAAG,EAC9BY,EAAYrH,EAAAA,KAAKyG,EAAO,EAAE,EAC1Ba,EAAOxH,EAAAA,MAAM2G,EAAM,WAAY,EAAG,EAClCc,EAA8D,CAAC,EAC/DC,EACJvB,EAAQ,EAAI,KAAK,IAAI,EAAGI,EAAOL,EAAY,EAAa,EAAIE,EAAK,MAE7DzD,EAAQ/B,EACX,KAAK,CAAC,CACN,MAAM,CAAC,CACP,MACE,EAAG,IACF,OAAO+C,EAAE,MAAQwC,EAAQ,CAAC,EAAI,OAAOzC,EAAE,MAAQyC,EAAQ,CAAC,GACxDxC,EAAE,MAAQD,EAAE,KAChB,EACF,IAAK,IAAM7B,KAAKc,EAAO,CACrB,IAAMO,EAAOiD,EAAQ,GAAKtE,EAAE,MAAQsE,EAAQ,EACxCJ,EACF,EAAE,cAAgB,GAAQ,GAAKf,EAAE,OAAO,KAAK,IAAIU,EAAI7D,EAAE,GAAI8D,EAAK9D,EAAE,EAAE,CAAC,EACnE8F,EAAS5B,EAAQ6B,EAAQ7B,EAAOwB,CAAS,EAAI,EAC7CM,EAAO1H,EAAAA,UACT,EAAE,MAAM0B,EAAE,GACV6F,GAAQ3B,EAAQ4B,EAAS,EAAI,GAC7BL,EACAM,CACF,EAMA,GALI,CAACC,GAAQ9B,IACX,EAAQ,GACR,EAAS,EACT,EAAO5F,EAAAA,UAAU,EAAE,MAAM0B,EAAE,GAAI6F,EAAMJ,EAAUM,CAAO,GAEpD,CAACC,EAAM,SAEX,IAAMC,EADQF,EAAQC,EAAMP,CACd,GAASvB,EAAQ,EAAI4B,EAAS,GAGtCI,EAAQ7E,EAAO,CAAC,GAAM,EAAK,EAAI,CAAC,GAAO,EAAI,EAC3C8E,EAAQ,KAAK,IAAI,GAAInG,EAAE,GAAKA,EAAE,IAAM,EAAIuD,EAAa,EAAI,CAAC,EAC1D6C,EAAU,CAAC,CAAC,EAClB,IAAK,IAAI7E,EAAI,EAAGA,GAAK4E,EAAO,GAAK,EAAGC,EAAQ,KAAK7E,EAAG,CAACA,CAAC,EACtD,IAAI8E,EAAiE,KACrE,IAAK,IAAMC,KAAQJ,EAAO,CACxB,IAAMK,EAAID,EAAOtG,EAAE,GAAKsD,EAAYtD,EAAE,GAAKsD,EACrCqB,EAAK2B,EAAOC,EAAIN,EAAQM,EAC9B,GAAI,IAAKhC,EAAK,EAAI,GAAKI,EAAKsB,EAAQ1B,EAAK,EAAIA,EAAK,MAAQ,GAC1D,KAAK,IAAMlC,KAAM+D,EAAS,CACxB,IAAMpE,GAAKhC,EAAE,GAAKA,EAAE,IAAM,EAAIqC,EACxBmE,EAAY,CAChB,KACA,GAAI7B,EAAKsB,EACT,GAAIjE,EAAIuB,EAAa,EACrB,GAAIvB,EAAIuB,EAAa,CACvB,EACA,GACE,IAAU,GAAKgB,EAAK,EAAI,GACxBiC,EAAU,GAAKjC,EAAK,EAAIA,EAAK,OAAS,GACtCqB,EAAM,KACH,GACC9D,EAAE,GAAK0E,EAAU,IACjBA,EAAU,GAAK1E,EAAE,IACjBA,EAAE,GAAK0E,EAAU,IACjBA,EAAU,GAAK1E,EAAE,EACrB,GAGF,GAAM0E,EACN,KADM,CAER,CACA,GAAIH,EAAK,KADT,CAEF,CACA,GAAI,CAACA,EAAK,SACVT,EAAM,KAAKS,CAAG,EACd,IAAMrE,GAAKqE,EAAI,GAAKA,EAAI,IAAM,EACxBI,EAAOrB,EAAQpF,CAAC,EACtBoC,EAAM,KAAK,CACT,KAAM,OACN,EAAGiE,EAAI,GACP,IACA,KAAML,EACN,KAAMP,EACN,MAAOtH,EAAAA,MAAM2G,EAAM,IAAI,EACvB,MAAO,OACP,SAAU,SACV,OACA,IAAK9E,EAAE,EACP,MACF,CAAC,EACGkE,GACF9B,EAAM,KAAK,CACT,KAAM,OACN,EAAGiE,EAAI,GACP,IACA,KAAMnC,EACN,KAAMwB,EACN,MAAOvH,EAAAA,MAAM2G,EAAM,SAAS,EAC5B,MAAO,QACP,SAAU,SACV,OACA,IAAK9E,EAAE,EACP,MACF,CAAC,CACL,CACF,CAGA,IAAM0G,EAAW3I,EAAAA,IAAI,EAAE,MAAM,KAAK,EAAG,IAAO8F,EAAI1D,IAAM,EAAI2D,EAAK3D,GAAK,CAAE,CAAC,EACvE,IAAK,IAAMqB,KAAOzC,EAChB,IAAK,IAAMiB,KAAKwB,EAAI,MAAM,CAAC,CAAC,MAAM,EAAG,IAAMK,EAAE,GAAKC,EAAE,EAAE,EAAG,CACvD,IAAMoC,EAAQ,KAAK,IAAIL,EAAI7D,EAAE,GAAI8D,EAAK9D,EAAE,EAAE,EAC1C,GAAIkE,GAAS,EAAG,SAChB,IAAMyC,EAAUD,EAAW,EAAIxC,EAAQwC,EAAW,EAClDxB,EAAM,KAAK,CACT,MAAOlF,EAAE,EACT,KAAM,EAAE,MAAMA,EAAE,GAChB,QACA,UACA,MAAOmD,EAAE,QAAQwD,CAAO,EACxB,MAAO/B,EAAI5E,EAAE,GACb,GAAIA,EAAE,GAAKA,EAAE,IAAM,EACnB,GAAIA,EAAE,GAAKA,EAAE,IAAM,EACnB,KAAM,CACJ,CAAE,KAAMmD,EAAE,OAAO,MAAO,MAAOA,EAAE,OAAOe,CAAK,CAAE,EAC/C,GAAIL,EAAI7D,EAAE,GAAK,EACX,CAAC,CAAE,KAAMmD,EAAE,OAAO,SAAU,MAAOA,EAAE,OAAOU,EAAI7D,EAAE,EAAE,CAAE,CAAC,EACvD,CAAC,EACL,GAAI8D,EAAK9D,EAAE,GAAK,EACZ,CAAC,CAAE,KAAMmD,EAAE,OAAO,SAAU,MAAOA,EAAE,OAAOW,EAAK9D,EAAE,EAAE,CAAE,CAAC,EACxD,CAAC,CACP,CACF,CAAC,CACH,CACF,IAAM4G,EAAY7G,EACf,MAAM,CAAC,CACP,MACE,EAAG,IACF8B,EAAE,OAAO,IAAMC,EAAE,OAAO,KAAOD,EAAE,GAAKC,EAAE,IAAMD,EAAE,OAAO,GAAKC,EAAE,OAAO,EACzE,EACF,IAAK,IAAM,KAAK8E,EAAW,CACzB,IAAMC,EAAK,EAAE,MAAM,EAAE,GACf3C,EAAQR,EAAQ,EAAE,GACxB,GAAIQ,GAAS,EAAG,SAChB,IAAMjE,EAAS,EAAE,MAAM4G,EAAG,QACpB3G,EAAS,EAAE,MAAM2G,EAAG,QACpBC,EAAWhD,EAAK+C,EAAG,QAAU,EAAI3C,EAAQJ,EAAK+C,EAAG,QAAU,EAC3DE,EAAWlD,EAAIgD,EAAG,QAAU,EAAI3C,EAAQL,EAAIgD,EAAG,QAAU,EAC/D3B,EAAM,KAAK,CACT,MAAOC,EAAU,CAAC,EAClB,KAAM,GAAGlF,EAAO,UAAUC,IAC1B,QACA,QAAS4G,EACT,MAAO3D,EAAE,QAAQ2D,CAAQ,EACzB,MAAOlC,EAAIiC,EAAG,QACd,GAAI,EAAE,OAAO,GAAK,EAAE,OAAO,IAAM,EACjC,GAAI,EAAE,GAAK,EAAE,IAAM,EACnB,KAAM,CACJ,CAAE,KAAM1D,EAAE,OAAO,MAAO,MAAOA,EAAE,OAAOe,CAAK,CAAE,EAC/C,CACE,KAAM3F,EAAAA,YAAY4E,EAAE,OAAO,OAAQ,CAAE,KAAMlD,CAAO,CAAC,EACnD,MAAOkD,EAAE,QAAQ2D,CAAQ,CAC3B,EACA,CACE,KAAMvI,EAAAA,YAAY4E,EAAE,OAAO,OAAQ,CAAE,KAAMjD,CAAO,CAAC,EACnD,MAAOiD,EAAE,QAAQ4D,CAAQ,CAC3B,CACF,EACA,MAAO,CAAE,SAAQ,QAAO,CAC1B,CAAC,CACH,CAEA,IAAMC,EAAQ/I,EAAAA,MAAMkF,EAAE,MAAO,EAAG,CAAC,EACjC,MAAO,CACL,QACA,QACA,IAAK,GACL,MAAO,GACP,GAAI6D,EAAQ,EACR,CACE,MAAO,CACL,MAAOA,EACP,MAAO,IAAO,IAAOA,EACrB,GAAIzC,EAAK,EAAIA,EAAK,MAAQ,EAC1B,GAAIA,EAAK,EAAIA,EAAK,OAAS,CAC7B,CACF,EACA,CAAC,CACP,CACF"}

package/dist/native/charts/src/engine/shapes/sankey.js

@@ -0,0 +1,372 @@
+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, sum as c, uniqueKeys as l } from "./scene.js";
+import { interpolate as u } from "./labels.js";
+//#region ../charts/src/engine/shapes/sankey.ts
+var d = (e) => {
+	let t = [], n = [], r = [], i = /* @__PURE__ */ new Map();
+	for (let a of e.nodes ?? []) i.set(a.name, i.get(a.name) ?? t.length), t.push(a.name), n.push(a.color), r.push(typeof a.column == "number" && Number.isFinite(a.column) ? Math.max(0, Math.round(a.column)) : void 0);
+	let a = t.length, o = (e) => {
+		if (typeof e == "number") return Number.isInteger(e) && e >= 0 && e < a ? e : -1;
+		if (typeof e != "string") return -1;
+		let o = i.get(e);
+		return o === void 0 ? (i.set(e, t.length), t.push(e), n.push(void 0), r.push(void 0), t.length - 1) : o;
+	}, c = [], l = (e, t) => {
+		let n = /* @__PURE__ */ new Set([e]), r = [e];
+		for (; r.length;) {
+			let e = r.pop();
+			if (e === t) return !0;
+			for (let t of c[e] ?? []) n.has(t) || (n.add(t), r.push(t));
+		}
+		return !1;
+	}, u = [];
+	return (e.links ?? []).forEach((e, t) => {
+		if (!e) return;
+		let n = o(e.source), r = o(e.target);
+		n < 0 || r < 0 || n === r || l(r, n) || ((c[n] ?? (c[n] = [])).push(r), u.push({
+			link: t,
+			source: n,
+			target: r,
+			value: s(e.value),
+			...e.color ? { color: e.color } : {}
+		}));
+	}), {
+		names: t,
+		colors: n,
+		columns: r,
+		edges: u
+	};
+}, f = (e) => l(e.edges.map((t) => `${e.names[t.source]}\u2192${e.names[t.target]}`)), p = (e, t, n) => {
+	let r = d(e);
+	f(r).forEach((e, i) => {
+		let a = r.edges[i];
+		n.set(e, t.has(a.source) || t.has(a.target) ? 0 : a.value);
+	});
+}, m = (e, t = "justify") => {
+	let n = e.names.length, r = Array.from({ length: n }, () => []), i = Array.from({ length: n }, () => []);
+	for (let t of e.edges) r[t.source].push(t.target), i[t.target].push(t.source);
+	let a = [], o = i.map((e) => e.length), s = [];
+	for (o.forEach((e, t) => {
+		e || s.push(t);
+	}); s.length;) {
+		let e = s.shift();
+		a.push(e);
+		for (let t of r[e]) --o[t] === 0 && s.push(t);
+	}
+	let c = Array(n).fill(0);
+	for (let e of a) for (let t of r[e]) c[t] = Math.max(c[t], c[e] + 1);
+	let l = Array(n).fill(0);
+	for (let e = a.length - 1; e >= 0; e--) {
+		let t = a[e];
+		for (let e of r[t]) l[t] = Math.max(l[t], l[e] + 1);
+	}
+	let u = Math.max(0, ...c), d = c.map((e, n) => {
+		switch (t) {
+			case "left": return e;
+			case "right": return u - l[n];
+			case "center": return i[n].length ? e : r[n].length ? Math.min(...r[n].map((e) => c[e])) - 1 : 0;
+			default: return r[n].length ? e : u;
+		}
+	});
+	return e.columns.forEach((e, t) => {
+		e !== void 0 && (d[t] = e);
+	}), d;
+}, h = (e, t, n, r, i, a) => {
+	let o = (e) => e.outs.map((e) => t[e]), s = (e) => e.ins.map((e) => t[e]), c = (e) => {
+		e.outs.sort((e, n) => t[e].target.y0 - t[n].target.y0), e.ins.sort((e, n) => t[e].source.y0 - t[n].source.y0);
+	}, l = (e, t) => {
+		let n = e.y0 - (e.outs.length - 1) * i / 2;
+		for (let r of o(e)) {
+			if (r.target === t) break;
+			n += r.width + i;
+		}
+		for (let r of s(t)) {
+			if (r.source === e) break;
+			n -= r.width;
+		}
+		return n;
+	}, u = (e, t) => {
+		let n = t.y0 - (t.ins.length - 1) * i / 2;
+		for (let r of s(t)) {
+			if (r.source === e) break;
+			n += r.width + i;
+		}
+		for (let r of o(e)) {
+			if (r.target === t) break;
+			n -= r.width;
+		}
+		return n;
+	}, d = (e, t, n, r) => {
+		for (let a = n; a < e.length; a++) {
+			let n = e[a], o = (t - n.y0) * r;
+			o > 1e-6 && (n.y0 += o, n.y1 += o), t = n.y1 + i;
+		}
+	}, f = (e, t, n, r) => {
+		for (let a = n; a >= 0; a--) {
+			let n = e[a], o = (n.y1 - t) * r;
+			o > 1e-6 && (n.y0 -= o, n.y1 -= o), t = n.y0 - i;
+		}
+	}, p = (e, t) => {
+		let a = e.length >> 1, o = e[a];
+		o && (f(e, o.y0 - i, a - 1, t), d(e, o.y1 + i, a + 1, t), f(e, r, e.length - 1, t), d(e, n, 0, t));
+	}, m = (e, t) => e.y0 - t.y0;
+	for (let t of e) {
+		let e = n;
+		for (let n of t) {
+			let t = n.y1 - n.y0;
+			n.y0 = e, n.y1 = e + t, e = n.y1 + i;
+		}
+		let a = (r - e + i) / (t.length + 1);
+		t.forEach((e, t) => {
+			e.y0 += a * (t + 1), e.y1 += a * (t + 1);
+		});
+	}
+	for (let t of e) t.forEach(c);
+	for (let t = 0; t < a; t++) {
+		let n = .99 ** t, r = Math.max(1 - n, (t + 1) / a);
+		for (let t = e.length - 2; t >= 0; t--) {
+			let i = e[t];
+			for (let e of i) {
+				let t = 0, r = 0;
+				for (let n of o(e)) {
+					let i = n.value * (n.target.col - e.col);
+					t += u(e, n.target) * i, r += i;
+				}
+				if (!(r > 0)) continue;
+				let i = (t / r - e.y0) * n;
+				e.y0 += i, e.y1 += i, c(e);
+			}
+			i.sort(m), p(i, r);
+		}
+		for (let t = 1; t < e.length; t++) {
+			let i = e[t];
+			for (let e of i) {
+				let t = 0, r = 0;
+				for (let n of s(e)) {
+					let i = n.value * (e.col - n.source.col);
+					t += l(n.source, e) * i, r += i;
+				}
+				if (!(r > 0)) continue;
+				let i = (t / r - e.y0) * n;
+				e.y0 += i, e.y1 += i, c(e);
+			}
+			i.sort(m), p(i, r);
+		}
+	}
+	for (let t of e) t.forEach(c);
+}, g = 6, _ = 16, v = (s, l) => {
+	let { theme: p, area: v, measure: y, hidden: b } = l, x = d(s), S = f(x), C = x.names.length, w = x.edges.map((e) => b.has(e.source) || b.has(e.target) ? 0 : e.value), T = w.map((e, t) => Math.max(0, l.value(S[t], e)));
+	if (c(T) <= 1e-9) return a(l);
+	let E = m(x, s.align), D = Array(C).fill(0), O = Array(C).fill(0), k = Array(C).fill(0), A = Array(C).fill(0);
+	x.edges.forEach((e, t) => {
+		O[e.source] += w[t], D[e.target] += w[t], A[e.source] += T[t], k[e.target] += T[t];
+	});
+	let j = x.names.map((e, t) => {
+		let n = Math.max(k[t], A[t]);
+		return n > 1e-9 ? {
+			i: t,
+			col: E[t],
+			value: n,
+			x0: 0,
+			x1: 0,
+			y0: 0,
+			y1: 0,
+			outs: [],
+			ins: []
+		} : null;
+	}), M = [...new Set(j.filter((e) => e).map((e) => e.col))].sort((e, t) => e - t), N = new Map(M.map((e, t) => [e, t])), P = M.map(() => []);
+	for (let e of j) e && (e.col = N.get(e.col) ?? 0, P[e.col].push(e));
+	let F = [];
+	x.edges.forEach((e, t) => {
+		let n = j[e.source], r = j[e.target];
+		!n || !r || T[t] <= 1e-9 || (n.outs.push(F.length), r.ins.push(F.length), F.push({
+			k: t,
+			source: n,
+			target: r,
+			value: T[t],
+			width: 0,
+			y0: 0,
+			y1: 0
+		}));
+	});
+	let I = r(o(s.nodeWidth, 12), 1, 64), L = P.length, R = v.y + 2, z = v.y + v.height - 2, B = Math.max(1, z - R), V = Math.max(1, ...P.map((e) => e.length)), H = Math.min(Math.max(0, o(s.nodePadding, 12)), V > 1 ? B * .5 / (V - 1) : Infinity), U = Math.min(...P.map((e) => (B - (e.length - 1) * H) / Math.max(1e-9, c(e.map((e) => e.value))))), W = L > 1 ? (v.width - I) / (L - 1) : 0;
+	P.forEach((e, t) => {
+		let n = L > 1 ? v.x + t * W : v.x + (v.width - I) / 2;
+		for (let t of e) t.x0 = n, t.x1 = n + I, t.y0 = 0, t.y1 = t.value * U;
+	});
+	for (let e of F) e.width = e.value * U;
+	h(P, F, R, z, H, Math.round(r(o(s.iterations, 32), 0, 200)));
+	for (let e of P) for (let t of e) {
+		let e = t.y0;
+		for (let n of t.outs) F[n].y0 = e + F[n].width / 2, e += F[n].width;
+		e = t.y0;
+		for (let n of t.ins) F[n].y1 = e + F[n].width / 2, e += F[n].width;
+	}
+	let G = x.names.map((e, t) => l.color(x.colors[t], t)).map((e) => t(e)), ee = e(p.grid, p.textMuted, .45), K = s.linkColor ?? "gradient", q = r(o(s.linkOpacity, .4), .02, 1), te = Math.min(1, q + .3), J = [], Y = [], X = (e) => C + x.edges[e.k].link, Z = (e) => [...e.ins.map((e) => X(F[e])), ...e.outs.map((e) => X(F[e]))], ne = F.slice().sort((e, t) => t.width - e.width);
+	for (let e of ne) {
+		let n = x.edges[e.k].color, r, i;
+		n ? r = i = t(l.color(n, e.source.i)) : K === "source" ? r = i = G[e.source.i] : K === "target" ? r = i = G[e.target.i] : K === "neutral" ? r = i = t(ee) : (r = G[e.source.i], i = G[e.target.i]), J.push({
+			kind: "link",
+			x0: e.source.x1,
+			y0: e.y0,
+			x1: e.target.x0,
+			y1: e.y1,
+			width: e.width,
+			color0: r,
+			color1: i,
+			alpha: q,
+			activeAlpha: te,
+			hit: X(e),
+			also: [e.source.i, e.target.i]
+		});
+	}
+	for (let e of P) for (let t of e) J.push({
+		kind: "rect",
+		x: t.x0,
+		y: t.y0,
+		width: t.x1 - t.x0,
+		height: Math.max(1, t.y1 - t.y0),
+		radius: Math.min(2, I / 2),
+		fill: G[t.i],
+		hit: t.i,
+		also: Z(t),
+		brighten: !0
+	});
+	if (s.labels !== !1) {
+		let e = n(p, 12, 500), r = n(p, 12), a = t(p.background, .8), o = [], c = L > 1 ? Math.max(0, W - I - 12) : v.width, u = P.flat().slice().sort((e, t) => Number(t.col === L - 1) - Number(e.col === L - 1) || t.value - e.value);
+		for (let n of u) {
+			let u = L > 1 && n.col === L - 1, d = s.labelValues === !1 ? "" : l.format(Math.max(D[n.i], O[n.i])), f = d ? y(d, r) : 0, m = i(x.names[n.i], c - (d ? f + 6 : 0), e, y);
+			if (!m && d && (d = "", f = 0, m = i(x.names[n.i], c, e, y)), !m) continue;
+			let h = y(m, e) + (d ? 6 + f : 0), b = u ? [!0, !1] : [!1, !0], S = Math.max(0, (n.y1 - n.y0) / 2 - _ / 2 + 2), C = [0];
+			for (let e = 6; e <= S; e += 6) C.push(e, -e);
+			let w = null;
+			for (let e of b) {
+				let t = e ? n.x0 - g : n.x1 + g, r = e ? t - h : t;
+				if (!(r < v.x - 2 || r + h > v.x + v.width + 2)) {
+					for (let e of C) {
+						let t = (n.y0 + n.y1) / 2 + e, i = {
+							x0: r,
+							x1: r + h,
+							y0: t - _ / 2,
+							y1: t + _ / 2
+						};
+						if (!(i.y0 < v.y - 4 || i.y1 > v.y + v.height + 4 || o.some((e) => e.x0 < i.x1 && i.x0 < e.x1 && e.y0 < i.y1 && i.y0 < e.y1))) {
+							w = i;
+							break;
+						}
+					}
+					if (w) break;
+				}
+			}
+			if (!w) continue;
+			o.push(w);
+			let T = (w.y0 + w.y1) / 2, E = Z(n);
+			J.push({
+				kind: "text",
+				x: w.x0,
+				y: T,
+				text: m,
+				font: e,
+				color: t(p.text),
+				align: "left",
+				baseline: "middle",
+				halo: a,
+				hit: n.i,
+				also: E
+			}), d && J.push({
+				kind: "text",
+				x: w.x1,
+				y: T,
+				text: d,
+				font: r,
+				color: t(p.textMuted),
+				align: "right",
+				baseline: "middle",
+				halo: a,
+				hit: n.i,
+				also: E
+			});
+		}
+	}
+	let Q = c(x.names.map((e, t) => D[t] <= 0 ? O[t] : 0));
+	for (let e of P) for (let t of e.slice().sort((e, t) => e.y0 - t.y0)) {
+		let e = Math.max(D[t.i], O[t.i]);
+		if (e <= 0) continue;
+		let n = Q > 0 ? e / Q : 0;
+		Y.push({
+			index: t.i,
+			name: x.names[t.i],
+			value: e,
+			percent: n,
+			share: l.percent(n),
+			color: G[t.i],
+			x: (t.x0 + t.x1) / 2,
+			y: (t.y0 + t.y1) / 2,
+			rows: [
+				{
+					name: l.labels.value,
+					value: l.format(e)
+				},
+				...D[t.i] > 0 ? [{
+					name: l.labels.incoming,
+					value: l.format(D[t.i])
+				}] : [],
+				...O[t.i] > 0 ? [{
+					name: l.labels.outgoing,
+					value: l.format(O[t.i])
+				}] : []
+			]
+		});
+	}
+	let re = F.slice().sort((e, t) => e.source.col - t.source.col || e.y0 - t.y0 || e.target.y0 - t.target.y0);
+	for (let e of re) {
+		let t = x.edges[e.k], n = w[e.k];
+		if (n <= 0) continue;
+		let r = x.names[t.source], i = x.names[t.target], a = O[t.source] > 0 ? n / O[t.source] : 0, o = D[t.target] > 0 ? n / D[t.target] : 0;
+		Y.push({
+			index: X(e),
+			name: `${r} \u2192 ${i}`,
+			value: n,
+			percent: a,
+			share: l.percent(a),
+			color: G[t.source],
+			x: (e.source.x1 + e.target.x0) / 2,
+			y: (e.y0 + e.y1) / 2,
+			rows: [
+				{
+					name: l.labels.value,
+					value: l.format(n)
+				},
+				{
+					name: u(l.labels.ofName, { name: r }),
+					value: l.percent(a)
+				},
+				{
+					name: u(l.labels.ofName, { name: i }),
+					value: l.percent(o)
+				}
+			],
+			event: {
+				source: r,
+				target: i
+			}
+		});
+	}
+	let $ = r(l.enter, 0, 1);
+	return {
+		nodes: J,
+		items: Y,
+		dim: .3,
+		empty: !1,
+		...$ < 1 ? { enter: {
+			alpha: $,
+			scale: .97 + .03 * $,
+			cx: v.x + v.width / 2,
+			cy: v.y + v.height / 2
+		} } : {}
+	};
+};
+//#endregion
+export { v as layoutSankey, d as resolveSankey, m as sankeyColumns, p as sankeyValues };
+
+//# sourceMappingURL=sankey.js.map

package/dist/native/charts/src/engine/shapes/sankey.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sankey.js","names":["resolveSankey","names","colors","columns","byName","node","o","declared","resolve","end","known","out","reaches","seen","from","stack","n","to","m","edges","l","source","target","i","positive","edgeKeys","uniqueKeys","g","e","sankeyValues","k","key","hidden","sankeyColumns","outs","ins","order","pending","queue","p","depth","height","t","last","align","d","col","relax","outsOf","insOf","reorder","a","b","targetTop","y","py","sourceTop","down","nodes","dy","alpha","up","collide","mid","subject","bottom","top","byY","h","extra","it","iterations","beta","c","w","v","LABEL_GAP","LABEL_LINE","layoutSankey","keys","targets","shown","sum","emptyLayout","columnOf","inT","outT","inV","outV","laid","value","used","rank","nodeWidth","clamp","finite","ncols","area","maxCount","ky","step","x0","css","toCss","neutral","mix","theme","mode","opacity","activeAlpha","items","linkIndex","linksOf","drawn","own","c0","c1","nameFont","font","valueFont","halo","boxes","room","valueW","measure","name","ellipsize","width","sides","reach","offsets","box","left","x","candidate","also","entering","percent","linkItems","ge","ofSource","ofTarget","interpolate","enter"],"sources":["../../../../../../../charts/src/engine/shapes/sankey.ts"],"sourcesContent":["// Sankey layout: nodes in columns (longest path from the sources), heights\n// proportional to their flow, vertical positions relaxed toward the weighted\n// center of their neighbours (fewer crossings, straighter flows), links as\n// S-curves of constant thickness with a gradient from the source color.\n\nimport { mix, toCss, type Rgba } from \"../color\";\nimport { font } from \"../overlay\";\nimport { interpolate } from \"./labels\";\nimport {\n  clamp,\n  ellipsize,\n  emptyLayout,\n  finite,\n  positive,\n  sum,\n  uniqueKeys,\n  type LayoutContext,\n  type LayoutResult,\n  type ShapeItem,\n  type ShapeNode,\n} from \"./scene\";\nimport type { SankeyChartOptions } from \"./types\";\n\n/** A link that takes part in the layout */\nexport interface SankeyEdge {\n  /** Index in `options.links` */\n  link: number;\n  source: number;\n  target: number;\n  /** Target value (negative values count as 0) */\n  value: number;\n  color?: string;\n}\n\n/** Nodes (declared first, then the ones only named by links) and valid links */\nexport interface SankeyGraph {\n  names: string[];\n  colors: (string | undefined)[];\n  columns: (number | undefined)[];\n  edges: SankeyEdge[];\n}\n\n/**\n * Resolves the links' ends (names or indexes), appends the nodes only named\n * by links, drops self links, invalid ends and the links closing a cycle.\n */\nexport const resolveSankey = (o: SankeyChartOptions): SankeyGraph => {\n  const names: string[] = [];\n  const colors: (string | undefined)[] = [];\n  const columns: (number | undefined)[] = [];\n  const byName = new Map<string, number>();\n  for (const node of o.nodes ?? []) {\n    byName.set(node.name, byName.get(node.name) ?? names.length);\n    names.push(node.name);\n    colors.push(node.color);\n    columns.push(\n      typeof node.column === \"number\" && Number.isFinite(node.column)\n        ? Math.max(0, Math.round(node.column))\n        : undefined,\n    );\n  }\n  const declared = names.length;\n  const resolve = (end: string | number): number => {\n    if (typeof end === \"number\")\n      return Number.isInteger(end) && end >= 0 && end < declared ? end : -1;\n    if (typeof end !== \"string\") return -1;\n    const known = byName.get(end);\n    if (known !== undefined) return known;\n    byName.set(end, names.length);\n    names.push(end);\n    colors.push(undefined);\n    columns.push(undefined);\n    return names.length - 1;\n  };\n  const out: number[][] = [];\n  const reaches = (from: number, to: number) => {\n    const seen = new Set<number>([from]);\n    const stack = [from];\n    while (stack.length) {\n      const n = stack.pop() as number;\n      if (n === to) return true;\n      for (const m of out[n] ?? [])\n        if (!seen.has(m)) {\n          seen.add(m);\n          stack.push(m);\n        }\n    }\n    return false;\n  };\n  const edges: SankeyEdge[] = [];\n  (o.links ?? []).forEach((l, i) => {\n    if (!l) return;\n    const source = resolve(l.source);\n    const target = resolve(l.target);\n    if (source < 0 || target < 0 || source === target) return;\n    if (reaches(target, source)) return;\n    (out[source] ??= []).push(target);\n    edges.push({\n      link: i,\n      source,\n      target,\n      value: positive(l.value),\n      ...(l.color ? { color: l.color } : {}),\n    });\n  });\n  return { names, colors, columns, edges };\n};\n\nconst edgeKeys = (g: SankeyGraph) =>\n  uniqueKeys(\n    g.edges.map((e) => `${g.names[e.source]}\\u2192${g.names[e.target]}`),\n  );\n\n/** Target values of the links (0 when an end is hidden) */\nexport const sankeyValues = (\n  o: SankeyChartOptions,\n  hidden: ReadonlySet<number>,\n  out: Map<string, number>,\n) => {\n  const g = resolveSankey(o);\n  edgeKeys(g).forEach((key, k) => {\n    const e = g.edges[k];\n    out.set(key, hidden.has(e.source) || hidden.has(e.target) ? 0 : e.value);\n  });\n};\n\n/** Column of every node (`align` and the explicit `column`s) */\nexport const sankeyColumns = (\n  g: SankeyGraph,\n  align: SankeyChartOptions[\"align\"] = \"justify\",\n): number[] => {\n  const n = g.names.length;\n  const outs: number[][] = Array.from({ length: n }, () => []);\n  const ins: number[][] = Array.from({ length: n }, () => []);\n  for (const e of g.edges) {\n    outs[e.source].push(e.target);\n    ins[e.target].push(e.source);\n  }\n  // longest path from the sources (depth) and to the sinks (height)\n  const order: number[] = [];\n  const pending = ins.map((l) => l.length);\n  const queue: number[] = [];\n  pending.forEach((p, i) => {\n    if (!p) queue.push(i);\n  });\n  while (queue.length) {\n    const i = queue.shift() as number;\n    order.push(i);\n    for (const t of outs[i]) if (--pending[t] === 0) queue.push(t);\n  }\n  const depth = new Array<number>(n).fill(0);\n  for (const i of order)\n    for (const t of outs[i]) depth[t] = Math.max(depth[t], depth[i] + 1);\n  const height = new Array<number>(n).fill(0);\n  for (let k = order.length - 1; k >= 0; k--) {\n    const i = order[k];\n    for (const t of outs[i]) height[i] = Math.max(height[i], height[t] + 1);\n  }\n  const last = Math.max(0, ...depth);\n  const columns = depth.map((d, i) => {\n    switch (align) {\n      case \"left\":\n        return d;\n      case \"right\":\n        return last - height[i];\n      case \"center\":\n        return ins[i].length\n          ? d\n          : outs[i].length\n            ? Math.min(...outs[i].map((t) => depth[t])) - 1\n            : 0;\n      default:\n        return outs[i].length ? d : last;\n    }\n  });\n  g.columns.forEach((col, i) => {\n    if (col !== undefined) columns[i] = col;\n  });\n  return columns;\n};\n\ninterface LaidNode {\n  i: number;\n  col: number;\n  value: number;\n  x0: number;\n  x1: number;\n  y0: number;\n  y1: number;\n  /** Links leaving / entering the node (indexes in `edges`) */\n  outs: number[];\n  ins: number[];\n}\n\ninterface LaidEdge {\n  k: number;\n  source: LaidNode;\n  target: LaidNode;\n  value: number;\n  width: number;\n  y0: number;\n  y1: number;\n}\n\n/** Vertical positions (d3-sankey's initialization, relaxation and collision passes) */\nconst relax = (\n  columns: LaidNode[][],\n  edges: LaidEdge[],\n  top: number,\n  bottom: number,\n  py: number,\n  iterations: number,\n) => {\n  const outsOf = (n: LaidNode) => n.outs.map((k) => edges[k]);\n  const insOf = (n: LaidNode) => n.ins.map((k) => edges[k]);\n\n  const reorder = (n: LaidNode) => {\n    n.outs.sort((a, b) => edges[a].target.y0 - edges[b].target.y0);\n    n.ins.sort((a, b) => edges[a].source.y0 - edges[b].source.y0);\n  };\n  /** Top of `target` for which the link from `source` would be horizontal */\n  const targetTop = (source: LaidNode, target: LaidNode) => {\n    let y = source.y0 - ((source.outs.length - 1) * py) / 2;\n    for (const e of outsOf(source)) {\n      if (e.target === target) break;\n      y += e.width + py;\n    }\n    for (const e of insOf(target)) {\n      if (e.source === source) break;\n      y -= e.width;\n    }\n    return y;\n  };\n  const sourceTop = (source: LaidNode, target: LaidNode) => {\n    let y = target.y0 - ((target.ins.length - 1) * py) / 2;\n    for (const e of insOf(target)) {\n      if (e.source === source) break;\n      y += e.width + py;\n    }\n    for (const e of outsOf(source)) {\n      if (e.target === target) break;\n      y -= e.width;\n    }\n    return y;\n  };\n  const down = (nodes: LaidNode[], y: number, from: number, alpha: number) => {\n    for (let i = from; i < nodes.length; i++) {\n      const n = nodes[i];\n      const dy = (y - n.y0) * alpha;\n      if (dy > 1e-6) {\n        n.y0 += dy;\n        n.y1 += dy;\n      }\n      y = n.y1 + py;\n    }\n  };\n  const up = (nodes: LaidNode[], y: number, from: number, alpha: number) => {\n    for (let i = from; i >= 0; i--) {\n      const n = nodes[i];\n      const dy = (n.y1 - y) * alpha;\n      if (dy > 1e-6) {\n        n.y0 -= dy;\n        n.y1 -= dy;\n      }\n      y = n.y0 - py;\n    }\n  };\n  const collide = (nodes: LaidNode[], alpha: number) => {\n    const mid = nodes.length >> 1;\n    const subject = nodes[mid];\n    if (!subject) return;\n    up(nodes, subject.y0 - py, mid - 1, alpha);\n    down(nodes, subject.y1 + py, mid + 1, alpha);\n    up(nodes, bottom, nodes.length - 1, alpha);\n    down(nodes, top, 0, alpha);\n  };\n  const byY = (a: LaidNode, b: LaidNode) => a.y0 - b.y0;\n\n  // initial positions: stacked in the data order, the free space spread out\n  for (const nodes of columns) {\n    let y = top;\n    for (const n of nodes) {\n      const h = n.y1 - n.y0;\n      n.y0 = y;\n      n.y1 = y + h;\n      y = n.y1 + py;\n    }\n    const extra = (bottom - y + py) / (nodes.length + 1);\n    nodes.forEach((n, i) => {\n      n.y0 += extra * (i + 1);\n      n.y1 += extra * (i + 1);\n    });\n  }\n  for (const nodes of columns) nodes.forEach(reorder);\n\n  for (let it = 0; it < iterations; it++) {\n    const alpha = Math.pow(0.99, it);\n    const beta = Math.max(1 - alpha, (it + 1) / iterations);\n    // right to left: nodes move toward their targets\n    for (let c = columns.length - 2; c >= 0; c--) {\n      const nodes = columns[c];\n      for (const n of nodes) {\n        let y = 0;\n        let w = 0;\n        for (const e of outsOf(n)) {\n          const v = e.value * (e.target.col - n.col);\n          y += sourceTop(n, e.target) * v;\n          w += v;\n        }\n        if (!(w > 0)) continue;\n        const dy = (y / w - n.y0) * alpha;\n        n.y0 += dy;\n        n.y1 += dy;\n        reorder(n);\n      }\n      nodes.sort(byY);\n      collide(nodes, beta);\n    }\n    // left to right: nodes move toward their sources\n    for (let c = 1; c < columns.length; c++) {\n      const nodes = columns[c];\n      for (const n of nodes) {\n        let y = 0;\n        let w = 0;\n        for (const e of insOf(n)) {\n          const v = e.value * (n.col - e.source.col);\n          y += targetTop(e.source, n) * v;\n          w += v;\n        }\n        if (!(w > 0)) continue;\n        const dy = (y / w - n.y0) * alpha;\n        n.y0 += dy;\n        n.y1 += dy;\n        reorder(n);\n      }\n      nodes.sort(byY);\n      collide(nodes, beta);\n    }\n  }\n  for (const nodes of columns) nodes.forEach(reorder);\n};\n\nconst LABEL_GAP = 6;\nconst LABEL_LINE = 16;\n\nexport const layoutSankey = (\n  o: SankeyChartOptions,\n  c: LayoutContext,\n): LayoutResult => {\n  const { theme, area, measure, hidden } = c;\n  const g = resolveSankey(o);\n  const keys = edgeKeys(g);\n  const n = g.names.length;\n  const targets = g.edges.map((e) =>\n    hidden.has(e.source) || hidden.has(e.target) ? 0 : e.value,\n  );\n  const shown = targets.map((t, k) => Math.max(0, c.value(keys[k], t)));\n  if (sum(shown) <= 1e-9) return emptyLayout(c);\n\n  const columnOf = sankeyColumns(g, o.align);\n  const inT = new Array<number>(n).fill(0);\n  const outT = new Array<number>(n).fill(0);\n  const inV = new Array<number>(n).fill(0);\n  const outV = new Array<number>(n).fill(0);\n  g.edges.forEach((e, k) => {\n    outT[e.source] += targets[k];\n    inT[e.target] += targets[k];\n    outV[e.source] += shown[k];\n    inV[e.target] += shown[k];\n  });\n\n  // nodes with a flow, by column (empty columns removed)\n  const laid: (LaidNode | null)[] = g.names.map((_, i) => {\n    const value = Math.max(inV[i], outV[i]);\n    return value > 1e-9\n      ? {\n          i,\n          col: columnOf[i],\n          value,\n          x0: 0,\n          x1: 0,\n          y0: 0,\n          y1: 0,\n          outs: [],\n          ins: [],\n        }\n      : null;\n  });\n  const used = [\n    ...new Set(laid.filter((l) => l).map((l) => (l as LaidNode).col)),\n  ].sort((a, b) => a - b);\n  const rank = new Map(used.map((col, k) => [col, k]));\n  const columns: LaidNode[][] = used.map(() => []);\n  for (const l of laid)\n    if (l) {\n      l.col = rank.get(l.col) ?? 0;\n      columns[l.col].push(l);\n    }\n  const edges: LaidEdge[] = [];\n  g.edges.forEach((e, k) => {\n    const source = laid[e.source];\n    const target = laid[e.target];\n    if (!source || !target || shown[k] <= 1e-9) return;\n    source.outs.push(edges.length);\n    target.ins.push(edges.length);\n    edges.push({\n      k,\n      source,\n      target,\n      value: shown[k],\n      width: 0,\n      y0: 0,\n      y1: 0,\n    });\n  });\n\n  // geometry\n  const nodeWidth = clamp(finite(o.nodeWidth, 12), 1, 64);\n  const ncols = columns.length;\n  const top = area.y + 2;\n  const bottom = area.y + area.height - 2;\n  const height = Math.max(1, bottom - top);\n  const maxCount = Math.max(1, ...columns.map((col) => col.length));\n  const py = Math.min(\n    Math.max(0, finite(o.nodePadding, 12)),\n    maxCount > 1 ? (height * 0.5) / (maxCount - 1) : Infinity,\n  );\n  const ky = Math.min(\n    ...columns.map(\n      (col) =>\n        (height - (col.length - 1) * py) /\n        Math.max(1e-9, sum(col.map((l) => l.value))),\n    ),\n  );\n  const step = ncols > 1 ? (area.width - nodeWidth) / (ncols - 1) : 0;\n  columns.forEach((col, k) => {\n    const x0 =\n      ncols > 1 ? area.x + k * step : area.x + (area.width - nodeWidth) / 2;\n    for (const l of col) {\n      l.x0 = x0;\n      l.x1 = x0 + nodeWidth;\n      l.y0 = 0;\n      l.y1 = l.value * ky;\n    }\n  });\n  for (const e of edges) e.width = e.value * ky;\n  relax(\n    columns,\n    edges,\n    top,\n    bottom,\n    py,\n    Math.round(clamp(finite(o.iterations, 32), 0, 200)),\n  );\n  // where the links leave / reach the nodes\n  for (const col of columns)\n    for (const l of col) {\n      let y = l.y0;\n      for (const k of l.outs) {\n        edges[k].y0 = y + edges[k].width / 2;\n        y += edges[k].width;\n      }\n      y = l.y0;\n      for (const k of l.ins) {\n        edges[k].y1 = y + edges[k].width / 2;\n        y += edges[k].width;\n      }\n    }\n\n  // colors\n  const colors: Rgba[] = g.names.map((_, i) => c.color(g.colors[i], i));\n  const css = colors.map((col) => toCss(col));\n  const neutral = mix(theme.grid, theme.textMuted, 0.45);\n  const mode = o.linkColor ?? \"gradient\";\n  const opacity = clamp(finite(o.linkOpacity, 0.4), 0.02, 1);\n  const activeAlpha = Math.min(1, opacity + 0.3);\n\n  const nodes: ShapeNode[] = [];\n  const items: ShapeItem[] = [];\n  const linkIndex = (e: LaidEdge) => n + g.edges[e.k].link;\n  const linksOf = (l: LaidNode) => [\n    ...l.ins.map((k) => linkIndex(edges[k])),\n    ...l.outs.map((k) => linkIndex(edges[k])),\n  ];\n\n  // links: widest first, so the thin ones stay on top (and hoverable)\n  const drawn = edges.slice().sort((a, b) => b.width - a.width);\n  for (const e of drawn) {\n    const own = g.edges[e.k].color;\n    let c0: string;\n    let c1: string;\n    if (own) c0 = c1 = toCss(c.color(own, e.source.i));\n    else if (mode === \"source\") c0 = c1 = css[e.source.i];\n    else if (mode === \"target\") c0 = c1 = css[e.target.i];\n    else if (mode === \"neutral\") c0 = c1 = toCss(neutral);\n    else {\n      c0 = css[e.source.i];\n      c1 = css[e.target.i];\n    }\n    nodes.push({\n      kind: \"link\",\n      x0: e.source.x1,\n      y0: e.y0,\n      x1: e.target.x0,\n      y1: e.y1,\n      width: e.width,\n      color0: c0,\n      color1: c1,\n      alpha: opacity,\n      activeAlpha,\n      hit: linkIndex(e),\n      also: [e.source.i, e.target.i],\n    });\n  }\n\n  // node bars\n  for (const col of columns)\n    for (const l of col)\n      nodes.push({\n        kind: \"rect\",\n        x: l.x0,\n        y: l.y0,\n        width: l.x1 - l.x0,\n        height: Math.max(1, l.y1 - l.y0),\n        radius: Math.min(2, nodeWidth / 2),\n        fill: css[l.i],\n        hit: l.i,\n        also: linksOf(l),\n        brighten: true,\n      });\n\n  // labels: right of the nodes, left of the last column; the biggest first\n  if (o.labels !== false) {\n    const nameFont = font(theme, 12, 500);\n    const valueFont = font(theme, 12);\n    const halo = toCss(theme.background, 0.8);\n    const boxes: { x0: number; x1: number; y0: number; y1: number }[] = [];\n    const room =\n      ncols > 1 ? Math.max(0, step - nodeWidth - LABEL_GAP * 2) : area.width;\n    // the last column first (its labels have a single side), then the biggest\n    const order = columns\n      .flat()\n      .slice()\n      .sort(\n        (a, b) =>\n          Number(b.col === ncols - 1) - Number(a.col === ncols - 1) ||\n          b.value - a.value,\n      );\n    for (const l of order) {\n      const last = ncols > 1 && l.col === ncols - 1;\n      let value =\n        o.labelValues === false ? \"\" : c.format(Math.max(inT[l.i], outT[l.i]));\n      let valueW = value ? measure(value, valueFont) : 0;\n      let name = ellipsize(\n        g.names[l.i],\n        room - (value ? valueW + 6 : 0),\n        nameFont,\n        measure,\n      );\n      if (!name && value) {\n        value = \"\";\n        valueW = 0;\n        name = ellipsize(g.names[l.i], room, nameFont, measure);\n      }\n      if (!name) continue;\n      const nameW = measure(name, nameFont);\n      const width = nameW + (value ? 6 + valueW : 0);\n      // candidates: the preferred side (inward for the last column), then\n      // the other one when it stays in the drawing; each nudged along the bar\n      const sides = last ? [true, false] : [false, true];\n      const reach = Math.max(0, (l.y1 - l.y0) / 2 - LABEL_LINE / 2 + 2);\n      const offsets = [0];\n      for (let d = 6; d <= reach; d += 6) offsets.push(d, -d);\n      let box: { x0: number; x1: number; y0: number; y1: number } | null = null;\n      for (const left of sides) {\n        const x = left ? l.x0 - LABEL_GAP : l.x1 + LABEL_GAP;\n        const x0 = left ? x - width : x;\n        if (x0 < area.x - 2 || x0 + width > area.x + area.width + 2) continue;\n        for (const dy of offsets) {\n          const y = (l.y0 + l.y1) / 2 + dy;\n          const candidate = {\n            x0,\n            x1: x0 + width,\n            y0: y - LABEL_LINE / 2,\n            y1: y + LABEL_LINE / 2,\n          };\n          if (\n            candidate.y0 < area.y - 4 ||\n            candidate.y1 > area.y + area.height + 4 ||\n            boxes.some(\n              (b) =>\n                b.x0 < candidate.x1 &&\n                candidate.x0 < b.x1 &&\n                b.y0 < candidate.y1 &&\n                candidate.y0 < b.y1,\n            )\n          )\n            continue;\n          box = candidate;\n          break;\n        }\n        if (box) break;\n      }\n      if (!box) continue;\n      boxes.push(box);\n      const y = (box.y0 + box.y1) / 2;\n      const also = linksOf(l);\n      nodes.push({\n        kind: \"text\",\n        x: box.x0,\n        y,\n        text: name,\n        font: nameFont,\n        color: toCss(theme.text),\n        align: \"left\",\n        baseline: \"middle\",\n        halo,\n        hit: l.i,\n        also,\n      });\n      if (value)\n        nodes.push({\n          kind: \"text\",\n          x: box.x1,\n          y,\n          text: value,\n          font: valueFont,\n          color: toCss(theme.textMuted),\n          align: \"right\",\n          baseline: \"middle\",\n          halo,\n          hit: l.i,\n          also,\n        });\n    }\n  }\n\n  // items: nodes by column and position, then links\n  const entering = sum(g.names.map((_, i) => (inT[i] <= 0 ? outT[i] : 0)));\n  for (const col of columns)\n    for (const l of col.slice().sort((a, b) => a.y0 - b.y0)) {\n      const value = Math.max(inT[l.i], outT[l.i]);\n      if (value <= 0) continue;\n      const percent = entering > 0 ? value / entering : 0;\n      items.push({\n        index: l.i,\n        name: g.names[l.i],\n        value,\n        percent,\n        share: c.percent(percent),\n        color: css[l.i],\n        x: (l.x0 + l.x1) / 2,\n        y: (l.y0 + l.y1) / 2,\n        rows: [\n          { name: c.labels.value, value: c.format(value) },\n          ...(inT[l.i] > 0\n            ? [{ name: c.labels.incoming, value: c.format(inT[l.i]) }]\n            : []),\n          ...(outT[l.i] > 0\n            ? [{ name: c.labels.outgoing, value: c.format(outT[l.i]) }]\n            : []),\n        ],\n      });\n    }\n  const linkItems = edges\n    .slice()\n    .sort(\n      (a, b) =>\n        a.source.col - b.source.col || a.y0 - b.y0 || a.target.y0 - b.target.y0,\n    );\n  for (const e of linkItems) {\n    const ge = g.edges[e.k];\n    const value = targets[e.k];\n    if (value <= 0) continue;\n    const source = g.names[ge.source];\n    const target = g.names[ge.target];\n    const ofSource = outT[ge.source] > 0 ? value / outT[ge.source] : 0;\n    const ofTarget = inT[ge.target] > 0 ? value / inT[ge.target] : 0;\n    items.push({\n      index: linkIndex(e),\n      name: `${source} \\u2192 ${target}`,\n      value,\n      percent: ofSource,\n      share: c.percent(ofSource),\n      color: css[ge.source],\n      x: (e.source.x1 + e.target.x0) / 2,\n      y: (e.y0 + e.y1) / 2,\n      rows: [\n        { name: c.labels.value, value: c.format(value) },\n        {\n          name: interpolate(c.labels.ofName, { name: source }),\n          value: c.percent(ofSource),\n        },\n        {\n          name: interpolate(c.labels.ofName, { name: target }),\n          value: c.percent(ofTarget),\n        },\n      ],\n      event: { source, target },\n    });\n  }\n\n  const enter = clamp(c.enter, 0, 1);\n  return {\n    nodes,\n    items,\n    dim: 0.3,\n    empty: false,\n    ...(enter < 1\n      ? {\n          enter: {\n            alpha: enter,\n            scale: 0.97 + 0.03 * enter,\n            cx: area.x + area.width / 2,\n            cy: area.y + area.height / 2,\n          },\n        }\n      : {}),\n  };\n};\n"],"mappings":";;;;;AA8CA,IAAaA,KAAiB,MAAuC;CACnE,IAAMC,IAAkB,CAAC,GACnBC,IAAiC,CAAC,GAClCC,IAAkC,CAAC,GACnCC,oBAAS,IAAI,IAAoB;CACvC,KAAK,IAAMC,KAAQC,EAAE,SAAS,CAAC,GAI7B,AAHAF,EAAO,IAAIC,EAAK,MAAMD,EAAO,IAAIC,EAAK,IAAI,KAAKJ,EAAM,MAAM,GAC3DA,EAAM,KAAKI,EAAK,IAAI,GACpBH,EAAO,KAAKG,EAAK,KAAK,GACtBF,EAAQ,KACN,OAAOE,EAAK,UAAW,YAAY,OAAO,SAASA,EAAK,MAAM,IAC1D,KAAK,IAAI,GAAG,KAAK,MAAMA,EAAK,MAAM,CAAC,IACnC,KAAA,CACN;CAEF,IAAME,IAAWN,EAAM,QACjBO,KAAW,MAAiC;EAChD,IAAI,OAAOC,KAAQ,UACjB,OAAO,OAAO,UAAUA,CAAG,KAAKA,KAAO,KAAKA,IAAMF,IAAWE,IAAM;EACrE,IAAI,OAAOA,KAAQ,UAAU,OAAO;EACpC,IAAMC,IAAQN,EAAO,IAAIK,CAAG;EAM5B,OALIC,MAAU,KAAA,KACdN,EAAO,IAAIK,GAAKR,EAAM,MAAM,GAC5BA,EAAM,KAAKQ,CAAG,GACdP,EAAO,KAAK,KAAA,CAAS,GACrBC,EAAQ,KAAK,KAAA,CAAS,GACfF,EAAM,SAAS,KALUS;CAMlC,GACMC,IAAkB,CAAC,GACnBC,KAAW,GAAc,MAAe;EAC5C,IAAMC,oBAAO,IAAI,IAAY,CAACC,CAAI,CAAC,GAC7BC,IAAQ,CAACD,CAAI;EACnB,OAAOC,EAAM,SAAQ;GACnB,IAAMC,IAAID,EAAM,IAAI;GACpB,IAAIC,MAAMC,GAAI,OAAO;GACrB,KAAK,IAAMC,KAAKP,EAAIK,MAAM,CAAC,GACzB,AAAKH,EAAK,IAAIK,CAAC,MACbL,EAAK,IAAIK,CAAC,GACVH,EAAM,KAAKG,CAAC;EAElB;EACA,OAAO;CACT,GACMC,IAAsB,CAAC;CAgB7B,QAfCb,EAAE,SAAS,CAAC,EAAA,CAAG,SAAS,GAAG,MAAM;EAChC,IAAI,CAACc,GAAG;EACR,IAAMC,IAASb,EAAQY,EAAE,MAAM,GACzBE,IAASd,EAAQY,EAAE,MAAM;EAC/B,AAAIC,IAAS,KAAKC,IAAS,KAAKD,MAAWC,KACvCV,EAAQU,GAAQD,CAAM,OACzBV,EAAIU,OAAJ,EAAIA,KAAY,CAAC,GAAA,CAAG,KAAKC,CAAM,GAChCH,EAAM,KAAK;GACT,MAAMI;GACN;GACA;GACA,OAAOC,EAASJ,EAAE,KAAK;GACvB,GAAIA,EAAE,QAAQ,EAAE,OAAOA,EAAE,MAAM,IAAI,CAAC;EACtC,CAAC;CACH,CAAC,GACM;EAAE;EAAO;EAAQ;EAAS;CAAM;AACzC,GAEMK,KAAY,MAChBC,EACEC,EAAE,MAAM,KAAK,MAAM,GAAGA,EAAE,MAAMC,EAAE,QAAQ,QAAQD,EAAE,MAAMC,EAAE,SAAS,CACrE,GAGWC,KACX,GACA,GACA,MACG;CACH,IAAMF,IAAI3B,EAAcM,CAAC;CACzB,EAASqB,CAAC,CAAC,CAAC,SAAS,GAAK,MAAM;EAC9B,IAAMC,IAAID,EAAE,MAAMG;EAClB,EAAI,IAAIC,GAAKC,EAAO,IAAIJ,EAAE,MAAM,KAAKI,EAAO,IAAIJ,EAAE,MAAM,IAAI,IAAIA,EAAE,KAAK;CACzE,CAAC;AACH,GAGaK,KACX,GACA,IAAqC,cACxB;CACb,IAAM,IAAIN,EAAE,MAAM,QACZO,IAAmB,MAAM,KAAK,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,GACrDC,IAAkB,MAAM,KAAK,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;CAC1D,KAAK,IAAMP,KAAKD,EAAE,OAEhB,AADAO,EAAKN,EAAE,OAAO,CAAC,KAAKA,EAAE,MAAM,GAC5BO,EAAIP,EAAE,OAAO,CAAC,KAAKA,EAAE,MAAM;CAG7B,IAAMQ,IAAkB,CAAC,GACnBC,IAAUF,EAAI,KAAK,MAAMf,EAAE,MAAM,GACjCkB,IAAkB,CAAC;CAIzB,KAHAD,EAAQ,SAAS,GAAG,MAAM;EACxB,AAAKE,KAAGD,EAAM,KAAKf,CAAC;CACtB,CAAC,GACMe,EAAM,SAAQ;EACnB,IAAMf,IAAIe,EAAM,MAAM;EACtB,EAAM,KAAKf,CAAC;EACZ,KAAK,IAAM,KAAKW,EAAKX,IAAI,AAAI,EAAEc,EAAQ,OAAO,KAAGC,EAAM,KAAK,CAAC;CAC/D;CACA,IAAME,IAAY,MAAc,CAAC,CAAC,CAAC,KAAK,CAAC;CACzC,KAAK,IAAMjB,KAAKa,GACd,KAAK,IAAM,KAAKF,EAAKX,IAAI,EAAM,KAAK,KAAK,IAAIiB,EAAM,IAAIA,EAAMjB,KAAK,CAAC;CACrE,IAAMkB,IAAa,MAAc,CAAC,CAAC,CAAC,KAAK,CAAC;CAC1C,KAAK,IAAIX,IAAIM,EAAM,SAAS,GAAGN,KAAK,GAAG,KAAK;EAC1C,IAAMP,IAAIa,EAAMN;EAChB,KAAK,IAAMY,KAAKR,EAAKX,IAAI,EAAOA,KAAK,KAAK,IAAIkB,EAAOlB,IAAIkB,EAAOC,KAAK,CAAC;CACxE;CACA,IAAMC,IAAO,KAAK,IAAI,GAAG,GAAGH,CAAK,GAC3BrC,IAAUqC,EAAM,KAAK,GAAG,MAAM;EAClC,QAAQI,GAAR;GACE,KAAK,QACH,OAAOC;GACT,KAAK,SACH,OAAOF,IAAOF,EAAOlB;GACvB,KAAK,UACH,OAAOY,EAAIZ,EAAE,CAAC,SACVsB,IACAX,EAAKX,EAAE,CAAC,SACN,KAAK,IAAI,GAAGW,EAAKX,EAAE,CAAC,KAAK,MAAMiB,EAAME,EAAE,CAAC,IAAI,IAC5C;GACR,SACE,OAAOR,EAAKX,EAAE,CAAC,SAASsB,IAAIF;EAChC;CACF,CAAC;CAID,OAHAhB,EAAE,QAAQ,SAAS,GAAK,MAAM;EAC5B,AAAImB,MAAQ,KAAA,MAAW,EAAQvB,KAAKuB;CACtC,CAAC,GACM3C;AACT,GA0BM4C,KACJ,GACA,GACA,GACA,GACA,GACA,MACG;CACH,IAAMC,KAAU,MAAgBhC,EAAE,KAAK,KAAK,MAAMG,EAAMW,EAAE,GACpDmB,KAAS,MAAgBjC,EAAE,IAAI,KAAK,MAAMG,EAAMW,EAAE,GAElDoB,KAAW,MAAgB;EAE/B,AADAlC,EAAE,KAAK,MAAM,GAAG,MAAMG,EAAMgC,EAAE,CAAC,OAAO,KAAKhC,EAAMiC,EAAE,CAAC,OAAO,EAAE,GAC7DpC,EAAE,IAAI,MAAM,GAAG,MAAMG,EAAMgC,EAAE,CAAC,OAAO,KAAKhC,EAAMiC,EAAE,CAAC,OAAO,EAAE;CAC9D,GAEMC,KAAa,GAAkB,MAAqB;EACxD,IAAIC,IAAIjC,EAAO,MAAOA,EAAO,KAAK,SAAS,KAAKkC,IAAM;EACtD,KAAK,IAAM3B,KAAKoB,EAAO3B,CAAM,GAAG;GAC9B,IAAIO,EAAE,WAAWN,GAAQ;GACzB,KAAKM,EAAE,QAAQ2B;EACjB;EACA,KAAK,IAAM3B,KAAKqB,EAAM3B,CAAM,GAAG;GAC7B,IAAIM,EAAE,WAAWP,GAAQ;GACzB,KAAKO,EAAE;EACT;EACA,OAAO0B;CACT,GACME,KAAa,GAAkB,MAAqB;EACxD,IAAIF,IAAIhC,EAAO,MAAOA,EAAO,IAAI,SAAS,KAAKiC,IAAM;EACrD,KAAK,IAAM3B,KAAKqB,EAAM3B,CAAM,GAAG;GAC7B,IAAIM,EAAE,WAAWP,GAAQ;GACzB,KAAKO,EAAE,QAAQ2B;EACjB;EACA,KAAK,IAAM3B,KAAKoB,EAAO3B,CAAM,GAAG;GAC9B,IAAIO,EAAE,WAAWN,GAAQ;GACzB,KAAKM,EAAE;EACT;EACA,OAAO0B;CACT,GACMG,KAAQ,GAAmB,GAAW,GAAc,MAAkB;EAC1E,KAAK,IAAIlC,IAAIT,GAAMS,IAAImC,EAAM,QAAQ,KAAK;GACxC,IAAM,IAAIA,EAAMnC,IACVoC,KAAML,IAAI,EAAE,MAAMM;GAKxB,AAJID,IAAK,SACP,EAAE,MAAMA,GACR,EAAE,MAAMA,IAEV,IAAI,EAAE,KAAKJ;EACb;CACF,GACMM,KAAM,GAAmB,GAAW,GAAc,MAAkB;EACxE,KAAK,IAAItC,IAAIT,GAAMS,KAAK,GAAG,KAAK;GAC9B,IAAM,IAAImC,EAAMnC,IACVoC,KAAM,EAAE,KAAKL,KAAKM;GAKxB,AAJID,IAAK,SACP,EAAE,MAAMA,GACR,EAAE,MAAMA,IAEV,IAAI,EAAE,KAAKJ;EACb;CACF,GACMO,KAAW,GAAmB,MAAkB;EACpD,IAAMC,IAAML,EAAM,UAAU,GACtBM,IAAUN,EAAMK;EACtB,AAAKC,MACLH,EAAGH,GAAOM,EAAQ,KAAKT,GAAIQ,IAAM,GAAGH,CAAK,GACzCH,EAAKC,GAAOM,EAAQ,KAAKT,GAAIQ,IAAM,GAAGH,CAAK,GAC3CC,EAAGH,GAAOO,GAAQP,EAAM,SAAS,GAAGE,CAAK,GACzCH,EAAKC,GAAOQ,GAAK,GAAGN,CAAK;CAC3B,GACMO,KAAO,GAAa,MAAgBhB,EAAE,KAAKC,EAAE;CAGnD,KAAK,IAAMM,KAASvD,GAAS;EAC3B,IAAImD,IAAIY;EACR,KAAK,IAAM,KAAKR,GAAO;GACrB,IAAMU,IAAI,EAAE,KAAK,EAAE;GAGnB,AAFA,EAAE,KAAKd,GACP,EAAE,KAAKA,IAAIc,GACX,IAAI,EAAE,KAAKb;EACb;EACA,IAAMc,KAASJ,IAASX,IAAIC,MAAOG,EAAM,SAAS;EAClD,EAAM,SAAS,GAAG,MAAM;GAEtB,AADA,EAAE,MAAMW,KAAS9C,IAAI,IACrB,EAAE,MAAM8C,KAAS9C,IAAI;EACvB,CAAC;CACH;CACA,KAAK,IAAMmC,KAASvD,GAAS,EAAM,QAAQ+C,CAAO;CAElD,KAAK,IAAIoB,IAAK,GAAGA,IAAKC,GAAY,KAAM;EACtC,IAAMX,IAAiB,OAAMU,GACvBE,IAAO,KAAK,IAAI,IAAIZ,IAAQU,IAAK,KAAKC,CAAU;EAEtD,KAAK,IAAIE,IAAItE,EAAQ,SAAS,GAAGsE,KAAK,GAAG,KAAK;GAC5C,IAAMf,IAAQvD,EAAQsE;GACtB,KAAK,IAAMzD,KAAK0C,GAAO;IACrB,IAAIJ,IAAI,GACJoB,IAAI;IACR,KAAK,IAAM9C,KAAKoB,EAAOhC,CAAC,GAAG;KACzB,IAAM2D,IAAI/C,EAAE,SAASA,EAAE,OAAO,MAAMZ,EAAE;KAEtC,AADA,KAAKwC,EAAUxC,GAAGY,EAAE,MAAM,IAAI+C,GAC9B,KAAKA;IACP;IACA,IAAI,EAAED,IAAI,IAAI;IACd,IAAMf,KAAML,IAAIoB,IAAI1D,EAAE,MAAM4C;IAG5B,AAFA,EAAE,MAAMD,GACR,EAAE,MAAMA,GACRT,EAAQlC,CAAC;GACX;GAEA,AADA0C,EAAM,KAAKS,CAAG,GACdL,EAAQJ,GAAOc,CAAI;EACrB;EAEA,KAAK,IAAIC,IAAI,GAAGA,IAAItE,EAAQ,QAAQ,KAAK;GACvC,IAAMuD,IAAQvD,EAAQsE;GACtB,KAAK,IAAMzD,KAAK0C,GAAO;IACrB,IAAIJ,IAAI,GACJoB,IAAI;IACR,KAAK,IAAM9C,KAAKqB,EAAMjC,CAAC,GAAG;KACxB,IAAM2D,IAAI/C,EAAE,SAASZ,EAAE,MAAMY,EAAE,OAAO;KAEtC,AADA,KAAKyB,EAAUzB,EAAE,QAAQZ,CAAC,IAAI2D,GAC9B,KAAKA;IACP;IACA,IAAI,EAAED,IAAI,IAAI;IACd,IAAMf,KAAML,IAAIoB,IAAI1D,EAAE,MAAM4C;IAG5B,AAFA,EAAE,MAAMD,GACR,EAAE,MAAMA,GACRT,EAAQlC,CAAC;GACX;GAEA,AADA0C,EAAM,KAAKS,CAAG,GACdL,EAAQJ,GAAOc,CAAI;EACrB;CACF;CACA,KAAK,IAAMd,KAASvD,GAAS,EAAM,QAAQ+C,CAAO;AACpD,GAEM0B,IAAY,GACZC,IAAa,IAENC,KACX,GACA,MACiB;CACjB,IAAM,EAAE,UAAO,SAAM,YAAS,cAAWL,GACnC9C,IAAI3B,EAAcM,CAAC,GACnByE,IAAOtD,EAASE,CAAC,GACjBX,IAAIW,EAAE,MAAM,QACZqD,IAAUrD,EAAE,MAAM,KAAK,MAC3BK,EAAO,IAAI,EAAE,MAAM,KAAKA,EAAO,IAAI,EAAE,MAAM,IAAI,IAAI,EAAE,KACvD,GACMiD,IAAQD,EAAQ,KAAK,GAAG,MAAM,KAAK,IAAI,GAAGP,EAAE,MAAMM,EAAKjD,IAAIY,CAAC,CAAC,CAAC;CACpE,IAAIwC,EAAID,CAAK,KAAK,MAAM,OAAOE,EAAYV,CAAC;CAE5C,IAAMW,IAAWnD,EAAcN,GAAGrB,EAAE,KAAK,GACnC+E,IAAU,MAAcrE,CAAC,CAAC,CAAC,KAAK,CAAC,GACjCsE,IAAW,MAActE,CAAC,CAAC,CAAC,KAAK,CAAC,GAClCuE,IAAU,MAAcvE,CAAC,CAAC,CAAC,KAAK,CAAC,GACjCwE,IAAW,MAAcxE,CAAC,CAAC,CAAC,KAAK,CAAC;CACxC,EAAE,MAAM,SAAS,GAAG,MAAM;EAIxB,AAHA,EAAK,EAAE,WAAWgE,EAAQlD,IAC1B,EAAI,EAAE,WAAWkD,EAAQlD,IACzB,EAAK,EAAE,WAAWmD,EAAMnD,IACxB,EAAI,EAAE,WAAWmD,EAAMnD;CACzB,CAAC;CAGD,IAAM2D,IAA4B9D,EAAE,MAAM,KAAK,GAAG,MAAM;EACtD,IAAM+D,IAAQ,KAAK,IAAIH,EAAIhE,IAAIiE,EAAKjE,EAAE;EACtC,OAAOmE,IAAQ,OACX;GACE;GACA,KAAKN,EAAS7D;GACd;GACA,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,MAAM,CAAC;GACP,KAAK,CAAC;EACR,IACA;CACN,CAAC,GACKoE,IAAO,CACX,GAAG,IAAI,IAAIF,EAAK,QAAQ,MAAMrE,CAAC,CAAC,CAAC,KAAK,MAAOA,EAAe,GAAG,CAAC,CAClE,CAAC,CAAC,MAAM,GAAG,MAAM+B,IAAIC,CAAC,GAChBwC,IAAO,IAAI,IAAID,EAAK,KAAK,GAAK,MAAM,CAAC7C,GAAKhB,CAAC,CAAC,CAAC,GAC7C3B,IAAwBwF,EAAK,UAAU,CAAC,CAAC;CAC/C,KAAK,IAAMvE,KAAKqE,GACd,AAAIrE,MACF,EAAE,MAAMwE,EAAK,IAAIxE,EAAE,GAAG,KAAK,GAC3BjB,EAAQiB,EAAE,IAAI,CAAC,KAAKA,CAAC;CAEzB,IAAMD,IAAoB,CAAC;CAC3B,EAAE,MAAM,SAAS,GAAG,MAAM;EACxB,IAAME,IAASoE,EAAK,EAAE,SAChBnE,IAASmE,EAAK,EAAE;EACtB,AAAI,CAACpE,KAAU,CAACC,KAAU2D,EAAMnD,MAAM,SACtCT,EAAO,KAAK,KAAKF,EAAM,MAAM,GAC7BG,EAAO,IAAI,KAAKH,EAAM,MAAM,GAC5BA,EAAM,KAAK;GACT;GACA;GACA;GACA,OAAO8D,EAAMnD;GACb,OAAO;GACP,IAAI;GACJ,IAAI;EACN,CAAC;CACH,CAAC;CAGD,IAAM+D,IAAYC,EAAMC,EAAOzF,EAAE,WAAW,EAAE,GAAG,GAAG,EAAE,GAChD0F,IAAQ7F,EAAQ,QAChB+D,IAAM+B,EAAK,IAAI,GACfhC,IAASgC,EAAK,IAAIA,EAAK,SAAS,GAChCxD,IAAS,KAAK,IAAI,GAAGwB,IAASC,CAAG,GACjCgC,IAAW,KAAK,IAAI,GAAG,GAAG/F,EAAQ,KAAK,MAAQ2C,EAAI,MAAM,CAAC,GAC1DS,IAAK,KAAK,IACd,KAAK,IAAI,GAAGwC,EAAOzF,EAAE,aAAa,EAAE,CAAC,GACrC4F,IAAW,IAAKzD,IAAS,MAAQyD,IAAW,KAAK,QACnD,GACMC,IAAK,KAAK,IACd,GAAGhG,EAAQ,KACR,OACEsC,KAAUK,EAAI,SAAS,KAAKS,KAC7B,KAAK,IAAI,MAAM2B,EAAIpC,EAAI,KAAK,MAAM1B,EAAE,KAAK,CAAC,CAAC,CAC/C,CACF,GACMgF,IAAOJ,IAAQ,KAAKC,EAAK,QAAQJ,MAAcG,IAAQ,KAAK;CAClE,EAAQ,SAAS,GAAK,MAAM;EAC1B,IAAMK,IACJL,IAAQ,IAAIC,EAAK,IAAInE,IAAIsE,IAAOH,EAAK,KAAKA,EAAK,QAAQJ,KAAa;EACtE,KAAK,IAAMzE,KAAK0B,GAId,AAHA,EAAE,KAAKuD,GACP,EAAE,KAAKA,IAAKR,GACZ,EAAE,KAAK,GACP,EAAE,KAAKzE,EAAE,QAAQ+E;CAErB,CAAC;CACD,KAAK,IAAM,KAAKhF,GAAO,EAAE,QAAQ,EAAE,QAAQgF;CAC3C,EACEhG,GACAgB,GACA+C,GACAD,GACAV,GACA,KAAK,MAAMuC,EAAMC,EAAOzF,EAAE,YAAY,EAAE,GAAG,GAAG,GAAG,CAAC,CACpD;CAEA,KAAK,IAAMwC,KAAO3C,GAChB,KAAK,IAAMiB,KAAK0B,GAAK;EACnB,IAAIQ,IAAIlC,EAAE;EACV,KAAK,IAAMU,KAAKV,EAAE,MAEhB,AADA,EAAMU,EAAE,CAAC,KAAKwB,IAAInC,EAAMW,EAAE,CAAC,QAAQ,GACnC,KAAKX,EAAMW,EAAE,CAAC;EAEhB,IAAIV,EAAE;EACN,KAAK,IAAMU,KAAKV,EAAE,KAEhB,AADA,EAAMU,EAAE,CAAC,KAAKwB,IAAInC,EAAMW,EAAE,CAAC,QAAQ,GACnC,KAAKX,EAAMW,EAAE,CAAC;CAElB;CAIF,IAAMwE,IADiB3E,EAAE,MAAM,KAAK,GAAG,MAAM8C,EAAE,MAAM9C,EAAE,OAAOJ,IAAIA,CAAC,CACvD,CAAA,CAAO,KAAK,MAAQgF,EAAMzD,CAAG,CAAC,GACpC0D,KAAUC,EAAIC,EAAM,MAAMA,EAAM,WAAW,GAAI,GAC/CC,IAAOrG,EAAE,aAAa,YACtBsG,IAAUd,EAAMC,EAAOzF,EAAE,aAAa,EAAG,GAAG,KAAM,CAAC,GACnDuG,KAAc,KAAK,IAAI,GAAGD,IAAU,EAAG,GAEvClD,IAAqB,CAAC,GACtBoD,IAAqB,CAAC,GACtBC,KAAa,MAAgB/F,IAAIW,EAAE,MAAM,EAAE,EAAE,CAAC,MAC9CqF,KAAW,MAAgB,CAC/B,GAAG5F,EAAE,IAAI,KAAK,MAAM2F,EAAU5F,EAAMW,EAAE,CAAC,GACvC,GAAGV,EAAE,KAAK,KAAK,MAAM2F,EAAU5F,EAAMW,EAAE,CAAC,CAC1C,GAGMmF,KAAQ9F,EAAM,MAAM,CAAC,CAAC,MAAM,GAAG,MAAMiC,EAAE,QAAQD,EAAE,KAAK;CAC5D,KAAK,IAAM,KAAK8D,IAAO;EACrB,IAAMC,IAAMvF,EAAE,MAAM,EAAE,EAAE,CAAC,OACrBwF,GACAC;EASJ,AARIF,IAAK,IAAK,IAAKX,EAAM9B,EAAE,MAAMyC,GAAK,EAAE,OAAO,CAAC,CAAC,IACxCP,MAAS,WAAU,IAAK,IAAKL,EAAI,EAAE,OAAO,KAC1CK,MAAS,WAAU,IAAK,IAAKL,EAAI,EAAE,OAAO,KAC1CK,MAAS,YAAW,IAAK,IAAKJ,EAAMC,EAAO,KAElD,IAAKF,EAAI,EAAE,OAAO,IAClB,IAAKA,EAAI,EAAE,OAAO,KAEpB5C,EAAM,KAAK;GACT,MAAM;GACN,IAAI,EAAE,OAAO;GACb,IAAI,EAAE;GACN,IAAI,EAAE,OAAO;GACb,IAAI,EAAE;GACN,OAAO,EAAE;GACT,QAAQyD;GACR,QAAQC;GACR,OAAOR;GACP;GACA,KAAKG,EAAU,CAAC;GAChB,MAAM,CAAC,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC;EAC/B,CAAC;CACH;CAGA,KAAK,IAAMjE,KAAO3C,GAChB,KAAK,IAAMiB,KAAK0B,GACd,EAAM,KAAK;EACT,MAAM;EACN,GAAG1B,EAAE;EACL,GAAGA,EAAE;EACL,OAAOA,EAAE,KAAKA,EAAE;EAChB,QAAQ,KAAK,IAAI,GAAGA,EAAE,KAAKA,EAAE,EAAE;EAC/B,QAAQ,KAAK,IAAI,GAAGyE,IAAY,CAAC;EACjC,MAAMS,EAAIlF,EAAE;EACZ,KAAKA,EAAE;EACP,MAAM4F,EAAQ5F,CAAC;EACf,UAAU;CACZ,CAAC;CAGL,IAAId,EAAE,WAAW,IAAO;EACtB,IAAM+G,IAAWC,EAAKZ,GAAO,IAAI,GAAG,GAC9Ba,IAAYD,EAAKZ,GAAO,EAAE,GAC1Bc,IAAOjB,EAAMG,EAAM,YAAY,EAAG,GAClCe,IAA8D,CAAC,GAC/DC,IACJ1B,IAAQ,IAAI,KAAK,IAAI,GAAGI,IAAOP,IAAY,EAAa,IAAII,EAAK,OAE7D7D,IAAQjC,EACX,KAAK,CAAC,CACN,MAAM,CAAC,CACP,MACE,GAAG,MACF,OAAOiD,EAAE,QAAQ4C,IAAQ,CAAC,IAAI,OAAO7C,EAAE,QAAQ6C,IAAQ,CAAC,KACxD5C,EAAE,QAAQD,EAAE,KAChB;EACF,KAAK,IAAM/B,KAAKgB,GAAO;GACrB,IAAMO,IAAOqD,IAAQ,KAAK5E,EAAE,QAAQ4E,IAAQ,GACxCN,IACFpF,EAAE,gBAAgB,KAAQ,KAAKmE,EAAE,OAAO,KAAK,IAAIY,EAAIjE,EAAE,IAAIkE,EAAKlE,EAAE,EAAE,CAAC,GACnEuG,IAASjC,IAAQkC,EAAQlC,GAAO6B,CAAS,IAAI,GAC7CM,IAAOC,EACTnG,EAAE,MAAMP,EAAE,IACVsG,KAAQhC,IAAQiC,IAAS,IAAI,IAC7BN,GACAO,CACF;GAMA,IALI,CAACC,KAAQnC,MACX,IAAQ,IACR,IAAS,GACT,IAAOoC,EAAUnG,EAAE,MAAMP,EAAE,IAAIsG,GAAML,GAAUO,CAAO,IAEpD,CAACC,GAAM;GAEX,IAAME,IADQH,EAAQC,GAAMR,CACd,KAAS3B,IAAQ,IAAIiC,IAAS,IAGtCK,IAAQrF,IAAO,CAAC,IAAM,EAAK,IAAI,CAAC,IAAO,EAAI,GAC3CsF,IAAQ,KAAK,IAAI,IAAI7G,EAAE,KAAKA,EAAE,MAAM,IAAIyD,IAAa,IAAI,CAAC,GAC1DqD,IAAU,CAAC,CAAC;GAClB,KAAK,IAAIrF,IAAI,GAAGA,KAAKoF,GAAO,KAAK,GAAG,EAAQ,KAAKpF,GAAG,CAACA,CAAC;GACtD,IAAIsF,IAAiE;GACrE,KAAK,IAAMC,KAAQJ,GAAO;IACxB,IAAMK,IAAID,IAAOhH,EAAE,KAAKwD,IAAYxD,EAAE,KAAKwD,GACrCyB,IAAK+B,IAAOC,IAAIN,IAAQM;IAC9B,IAAI,MAAKpC,EAAK,IAAI,KAAKI,IAAK0B,IAAQ9B,EAAK,IAAIA,EAAK,QAAQ,IAC1D;UAAK,IAAMtC,KAAMuE,GAAS;MACxB,IAAM5E,KAAKlC,EAAE,KAAKA,EAAE,MAAM,IAAIuC,GACxB2E,IAAY;OAChB;OACA,IAAIjC,IAAK0B;OACT,IAAIzE,IAAIuB,IAAa;OACrB,IAAIvB,IAAIuB,IAAa;MACvB;MACA,IACE,IAAU,KAAKoB,EAAK,IAAI,KACxBqC,EAAU,KAAKrC,EAAK,IAAIA,EAAK,SAAS,KACtCwB,EAAM,MACH,MACCrE,EAAE,KAAKkF,EAAU,MACjBA,EAAU,KAAKlF,EAAE,MACjBA,EAAE,KAAKkF,EAAU,MACjBA,EAAU,KAAKlF,EAAE,EACrB,IAGF;WAAMkF;OACN;MADM;KAER;KACA,IAAIH,GAAK;IADT;GAEF;GACA,IAAI,CAACA,GAAK;GACV,EAAM,KAAKA,CAAG;GACd,IAAM7E,KAAK6E,EAAI,KAAKA,EAAI,MAAM,GACxBI,IAAOvB,EAAQ5F,CAAC;GActB,AAbAsC,EAAM,KAAK;IACT,MAAM;IACN,GAAGyE,EAAI;IACP;IACA,MAAMN;IACN,MAAMR;IACN,OAAOd,EAAMG,EAAM,IAAI;IACvB,OAAO;IACP,UAAU;IACV;IACA,KAAKtF,EAAE;IACP;GACF,CAAC,GACGsE,KACFhC,EAAM,KAAK;IACT,MAAM;IACN,GAAGyE,EAAI;IACP;IACA,MAAMzC;IACN,MAAM6B;IACN,OAAOhB,EAAMG,EAAM,SAAS;IAC5B,OAAO;IACP,UAAU;IACV;IACA,KAAKtF,EAAE;IACP;GACF,CAAC;EACL;CACF;CAGA,IAAMoH,IAAWtD,EAAIvD,EAAE,MAAM,KAAK,GAAG,MAAO0D,EAAI9D,MAAM,IAAI+D,EAAK/D,KAAK,CAAE,CAAC;CACvE,KAAK,IAAMuB,KAAO3C,GAChB,KAAK,IAAMiB,KAAK0B,EAAI,MAAM,CAAC,CAAC,MAAM,GAAG,MAAMK,EAAE,KAAKC,EAAE,EAAE,GAAG;EACvD,IAAMsC,IAAQ,KAAK,IAAIL,EAAIjE,EAAE,IAAIkE,EAAKlE,EAAE,EAAE;EAC1C,IAAIsE,KAAS,GAAG;EAChB,IAAM+C,IAAUD,IAAW,IAAI9C,IAAQ8C,IAAW;EAClD,EAAM,KAAK;GACT,OAAOpH,EAAE;GACT,MAAMO,EAAE,MAAMP,EAAE;GAChB;GACA;GACA,OAAOqD,EAAE,QAAQgE,CAAO;GACxB,OAAOnC,EAAIlF,EAAE;GACb,IAAIA,EAAE,KAAKA,EAAE,MAAM;GACnB,IAAIA,EAAE,KAAKA,EAAE,MAAM;GACnB,MAAM;IACJ;KAAE,MAAMqD,EAAE,OAAO;KAAO,OAAOA,EAAE,OAAOiB,CAAK;IAAE;IAC/C,GAAIL,EAAIjE,EAAE,KAAK,IACX,CAAC;KAAE,MAAMqD,EAAE,OAAO;KAAU,OAAOA,EAAE,OAAOY,EAAIjE,EAAE,EAAE;IAAE,CAAC,IACvD,CAAC;IACL,GAAIkE,EAAKlE,EAAE,KAAK,IACZ,CAAC;KAAE,MAAMqD,EAAE,OAAO;KAAU,OAAOA,EAAE,OAAOa,EAAKlE,EAAE,EAAE;IAAE,CAAC,IACxD,CAAC;GACP;EACF,CAAC;CACH;CACF,IAAMsH,KAAYvH,EACf,MAAM,CAAC,CACP,MACE,GAAG,MACFgC,EAAE,OAAO,MAAMC,EAAE,OAAO,OAAOD,EAAE,KAAKC,EAAE,MAAMD,EAAE,OAAO,KAAKC,EAAE,OAAO,EACzE;CACF,KAAK,IAAM,KAAKsF,IAAW;EACzB,IAAMC,IAAKhH,EAAE,MAAM,EAAE,IACf+D,IAAQV,EAAQ,EAAE;EACxB,IAAIU,KAAS,GAAG;EAChB,IAAMrE,IAASM,EAAE,MAAMgH,EAAG,SACpBrH,IAASK,EAAE,MAAMgH,EAAG,SACpBC,IAAWtD,EAAKqD,EAAG,UAAU,IAAIjD,IAAQJ,EAAKqD,EAAG,UAAU,GAC3DE,IAAWxD,EAAIsD,EAAG,UAAU,IAAIjD,IAAQL,EAAIsD,EAAG,UAAU;EAC/D,EAAM,KAAK;GACT,OAAO5B,EAAU,CAAC;GAClB,MAAM,GAAG1F,EAAO,UAAUC;GAC1B;GACA,SAASsH;GACT,OAAOnE,EAAE,QAAQmE,CAAQ;GACzB,OAAOtC,EAAIqC,EAAG;GACd,IAAI,EAAE,OAAO,KAAK,EAAE,OAAO,MAAM;GACjC,IAAI,EAAE,KAAK,EAAE,MAAM;GACnB,MAAM;IACJ;KAAE,MAAMlE,EAAE,OAAO;KAAO,OAAOA,EAAE,OAAOiB,CAAK;IAAE;IAC/C;KACE,MAAMoD,EAAYrE,EAAE,OAAO,QAAQ,EAAE,MAAMpD,EAAO,CAAC;KACnD,OAAOoD,EAAE,QAAQmE,CAAQ;IAC3B;IACA;KACE,MAAME,EAAYrE,EAAE,OAAO,QAAQ,EAAE,MAAMnD,EAAO,CAAC;KACnD,OAAOmD,EAAE,QAAQoE,CAAQ;IAC3B;GACF;GACA,OAAO;IAAE;IAAQ;GAAO;EAC1B,CAAC;CACH;CAEA,IAAME,IAAQjD,EAAMrB,EAAE,OAAO,GAAG,CAAC;CACjC,OAAO;EACL;EACA;EACA,KAAK;EACL,OAAO;EACP,GAAIsE,IAAQ,IACR,EACE,OAAO;GACL,OAAOA;GACP,OAAO,MAAO,MAAOA;GACrB,IAAI9C,EAAK,IAAIA,EAAK,QAAQ;GAC1B,IAAIA,EAAK,IAAIA,EAAK,SAAS;EAC7B,EACF,IACA,CAAC;CACP;AACF"}

package/dist/native/charts/src/engine/shapes/scene.cjs

@@ -0,0 +1,2 @@
+const e=require("../color.cjs"),t=require("../overlay.cjs");var n=Math.PI*2,r=(e,t)=>{let n=/(\d+(?:\.\d+)?)px/.exec(t);return e.length*(n?Number(n[1]):12)*.6},i=(e,t,n)=>e<t?t:e>n?n:e,a=e=>typeof e==`number`&&Number.isFinite(e)&&e>0?e:0,o=(e,t=0)=>typeof e==`number`&&Number.isFinite(e)?e:t,s=e=>{let t=0;for(let n of e)t+=n;return t},c=e=>1-(1-i(e,0,1))**3,l=e=>{let t=e%n;return t>Math.PI&&(t-=n),t<=-Math.PI&&(t+=n),t>Math.PI/2?t-=Math.PI:t<=-Math.PI/2&&(t+=Math.PI),t},u=(e,t)=>{let n=t?.top??8,r=t?.right??8,i=t?.bottom??8,a=t?.left??8;return{x:e.x+a,y:e.y+n,width:Math.max(0,e.width-a-r),height:Math.max(0,e.height-n-i)}},d=(e,t,n,r)=>{if(r(e,n)<=t)return e;if(r(`…`,n)>t)return``;let i=0,a=e.length;for(;i<a;){let o=i+a+1>>1;r(e.slice(0,o)+`…`,n)<=t?i=o:a=o-1}return i?e.slice(0,i).trimEnd()+`…`:``},f=/^[)\]}、。，．：；！？）」』】》〉,.:;!?%…]/,p=(e,t,n,r)=>{let i=[],a=e.trim();for(;a;){if(r(a,n)<=t){i.push(a);break}let e=0,o=a.length;for(;e<o;){let i=e+o+1>>1;r(a.slice(0,i),n)<=t?e=i:o=i-1}if(!e)return null;let s=e;if(a[e]!==` `){let t=a.lastIndexOf(` `,e);if(t>e*.4)s=t;else for(;s>1&&f.test(a.slice(s));)s--}i.push(a.slice(0,s).trimEnd()),a=a.slice(s).trimStart()}return i},m=(e,t,n,r,i=2)=>{let a=e.trim();if(!a||i<1)return[];let o=p(a,t,n,r);if(!o){let e=d(a,t,n,r);return e?[e]:[]}if(o.length>i){let e=o.slice(0,i-1),s=a;for(let t of e)s=s.slice(t.length).trimStart();let c=d(s,t,n,r);return c?[...e,c]:e}if(o.length<2)return o;let s=r(a,n)/o.length;for(let e=0;e<=8;e++){let i=p(a,s+(t-s)*e/8,n,r);if(i&&i.length<=o.length)return i}return o},h=e=>{let t=new Map;return e.map(e=>{let n=(t.get(e)??0)+1;return t.set(e,n),n===1?e:`${e}#${n}`})},g=[1,1,1,.96],_=[15/255,23/255,42/255,.88],v=e=>e<=.04045?e/12.92:((e+.055)/1.055)**2.4,y=e=>.2126*v(e[0])+.7152*v(e[1])+.0722*v(e[2]),b=(e,t)=>{let n=i(e[3],0,1);return[e[0]*n+t[0]*(1-n),e[1]*n+t[1]*(1-n),e[2]*n+t[2]*(1-n),1]},x=(e,t)=>{let n=y(b(e,t)),r=y(t);return(Math.max(n,r)+.05)/(Math.min(n,r)+.05)},S=[1,1,1,1],C=(t,n=S)=>{let r=b(t,b(n,S)),i=x(g,r),a=x(_,r);return i>=a?{ink:g,css:e.toCss(g),contrast:i}:{ink:_,css:e.toCss(_),contrast:a}},w=(e,t)=>C(e,t).css,T=(t,n=4.5,r=.3)=>{let i=C(t);if(i.contrast>=n)return t;let a=i.ink===g?[0,0,0,t[3]]:[1,1,1,t[3]];for(let o=.04;o<=r+1e-9;o+=.04){let r=e.mix(t,a,o);if(i=C(r),i.contrast>=n)return r}return e.mix(t,a,r)},E=(t,n,r)=>n?t.resolve?t.resolve(n,r):e.parseColor(n)??r:r,D=r=>{let{area:i,theme:a}=r,o=i.x+i.width/2,s=i.y+i.height/2,c=Math.max(0,Math.min(i.width,i.height)/2-6);return{nodes:[{kind:`sector`,cx:o,cy:s,r0:c*.66,r1:c,a0:0,a1:n,pad:0,corner:0,fill:e.toCss(a.grid,.8)},{kind:`text`,x:o,y:s,text:r.labels.noData,font:t.font(a,12),color:e.toCss(a.textMuted),align:`center`,baseline:`middle`}],items:[],dim:1,empty:!0}};exports.TAU=n,exports.clamp=i,exports.contrastRatio=x,exports.easeOutCubic=c,exports.ellipsize=d,exports.emptyLayout=D,exports.estimateText=r,exports.finite=o,exports.inkOn=C,exports.inset=u,exports.over=b,exports.positive=a,exports.readableFill=T,exports.relativeLuminance=y,exports.resolveWith=E,exports.sum=s,exports.textOn=w,exports.uniqueKeys=h,exports.upright=l,exports.wrapText=m;
+//# sourceMappingURL=scene.cjs.map