Skip to main content
summaryrefslogtreecommitdiffstats
blob: 7eb32ddd9a7b317f5db133da5bbbb81da4aa2260 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
import 'Tree.ecore'::tree;
import 'TallTree.ecore'::talltree;
import 'Tree2TallTree.ecore'::tree2talltree;

transformation Tree2TallTree {
	tree imports tree;
	talltree imports talltree;
	tree2talltree imports tree2talltree;
}

map __root__ in Tree2TallTree {
    for node : tree::Node in tree.objectsOfKind(Node)->sortedBy(name) {
        call Node2MiddleNode {
            node := node;
        } 
    } 
    for node : tree::Node in tree.objectsOfKind(Node)->sortedBy(name) {
        call Edge2MiddleEdge {
            node := node;
            node2tallNode := node.Node2TallNode;
        } 
    } 
    for node2tallNode : tree2talltree::Node2TallNode in tree2talltree.objectsOfKind(Node2TallNode)->sortedBy(name) {
        call MiddleNode2TallNode {
            node2tallNode ?= node2tallNode;			--isPolled
        } 
    } 
}

map Node2MiddleNode in Tree2TallTree {
	check tree(node : Node) {} 
	enforce tree2talltree() {
		realize node2tallNode : Node2TallNode
	}
	where() {
		node2tallNode.node := node;
		node2tallNode.name := node.name;
	}
}

map Edge2MiddleEdge in Tree2TallTree {
	check tree(node : Node) {} 
	enforce tree2talltree {
		enforce Node2TallNode::parent
	} (node2tallNode : Node2TallNode) {
--		realize node2tallNode : Node2TallNode
	}
	where(node.parent <> null;) {
		node2tallNode.parent := node.parent.Node2TallNode;
--		node2tallNode.name := node.name;
	}
}

map MiddleNode2TallNode in Tree2TallTree {
	check tree2talltree {
		check Node2TallNode::tallNode, Node2TallNode::children
		enforce Node2TallNode::tallNode
	} (node2tallNode : Node2TallNode) {} 
	enforce talltree {
		check TallNode::height
		enforce TallNode::height
	} () {
		realize tallNode : TallNode
	}
	where() {
		node2tallNode.tallNode := tallNode;
		tallNode.name := node2tallNode.name;
		tallNode.children := node2tallNode.children?.tallNode->asSet();
		tallNode.height := if node2tallNode.children->notEmpty() then node2tallNode.children.tallNode.height->max() + 1 else 0 endif;
	}
}

Back to the top