| 2010-10-29 17:17:29 |
Paul Sladen |
description |
On a milestone graph, such as:
https://launchpad.net/linaro/+series
The presence a single overly-long label causes the graph width to balloon massively: each box is expanded to the width of the longest, the current algorithm is:
max( width(N) )
It would be possible to remain homogeneous (equal spacing/equal width) but with less wastage, by using a spacing of:
max( 0.5*width(N)+0.5*width(N+1) )
before:
----|-------|-------|-------|-------|-------|-------|----
____w____massive____x____massive____y____massive____z____
after:
----|----|----|----|----|----|----|----
____w_massive_x_massive_y_massive_z____ |
On a milestone graph, such as:
https://launchpad.net/linaro/+series
The presence a single overly-long label causes the graph width to balloon massively: each box is expanded to the width of the longest, the current algorithm is:
max( width(N) )
It would be possible to remain homogeneous (equal spacing/equal width) but with less wastage, by using a spacing of:
max( 0.5*width(N)+0.5*width(N+1) )
before:
----|-------|-------|-------|-------|-------|-------|----
____w____massive____x____massive____y____massive____z____
after:
----|----|----|----|----|----|----|----
____w_massive_x_massive_y_massive_z____
(copy and paste into a monospace editor/font) |
|
