|
JIDE 3.5.15 | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface Algorithm
The interface for all treemap layout algorithms. If you write your own algorithm, it should conform to this interface.
| Method Summary | ||
|---|---|---|
boolean |
doLayout(Shape shape,
MutableTreeMapNode parent,
MutableTreeMapNode[] children,
double sumSizes,
TreeMapWorker worker)
Arrange the items in the given array to fill the given rectangle. |
|
|
finishLayout(Rectangle2D bounds,
TreeMapModel<N> model,
N root)
Finish the layout after doLayout has completed. |
|
|
iterator(TreeMapModel<N> model,
N root)
Controls the order by which the tree should be traversed. |
|
|
startLayout(Rectangle2D bounds,
TreeMapModel<N> model,
N root,
TreeMapWorker worker)
Start the layout before doLayout is initiated. |
|
| Method Detail |
|---|
<N> Iterable iterator(TreeMapModel<N> model,
N root)
model - the modelroot - the root node
<N> void startLayout(Rectangle2D bounds,
TreeMapModel<N> model,
N root,
TreeMapWorker worker)
bounds - the bounds of the viewmodel - the modelroot - the root nodeworker -
boolean doLayout(Shape shape,
MutableTreeMapNode parent,
MutableTreeMapNode[] children,
double sumSizes,
TreeMapWorker worker)
shape - the current rectangle being divided.parent - the parent node.children - the items to map.sumSizes - the size of the parent.worker - the worker thread
<N> void finishLayout(Rectangle2D bounds,
TreeMapModel<N> model,
N root)
bounds - the bounds of the viewmodel - the modelroot - the root node
|
JIDE 3.5.15 | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||