TreeMap.TreeMap

A Treemap is a compact two dimensional representation of the "size" of Nodes to each other. Each Node has a size that is used to determine how much space is reserved for this Node when laying the Treemap out on a Rect.

template TreeMap(Node)

class TreeMap {

Rect[Node] treeMap;

Node rootNode;

this(Node root);

TreeMap layout(Rect rect);

alias Maybe = Algebraic!(Node, typeof(null));

Maybe findFor(double x, double y);

Rect get(Node n);

}

Constructors

this this(Node root): Undocumented in source.

Members

Aliases

Maybe alias Maybe = Algebraic!(Node, typeof(null)): Undocumented in source.

Functions

findFor Maybe findFor(double x, double y): Find the Node for a position. @return Maybe!Node @see Unittest on how to use it.
get Rect get(Node n): @param n which rect to return. @return the Rect of the given Node.
layout TreeMap layout(Rect rect): Layouts the treemap for a Rect.

Variables

rootNode Node rootNode;: Undocumented in source.
treeMap Rect[Node] treeMap;: Undocumented in source.