-
Notifications
You must be signed in to change notification settings - Fork 0
/
line_renderer.go
112 lines (95 loc) · 2.06 KB
/
line_renderer.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
package main
type LineRenderer struct {
}
func NewLineRenderer() (inst LineRenderer) {
return
}
type List struct {
isAlignX bool
alignX float32
isAlignY bool
alignY float32
root *Node
}
func (s *List) Item(i int) *Node {
return s.GetItem(i, 0, s.root)
}
func (s *List) GetItem(target, depth int, node *Node) (out *Node) {
if target == depth {
out = node
} else {
out = s.GetItem(target, depth+1, node.listNext)
}
return
}
func GetListID() int {
MAX_LISTID += 1
LISTS[MAX_LISTID] = &List{}
return MAX_LISTID
}
type line struct {
colour, outline string
}
func (s *LineRenderer) Draw() {
ids := []int{}
listids := []int{}
NODES[ROOT].TotalIDs(&ids, &listids)
cols := make(map[int]Outline)
outlines := make(map[int]Outline)
i := 0
pv := 0
for _, v := range ids {
if pv != v {
i += 1
}
cols[v] = Outline{LineColours[i%len(LineColours)], "White"}
pv = v
}
i = 0
pv = 0
for _, v := range listids {
if pv != v {
i += 1
}
outlines[v] = OutlineColours[i%len(OutlineColours)]
pv = v
}
NODES[ROOT].DrawLines(cols, outlines)
}
func (s *Node) DrawLines(cols map[int]Outline, outlines map[int]Outline) {
if s.ID != ROOT {
//colour
var l Outline
if s.isList {
l = outlines[s.ListID]
} else {
l = cols[s.ID]
}
if s.Parent.ID != ROOT {
DrawPath(FindEdge(s, s.Parent), FindEdge(s.Parent, s), s.invertedLine, PALETTE[l.Inner], s.isList, PALETTE[l.Outer], false)
}
// soft links
if s.slDragging {
DrawPath(CAMERA.MousePos, FindEdgeToPoint(s, CAMERA.MousePos), s.invertedLine, PALETTE[l.Inner], s.isList, PALETTE[l.Outer], true)
}
for _, v := range s.SoftLinks {
l = cols[v.ID]
DrawPath(FindEdge(v, s), FindEdge(s, v), s.invertedLine, PALETTE[l.Inner], s.isList, PALETTE[l.Outer], true)
}
}
if !s.Flags.IsNested || s.ID == ROOT {
for _, v := range s.Childs {
v.DrawLines(cols, outlines)
}
}
}
func (s *Node) TotalIDs(ids *[]int, listids *[]int) {
if s.isList {
*listids = append(*listids, s.ListID)
} else {
*ids = append(*ids, s.ID)
}
for _, v := range s.Childs {
v.TotalIDs(ids, listids)
}
}