net.sf.jtreemap.swing

Class SplitStrategy

java.lang.Object

net.sf.jtreemap.swing.SplitStrategy

All Implemented Interfaces:

Serializable

Direct Known Subclasses:

SplitByNumber, SplitBySlice, SplitBySortedWeight, SplitByWeight, SplitSquarified

public abstract class SplitStrategy
extends Object
implements Serializable

Abtract class with the method which split the elements of a JTreeMap.

The split is done by dichotomy. We split the elements in 2 groups with a defined strategy (for example : take care of the weight of the elements)

Author:

Laurent Dutheil

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
SplitStrategy()

Method Summary

Modifier and Type	Method and Description
void	calculatePositions(TreeMapNode root) calculate the positions for all the elements of the root.
protected void	calculatePositionsRec(int x0, int y0, int w0, int h0, double weight0, List<TreeMapNode> v)
protected void	sortList(List<TreeMapNode> v) Sort the elements by descending weight.
abstract void	splitElements(List<TreeMapNode> v, List<TreeMapNode> v1, List<TreeMapNode> v2) split the elements of a JTreeMap.
double	sumWeight(List<TreeMapNode> v) Sum the weight of elements.
protected void	workOutWeight(List<TreeMapNode> v1, List<TreeMapNode> v2, List<TreeMapNode> vClone, double sumWeight)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SplitStrategy

public SplitStrategy()

Method Detail

calculatePositions

public void calculatePositions(TreeMapNode root)

calculate the positions for all the elements of the root.

Parameters:

root - the root to calculate

splitElements

public abstract void splitElements(List<TreeMapNode> v,
                                   List<TreeMapNode> v1,
                                   List<TreeMapNode> v2)

split the elements of a JTreeMap.

Parameters:

v - List with the elements to split (arg IN)

v1 - first List of the split (arg OUT)

v2 - second List of the split (arg OUT)

sumWeight

public double sumWeight(List<TreeMapNode> v)

Sum the weight of elements.
You can override this method if you want to apply a coef on the weights or to cancel the effect of weight on the strategy.

Parameters:

v - List with the elements to sum

Returns:

the sum of the weight of elements

calculatePositionsRec

protected void calculatePositionsRec(int x0,
                                     int y0,
                                     int w0,
                                     int h0,
                                     double weight0,
                                     List<TreeMapNode> v)

sortList

protected void sortList(List<TreeMapNode> v)

Sort the elements by descending weight.

Parameters:

v - List with the elements to be sorted

workOutWeight

protected void workOutWeight(List<TreeMapNode> v1,
                             List<TreeMapNode> v2,
                             List<TreeMapNode> vClone,
                             double sumWeight)