
DIRECTORY
ImagerBox,
ImagerTransformation,
TreeGrapher,
Vector2 USING [VEC];

TreeGrapherImpl: CEDAR PROGRAM
IMPORTS ImagerBox, ImagerTransformation
EXPORTS TreeGrapher
~ BEGIN OPEN TreeGrapher;

Box: TYPE ~ ImagerBox.Box;
VEC: TYPE ~ Vector2.VEC;
Transformation: TYPE ~ ImagerTransformation.Transformation;

PostOrder: PROC [node: Node, each: PROC [Node]] = {
FOR tail: LIST OF Node м node.children, tail.rest UNTIL tail = NIL DO
PostOrder[tail.first, each];
ENDLOOP;
each[node];
};

ForwardT: PROC [lp: LayoutParameters] RETURNS [Transformation] ~ {
RETURN [ImagerTransformation.XYToSF[[
slow: SELECT lp.descendantDirection FROM $N => up, $E => right, $S => down, $W => left, ENDCASE => ERROR,
fast: SELECT lp.siblingDirection FROM $N => up, $E => right, $S => down, $W => left, ENDCASE => ERROR], 0, 0]]
};
XFormBox: PROC [t: Transformation, box: Box] RETURNS [Box] ~ {
RETURN [ImagerBox.BoxFromRectangle[ImagerTransformation.TransformRectangle[t, ImagerBox.RectangleFromBox[box]]]];
};

DoLayout: PUBLIC PROC [root: Node, lp: LayoutParameters] = {
forward: Transformation ~ ForwardT[lp];
reverse: Transformation ~ ImagerTransformation.Invert[forward];
Pass1Each: PROC [node: Node] = {
bounds: Box ~ node.class.bounds[node];
nodeBox: Box м XFormBox[forward, bounds];
childrenSum: REAL м 0.0;
childrenMin: REAL м 1.0E+30;
FOR tail: LIST OF Node м node.children, tail.rest UNTIL tail = NIL DO
childrenSum м childrenSum + (tail.first.layout.treeBox.ymax-tail.first.layout.treeBox.ymin);
IF tail.rest # NIL THEN childrenSum м childrenSum + lp.siblingPad;
childrenMin м MIN[childrenMin, tail.first.layout.treeBox.xmin];
ENDLOOP;
{
childrenDelta: REAL м nodeBox.xmax + lp.descendantPad - childrenMin;
s: REAL м 0.5*((nodeBox.ymax+nodeBox.ymin)-childrenSum);
FOR tail: LIST OF Node м node.children, tail.rest UNTIL tail = NIL DO
s м s + (tail.first.layout.treeBox.ymax-tail.first.layout.treeBox.ymin);
tail.first.layout.origin м [childrenDelta, s-tail.first.layout.treeBox.ymax];
IF tail.rest # NIL THEN s м s + lp.siblingPad;
ENDLOOP;
};
{
treeBox: Box м nodeBox;
FOR tail: LIST OF Node м node.children, tail.rest UNTIL tail = NIL DO
origin: VEC ~ tail.first.layout.origin;
treeBox.xmin м MIN[treeBox.xmin, tail.first.layout.treeBox.xmin + origin.x];
treeBox.xmax м MAX[treeBox.xmax, tail.first.layout.treeBox.xmax + origin.x];
treeBox.ymin м MIN[treeBox.ymin, tail.first.layout.treeBox.ymin + origin.y];
treeBox.ymax м MAX[treeBox.ymax, tail.first.layout.treeBox.ymax + origin.y];
ENDLOOP;
node.layout м NEW[LayoutRep м [origin: [0.0, 0.0], bounds: bounds, treeBox: treeBox]];
};
};
Pass2: PROC [node: Node] = {
FOR tail: LIST OF Node м node.children, tail.rest UNTIL tail = NIL DO
tail.first.layout.origin.x м tail.first.layout.origin.x + node.layout.origin.x;
tail.first.layout.origin.y м tail.first.layout.origin.y + node.layout.origin.y;
Pass2[tail.first];
ENDLOOP;
node.layout.origin м ImagerTransformation.TransformVec[reverse, node.layout.origin];
node.layout.treeBox м XFormBox[reverse, node.layout.treeBox];
};
Pass3Each: PROC [node: Node] = {
o: VEC ~ node.layout.origin;
b: Box ~ node.layout.treeBox;
node.layout.treeBox м [xmin: b.xmin+o.x, ymin: b.ymin+o.y, xmax: b.xmax+o.x, ymax: b.ymax+o.y];
};
PostOrder[root, Pass1Each];
Pass2[root];
PostOrder[root, Pass3Each];
};

Resolve: PUBLIC PROC [root: Node, p: VEC] RETURNS [Node] = {
b: Box ~ root.layout.bounds;
IF ( (p.x-root.layout.origin.x) IN [b.xmin..b.xmax] AND (p.y-root.layout.origin.y) IN [b.ymin..b.ymax]) THEN RETURN [root];
FOR tail: LIST OF Node м root.children, tail.rest UNTIL tail = NIL DO
IF ( p.x IN [tail.first.layout.treeBox.xmin..tail.first.layout.treeBox.xmax] AND p.y IN [tail.first.layout.treeBox.ymin..tail.first.layout.treeBox.ymax] ) THEN {
n: Node м Resolve[tail.first, p];
IF n # NIL THEN RETURN [n];
};
ENDLOOP;
RETURN [NIL]
};

DefaultAttachmentPoint: PUBLIC PROC [self: Node, direction: Direction] RETURNS [VEC] ~ {
b: Box ~ self.layout.bounds;
SELECT direction FROM
$E => RETURN [[b.xmax, 0.5*(b.ymax+b.ymin)]];
$W => RETURN [[b.xmin, 0.5*(b.ymax+b.ymin)]];
$N => RETURN [[0.5*(b.xmax+b.xmin), b.ymax]];
$S => RETURN [[0.5*(b.xmax+b.xmin), b.ymin]];
ENDCASE => ERROR;
};


END.


   И  
TreeGrapherImpl.mesa
Copyright ╙ 1990, 1991 by Xerox Corporation.  All rights reserved.
Michael Plass, July 13, 1990 5:10 pm PDT
Э╩  ХNewlineDelimiter
Ц(cedarcode) styleЩ ЪЬЩJЪЬ
╧eЬ7ЩBJЩ(ЧIcodeШ Ъ╧k	Ш	KЪЬ
Ш
KЪЬШKЪЬШKЪЬЮЬЮЬШKШ ЧKЪ╧nЬЮЬЮШKЪЮЬ Ш'KЪЮЬШЪЬЮЬЮЬШKШ KЪЬЮЬШKЪЮЬЮЬЮЬШЪЬЮЬ'Ш;KШ ЧЪЯ	ЬЮЬЮЬШ3ЪЮЬЮЬЮЬ!ЮЬЮЬЮШEKЪЬШKЪЮЬШЧKЪЬШKЪЬШKШ ЧЪЯЬЮЬЮЬШBЪЮЬШ%KЪ	ЬЮЬЮЬ0ЮЬЮЬШiKЪ	ЬЮЬЮЬ0ЮЬЮЬ	ШnЧKЪЬШЧЪЯЬЮЬЮЬ
Ш>KЪЮЬkШqKЪЬШKШ ЧЪЯЬЮЬЮЬ'Ш<KЪЬ'Ш'KЪЬ?Ш?ЪЯ	ЬЮЬШ KЪЬ&Ш&KЪЬ)Ш)KЪЬЮЬШKЪЬЮЬШЪЮЬЮЬЮЬ!ЮЬЮЬЮШEKЪЬ\Ш\KЪЮЬЮЬЮЬ+ШBKЪЬЮЬ.Ш?KЪЮЬШЧШKЪЬЮЬ1ШDKЪЬЮЬ1Ш8ЪЮЬЮЬЮЬ!ЮЬЮЬЮШEKЪЬHШHKЪЬMШMKЪЮЬЮЬЮЬШ.KЪЮЬШЧKШЧШKЪЬШЪЮЬЮЬЮЬ!ЮЬЮЬЮШEKЪЬЮЬШ'KЪЬЮЬ:ШLKЪЬЮЬ:ШLKЪЬЮЬ:ШLKЪЬЮЬ:ШLKЪЮЬШЧKЪЬЮЬEШVKШЧKЪЬШЧЪЯЬЮЬШЪЮЬЮЬЮЬ!ЮЬЮЬЮШEKЪЬOШOKЪЬOШOKЪЬШKЪЮЬШЧKЪЬTШTKЪЬ=Ш=KЪЬШЧЪЯ	ЬЮЬШ KЪЬЮЬШKЪЬШKЪЬ_Ш_KЪЬШЧKЪЬШKЪЬШKЪЬШKЪЬШKШ ЧЪ
ЯЬЮЬЮЬЮЬЮЬШ<KЪЬШKЪЮЬЮЬЮЬЮЬЮЬЮЬШ{ЪЮЬЮЬЮЬ!ЮЬЮЬЮШEЪ
ЮЬЮЬBЮЬЮЬDЮЬШбKЪЬ!Ш!KЪЮЬЮЬЮЬЮЬШKЪЬШЧKЪЮЬШЧKЪЮЬЮЬШKЪЬШKШ ЧЪ
ЯЬЮЬЮЬ$ЮЬЮЬШXKЪЬШЪЮЬЮШKЪЬЮЬ!Ш-KЪЬЮЬ!Ш-KЪЬЮЬ!Ш-KЪЬЮЬ!Ш-KЪЮЬЮЬШЧKЪЬШЧKШ ЧKШ KЪЮЬШKШ KШ Ч ЕЧ    N  ц  