forked from awalterschulze/gographviz
/
write.go
154 lines (133 loc) · 3.91 KB
/
write.go
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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
//Copyright 2013 Vastech SA (PTY) LTD
//
//Licensed under the Apache License, Version 2.0 (the "License");
//you may not use this file except in compliance with the License.
//You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
//Unless required by applicable law or agreed to in writing, software
//distributed under the License is distributed on an "AS IS" BASIS,
//WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
//See the License for the specific language governing permissions and
//limitations under the License.
package gographviz
import (
"fmt"
"github.com/awalterschulze/gographviz/ast"
"github.com/awalterschulze/gographviz/common"
)
type writer struct {
*Graph
writtenLocations map[string]bool
}
func newWriter(g *Graph) *writer {
return &writer{g, make(map[string]bool)}
}
func appendAttrs(list ast.StmtList, attrs Attrs) ast.StmtList {
for _, name := range attrs.SortedNames() {
attribute, ok := common.StringToAttribute(name)
if !ok {
// TODO fix this
}
value := attrs[attribute]
// TODO: Fix This
// Test fails if the below is uncommented out.
// The problem however, lies with the test, as in the documentation, all string values must be enclosed in double quotes
// var value string
// if attribute.TakesColor() || attribute.TakesString() {
// value = fmt.Sprintf("%q", attrs[attribute])
// } else {
// value = attrs[attribute]
// }
stmt := &ast.Attr{
Field: ast.Id(name),
Value: ast.Id(value),
}
list = append(list, stmt)
}
return list
}
func (this *writer) newSubGraph(name string) *ast.SubGraph {
sub := this.SubGraphs.SubGraphs[name]
this.writtenLocations[sub.Name] = true
s := &ast.SubGraph{}
s.Id = ast.Id(sub.Name)
s.StmtList = appendAttrs(s.StmtList, sub.Attrs)
children := this.Relations.SortedChildren(name)
for _, child := range children {
s.StmtList = append(s.StmtList, this.newNodeStmt(child))
}
return s
}
func (this *writer) newNodeId(name string, port string) *ast.NodeId {
node := this.Nodes.Lookup[name]
return ast.MakeNodeId(node.Name, port)
}
func (this *writer) newNodeStmt(name string) *ast.NodeStmt {
node := this.Nodes.Lookup[name]
id := ast.MakeNodeId(node.Name, "")
this.writtenLocations[node.Name] = true
return &ast.NodeStmt{
id,
ast.PutMap(node.Attrs.toStringMap()),
}
}
func (this *writer) newLocation(name string, port string) ast.Location {
if this.IsNode(name) {
return this.newNodeId(name, port)
} else if this.IsSubGraph(name) {
if len(port) != 0 {
panic(fmt.Sprintf("subgraph cannot have a port: %v", port))
}
return this.newSubGraph(name)
}
panic(fmt.Sprintf("%q is not a node or a subgraph", name))
}
func (this *writer) newEdgeStmt(edge *Edge) *ast.EdgeStmt {
src := this.newLocation(edge.Src, edge.SrcPort)
dst := this.newLocation(edge.Dst, edge.DstPort)
stmt := &ast.EdgeStmt{
Source: src,
EdgeRHS: ast.EdgeRHS{
&ast.EdgeRH{
ast.EdgeOp(edge.Dir),
dst,
},
},
Attrs: ast.PutMap(edge.Attrs.toStringMap()),
}
return stmt
}
func (this *writer) Write() *ast.Graph {
t := &ast.Graph{}
t.Strict = this.Strict
t.Type = ast.GraphType(this.Directed)
t.Id = ast.Id(this.Name)
t.StmtList = appendAttrs(t.StmtList, this.Attrs)
for _, edge := range this.Edges.Edges {
t.StmtList = append(t.StmtList, this.newEdgeStmt(edge))
}
subGraphs := this.SubGraphs.Sorted()
for _, s := range subGraphs {
if _, ok := this.writtenLocations[s.Name]; !ok {
t.StmtList = append(t.StmtList, this.newSubGraph(s.Name))
}
}
nodes := this.Nodes.Sorted()
for _, n := range nodes {
if _, ok := this.writtenLocations[n.Name]; !ok {
t.StmtList = append(t.StmtList, this.newNodeStmt(n.Name))
}
}
return t
}
//Creates an Abstract Syntrax Tree from the Graph.
func (g *Graph) WriteAst() *ast.Graph {
w := newWriter(g)
return w.Write()
}
//Returns a DOT string representing the Graph.
func (g *Graph) String() string {
return g.WriteAst().String()
}