-
Notifications
You must be signed in to change notification settings - Fork 1
/
tree.coffee
439 lines (383 loc) · 15.5 KB
/
tree.coffee
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
# Tree UI - CoffeeScript Version
# The original code used a tree data structure.
# We are going to use a directed graph data structure.
class window.Graph
class @Node
constructor: (@id) ->
# Core required properties: id, parent, children
@parent = null
@children = []
# d3 visual properties
@d3 =
html: '?'
x: null
y: null
# Abstract data properties (suggested)
@data =
token: null
value: null
class @Link
constructor: (@child, @parent) ->
# Core required properties: child, parent
# d3 visual properties
@d3 =
child:
x: null
y: null
parent:
x: null
y: null
# Really we just want to discourage people from modifying the array accidentally
nodes: =>
return @_nodes.slice(0)
node: (id) =>
nodes = (node for node in @_nodes when node.id is id)
switch nodes.length
when 0 then return null
when 1 then return nodes[0]
else
console.log nodes
throw "Multiple nodes matched id: " + id
addNode: (data, parent, index) =>
node = new Graph.Node
node.id = @_nextid++ # Auto-increment
node.data = data # Store AST data
@_nodes.push(node)
if parent? then @_link(node.id,parent, index)
return node
moveNode: (id, newparent, index) =>
oldparent = @node(id).parent
if oldparent? then @_unlink(id, oldparent)
if newparent? then @_link(id, newparent, index)
return true
removeNode: (id) =>
# Note: If you don't use list comprehensions, but try to use .map and .filter,
# you run into trouble where `this.removeLink` is no longer in the scope.
@_unlink link.child, link.parent for link in @_links when (link.parent is id or link.child is id)
@_nodes = (node for node in @_nodes when node.id isnt id)
return true
leaves: =>
return (node for node in @_nodes when node.children.length is 0)
roots: =>
return (node for node in @_nodes when node.parent is null)
depth: (id) =>
node = @node(id)
if node.parent is null
return 0
else
# TODO: Keep track of which nodes we've visited to avoid cycles.
return 1 + @depth(node.parent)
descendents: (id) =>
me = @node(id)
list = []
list.push me.children...
for child in me.children
list.push @descendents(child)...
return list
isDescendent: (pid, cid) =>
if cid is null then return false
if cid is pid then return true
return @isDescendent pid, @node(cid).parent
isConnected: (id1, id2) =>
return @isDescendent(id1, id2) or @isDescendent(id2, id1)
isCycle: (id) =>
cycle = (id, list) =>
if not id? then return false
if id in list then return true
list.push(id)
return cycle @node(id).parent, list
return cycle id, []
# Really we just want to discourage people from modifying the array accidentally
links: =>
return @_links.slice(0)
# Just for consistancy really
_link: (child, parent, index) =>
# TODO: Add sanity checks.
if not @node(parent)? then throw "Parent node " + parent + " does not exist."
# NOTE: It is important we store the parent ID here, not an actual object,
# so that we can serialize _nodes as a flat array later on for storage!!!
@node(child).parent = parent
if not index? then index = @node(parent).children.length
@node(parent).children.splice(index,0,child)
@_links.push(new Graph.Link(child,parent))
return true
# TODO: Make this more efficient?
_unlink: (child, parent) =>
@node(child).parent = null
@node(parent).children = (id for id in @node(parent).children when id isnt child)
@_links = (link for link in @_links when (link.child isnt child or link.parent isnt parent))
return true
toJSON: () =>
o = {}
o._nodes = @_nodes
# These are derived and shouldn't really be needed.
# But currently, I don't re-calculate them so we'll save them.
o._nextid = @_nextid
o._links = @_links
return JSON.stringify(o)
loadJSON: (s) =>
o = JSON.parse(s)
@_nodes = o._nodes
# These are derived and shouldn't really be needed.
# But currently, I don't re-calculate them so we'll save them.
@_nextid = o._nextid
@_links = o._links
return
# Constructor for main graph class.
constructor: ->
self = this # A hack, so we can access the graph methods inside nested closures that have different `this`
# TODO: Perhaps get rid of this? Too many levels of object nesting. :-?
@nodes.get = (id) =>
nodes = @_nodes.filter((node) -> node.id is id)
if nodes.length is 1
return nodes[0]
else
throw "Multiple nodes matched id: " + id
# TODO: We gotta figure out how much manipulation of the guts of the graph are
# to be done
@_nodes = []
@_nextid = 0
@_links = []
return this
class window.Graph.vis
constructor: (@graph, @div) ->
self = this;
d3 = window.d3;
@svgW = "100%"
@svgH = 460
@cx = 20
@cy = 20
@padding = 20
@h = 70
if typeof @div isnt "string" then @div = '#'+$(@div).attr('id')
# This exists for the bizaire purpose of computing the width of a brand new node that doesn't
# have any physical existance yet.
d3.select("body").append("div").attr("class", "node").attr("id", "protonode").html("?").style("visibility", "hidden")
# Initialize the node group
d3.select(@div).append("div").attr("class", "div_nodes")
# Initialize the edge group
d3.select(@div).append("svg").attr("class", "graphsvg")
.append("g").attr("class", "g_lines")
# .attr("width", @svgW).attr("height", @svgH)
reposition: =>
# I don't think this algorithm is perfect. But I currently
# cannot formulate a "perfect" algorithm in my head. (I can
# formulate some denser but sometimes unexpected layouts.)
# I am waiting to re-write this stuff until I have my AHA
# perfect layout algorithm breakthrough.
getNodeWidth = (node) =>
# Try to get a handle to the actual node.
div = $(".node[data-id=#{node.id}]")
# If it doesn't exist, grab the proto-node so we don't have width == 0.
div = $("#protonode") if div.length is 0
# Return whichever is wider, me or my children
my_width = div.outerWidth()
# console.log('my_width: ' + my_width)
children_width = getChildrenWidth(node)
Math.max(my_width, children_width)
getNodeHeight = (node) =>
# Try to get a handle to the actual node.
div = $(".node[data-id=#{node.id}]")
# If it doesn't exist, grab the proto-node so we don't have width == 0.
div = $("#protonode") if div.length is 0
# Return the height of node
return div.outerHeight()
getChildrenWidth = (node) =>
# Sum up the width of the children
if (node.children.length > 0)
width = (@padding * (node.children.length - 1))
width += (getNodeWidth(@graph.node(id)) for id in node.children).reduce (a,b) -> a+b
return width
else
return 0
# We are modifying this to use an actual node width rather than
# a constant value (graph.padding)
maxtop = 0
reposition = (node) =>
left = node.d3.x - getChildrenWidth(node) / 2
for id in node.children
child = @graph.node(id)
padding = getNodeWidth(child)
left += padding / 2
child.d3.oldx = child.d3.x
child.d3.oldy = child.d3.y
child.d3.x = left
child.d3.y = node.d3.y + @h
left += padding / 2 + @padding
maxtop = Math.max(maxtop, child.d3.y + getNodeHeight(child)/2)
reposition child
return
# main reposition function.
left = @padding
for root in @graph.roots()
half_width = getNodeWidth(root) / 2
left += @padding + half_width
root.d3.oldx = root.d3.x
root.d3.oldy = root.d3.y
root.d3.x = left
root.d3.y = @padding
reposition(root)
left += half_width
# Stretch SVG to cover width.
cur_width = $("#{@div} .graphsvg").outerWidth()
cur_height = $("#{@div} .graphsvg").outerHeight()
left += @padding
# Alright, too many browsers are having wrapping glitches. Make the minimum width the viewport width.
left = Math.max($('body').outerWidth(), left)
# And to simplify drag-dropping shit around and having visible lines... we'll make this the viewport height as well
# TODO: Make this REASONABLE. Right now it's like double the page height for some reason.
maxtop = Math.max($('body').outerHeight(), maxtop)
maxtop += @padding
if (cur_width <= left)
$("#{@div} .graphsvg").css("width",left)
$("#{@div}").css("width",left)
else # Wait until the animated transitions have finished
setTimeout () =>
$("#{@div} .graphsvg").css("width",left)
$("#{@div}").css("width",left)
return
, 1000
if (cur_height <= maxtop)
$("#{@div} .graphsvg").css("height",maxtop)
$("#{@div}").css("height",maxtop)
else # Wait until the animated transitions have finished
setTimeout () =>
$("#{@div} .graphsvg").css("height",maxtop)
$("#{@div}").css("height",maxtop)
return
, 1000
for link in @graph.links()
parent = @graph.node(link.parent)
child = @graph.node(link.child)
link.d3 =
id: child.id
parent:
oldx: parent.d3.oldx
oldy: parent.d3.oldy
x: parent.d3.x
y: parent.d3.y
child:
oldx: child.d3.oldx
oldy: child.d3.oldy
x: child.d3.x
y: child.d3.y
centerLeft =(x, el) =>
if x is null then return x
if $(el).hasClass("node-container") then el = $(el).find(".node")
x - $(el).outerWidth() / 2 + "px"
centerTop = (y, el) =>
if y is null then return y
if $(el).hasClass("node-container") then el = $(el).find(".node")
y - $(el).outerHeight() / 2 + "px"
currentCenterLeft = (id) =>
el = $(@div).find(".node[data-id=#{id}]")
$(el).parent().position().left + $(el).outerWidth() /2
currentCenterTop = (id) =>
el = $(@div).find(".node[data-id=#{id}]")
$(el).parent().position().top + $(el).outerHeight() /2
# TODO: Put edge labels back in?
redraw: =>
# Hack around `this` scope in callbacks.
self = this
# TODO: Decide if edge links should have an id outside of the d3 realm.
edges = d3.select("#{@div} .g_lines").selectAll(".edge").data(@graph._nodes, (d)-> d.id)
nodes = d3.select("#{@div} .div_nodes").selectAll(".node-container").data(@graph._nodes, (d)-> d.id)
# Phase 1 - create all the HTML fatness so we know how wide all the elements are going to be.
nodes_enter = nodes.enter().append("div").attr("class","node-container")
nodes_enter.append("div").attr("class", "node")
.attr("id", (d) -> "node" + d.id)
.attr("data-id", (d) -> d.id)
.attr("draggable", "true")
.html((d)-> d.d3.html)
# Update the HTML content of nodes (must be done before calculating positions so we have access to widths)
# We must also ignore nodes where the content is being actively edited!
# (Otherwise, it appears to move the cursor back to the beginning of the content.)
d3.selectAll("#{@div} .node[contenteditable='false']").data(@graph._nodes, (d)-> d.id)
.html((d)-> return d.d3.html)
# Phase 2 - With these elements (hopefully) created now, compute their final positions.
@reposition()
# Phase 3 - Now, create the motion madness!
edges.transition().duration(500)
.attr("x1", (d) -> graph.node(d.parent)?.d3?.x ? d.d3.x)
.attr("y1", (d) -> graph.node(d.parent)?.d3?.y ? d.d3.y)
.attr("x2", (d) -> d.d3.x)
.attr("y2", (d) -> d.d3.y)
edges_enter = edges.enter().append("line")
.attr("class","edge")
.attr("data-child", (d) -> d.id)
.attr("x1", (d) -> graph.node(d.parent)?.d3?.oldx ? d.d3.oldx)
.attr("y1", (d) -> graph.node(d.parent)?.d3?.oldy ? d.d3.oldy)
.attr("x2", (d) -> graph.node(d.parent)?.d3?.oldx ? d.d3.oldx)
.attr("y2", (d) -> graph.node(d.parent)?.d3?.oldy ? d.d3.oldy)
edges_enter
.transition().duration(500)
.attr("x1", (d) -> graph.node(d.parent)?.d3?.x ? d.d3.x)
.attr("y1", (d) -> graph.node(d.parent)?.d3?.y ? d.d3.y)
.attr("x2", (d) -> d.d3.x)
.attr("y2", (d) -> d.d3.y)
edges.exit().transition().duration(500)
.attr("x1", $(".trashcan").width()/2)
.attr("x2", $(".trashcan").width()/2)
.attr("y1", $(".trashcan").height()/2)
.attr("y2", $(".trashcan").height()/2)
.style('opacity','0').remove()
nodes.transition().duration(500)
.style("left", (d) -> centerLeft(d.d3.x, this))
.style("top", (d) -> centerTop(d.d3.y, this))
.style("z-index", (d)-> 1000-self.graph.depth(d.id)) # Child nodes are rendered underneath parents
# Note: Since these set left and top based on the width and height,
# this must be executed AFTER setting .html in the child.
nodes_enter
.style("position", "absolute")
.style("z-index", (d)-> 1000-self.graph.depth(d.id)) # Child nodes are rendered underneath parents
.style("left", (d) ->
x = if (d.parent is null) then d.d3.oldx else self.graph.node(d.parent).d3.oldx #currentCenterLeft(d.parent)
centerLeft(x, this))
.style("top", (d) ->
y = if (d.parent is null) then d.d3.oldy else self.graph.node(d.parent).d3.oldy
centerTop(y, this))
# Note to future self: Apply transitions LAST after appending nested elements in order to behave propertly
nodes_enter.transition().duration(500)
.style("left", (d) -> centerLeft(d.d3.x, this))
.style("top", (d) -> centerTop(d.d3.y, this))
nodes.exit().transition().duration(500)
.style("left", (d) -> centerLeft($(".trashcan").width()/2, this))
.style("top", (d) -> centerTop($(".trashcan").height()/2, this))
.style('opacity','0').remove()
# aux is an array of auxillary structures.
# for now it's just an array of edge-like objects
drawAux: (aux)=>
# Auxiliary lines
aux_lines = d3.select("#{@div} .g_lines").selectAll(".aux").data(aux, (d)-> d.id)
aux_lines.enter().append("line")
.attr("class","aux")
.attr("data-id", (d) -> d.id)
.attr("x1", (d) -> d.d3.parent.oldx)
.attr("y1", (d) -> d.d3.parent.oldy)
.attr("x2", (d) -> d.d3.child.oldx)
.attr("y2", (d) -> d.d3.child.oldy)
aux_lines.transition().duration(0)
.attr("x1", (d) -> d.d3.parent.x)
.attr("y1", (d) -> d.d3.parent.y)
.attr("x2", (d) -> d.d3.child.x)
.attr("y2", (d) -> d.d3.child.y)
aux_lines.exit().remove()
drawNodeAt: (id,dx,dy)=>
edges = (graph.node(i) for i in graph.descendents(id))
top_node = graph.node(id)
nodes = edges.concat [top_node]
edges_divs = d3.select("#{@div} .g_lines").selectAll(".edge").data(edges, (d)-> d.id)
top_edge = d3.select("#{@div} .g_lines").selectAll(".edge[data-child='#{id}']").datum(top_node, (d)-> d.id)
node_divs = d3.select("#{@div} .div_nodes").selectAll(".node-container").data(nodes, (d)-> d.id)
node_divs.transition().duration(0)
.style("left", (d) -> centerLeft(d.d3.x+dx, this))
.style("top", (d) -> centerTop(d.d3.y+dy, this))
edges_divs.transition().duration(0)
.attr("x1", (d) -> if d.parent? then graph.node(d.parent).d3.x+dx else d.d3.x+dx)
.attr("y1", (d) -> if d.parent? then graph.node(d.parent).d3.y+dy else d.d3.y+dy)
.attr("x2", (d) -> d.d3.x+dx)
.attr("y2", (d) -> d.d3.y+dy)
top_edge.transition().duration(0)
.attr("x2", (d) -> d.d3.x+dx)
.attr("y2", (d) -> d.d3.y+dy)
return