Every real node of the series, depth first, in the tree's own order.
Not cheap for its size -- a point per node, the ancestor path copied at
each one, and getValue() asked of every node and every child of it -- so
the caller walks once and hands the result to both the count check and
hierarchyLayer.
The order is the tree's rather than the data's on purpose: measured, a
sunburst reorders its children (B before A, A2 before A1) and paints
them in the reordered order, so a reading that followed the data would
announce the nodes in one order and outline them in another.
Every real node of the series, depth first, in the tree's own order.
Not cheap for its size -- a point per node, the ancestor path copied at each one, and
getValue()asked of every node and every child of it -- so the caller walks once and hands the result to both the count check and hierarchyLayer.The order is the tree's rather than the data's on purpose: measured, a sunburst reorders its children (
BbeforeA,A2beforeA1) and paints them in the reordered order, so a reading that followed the data would announce the nodes in one order and outline them in another.