Algorithm
interface Algorithm
The interface for all treemap layout algorithms. If you write your own algorithm, it should conform to this interface.
Inheritors
Properties
Functions
Link copied to clipboard
abstract fun <N, Row, Column> breadthFirstLayout(shape: Shape, parent: N, children: Array<N>, sumSizes: Double, horizontalVanishingPoint: Int, verticalVanishingPoint: Int, accessor: TreeMapAccessor<N>, worker: TreeMapWorker?): Boolean
Arrange the items in the given array to fill the given shape. This is called during the first pass, while traversing the tree top down.
Link copied to clipboard
abstract fun <N, Row, Column> depthFirstLayout(shape: Shape?, parent: N, children: Array<N>, sumSizes: Double, horizontalVanishingPoint: Int, verticalVanishingPoint: Int, accessor: TreeMapAccessor<N>, worker: TreeMapWorker?): Boolean
Arrange the items in the given array to fill the given shape. This is called during the first pass, while traversing the tree from the bottom up.
Link copied to clipboard
abstract fun <N, Row, Column> finishLayout(bounds: Rectangle2D?, model: TreeMapModel<N, Row, Column>?, root: N)
Finish the layout after breadthFirstLayout has completed.
Link copied to clipboard
Indicates whether the layout algorithm can handle the given geometry of its parent
Link copied to clipboard
abstract fun <N, Row, Column> startLayout(bounds: Rectangle2D?, model: TreeMapModel<N, Row, Column>, root: N, worker: TreeMapWorker?)
Start the layout before breadthFirstLayout is initiated.