Two shapes of their own. A tree needs nesting and has no value field. A Sankey needs an edge list.
Three partition charts, one identical array. These three are
handed the same children hierarchy, byte for byte. What
separates them is chart.type and nothing else.