TreeMap.TreeMap

A Treemap is a compact two dimensional representation of the "weigth" of Nodes to each other. Each Node has a weight 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;

int delta;

this(Node root, int delta);

TreeMap layout(Rect rect, int depth);

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

Maybe findFor(double x, double y);

Maybe findFor(double x, double y, Node n);

Rect* get(Node n);

}

Constructors

this this(Node root, int delta): Undocumented in source.

Members

Aliases

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

Functions

findFor Maybe findFor(double x, double y): Finds the deepest Node that contains the given position. @return Maybe!Node @see Unittest on how to use it.
findFor Maybe findFor(double x, double y, Node n): Undocumented in source. Be warned that the author may not have intended to support it.
get Rect* get(Node n): @param n which rect to return. @return the Rect of the given Node.
layout TreeMap layout(Rect rect, int depth): Layouts the treemap for a Rect.

Variables

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