-
Notifications
You must be signed in to change notification settings - Fork 12
/
node.py
670 lines (568 loc) · 18.6 KB
/
node.py
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
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
from collections import namedtuple
import time
from math import isclose
import sys
if sys.version_info >= (3, 6):
from enum import Enum, Flag, auto
else:
# Python 3.5 backport
from .enum import Enum, Flag, auto
Point = namedtuple('Point', 'x y')
Dimensions = namedtuple('Dimensions', 'x y width height')
class Orient(Flag):
HORIZONTAL = 0
VERTICAL = 1
HORIZONTAL, VERTICAL = Orient
class Direction(Enum):
UP = auto()
DOWN = auto()
LEFT = auto()
RIGHT = auto()
@property
def orient(self):
return HORIZONTAL if self in [self.LEFT, self.RIGHT] else VERTICAL
@property
def offset(self):
return 1 if self in [self.RIGHT, self.DOWN] else -1
UP, DOWN, LEFT, RIGHT = Direction
class AddMode(Flag):
HORIZONTAL = 0
VERTICAL = 1
SPLIT = auto()
@property
def orient(self):
return VERTICAL if self & self.VERTICAL else HORIZONTAL
border_check = {
UP: lambda a, b: isclose(a.y, b.y_end),
DOWN: lambda a, b: isclose(a.y_end, b.y),
LEFT: lambda a, b: isclose(a.x, b.x_end),
RIGHT: lambda a, b: isclose(a.x_end, b.x),
}
class NotRestorableError(Exception):
pass
class Node:
"""A tree node.
Each node represents a container that can hold a payload and child nodes.
"""
min_size_default = 100
root_orient = HORIZONTAL
def __init__(self, payload=None, x=None, y=None, width=None, height=None):
self.payload = payload
self._x = x
self._y = y
self._width = width
self._height = height
self._size = None
self.children = []
self.last_accessed = 0
self.parent = None
self.restorables = {}
def __repr__(self):
info = self.payload or ''
if self:
info += ' +%d' % len(self)
return '<Node %s %x>' % (info, id(self))
def __contains__(self, node):
if node is self:
return True
for child in self:
if node in child:
return True
return False
def __iter__(self):
yield from self.children
def __getitem__(self, key):
return self.children[key]
def __setitem__(self, key, value):
self.children[key] = value
def __len__(self):
return len(self.children)
@property
def root(self):
try:
return self.parent.root
except AttributeError:
return self
@property
def is_root(self):
return self.parent is None
@property
def is_leaf(self):
return not self
@property
def index(self):
return self.parent.children.index(self)
@property
def tree(self):
return [c.tree if c else c for c in self]
@property
def siblings(self):
return [c for c in self.parent if c is not self]
@property
def first_leaf(self):
if self.is_leaf:
return self
return self[0].first_leaf
@property
def last_leaf(self):
if self.is_leaf:
return self
return self[-1].last_leaf
@property
def recent_leaf(self):
if self.is_leaf:
return self
return max(self, key=lambda n: n.last_accessed).recent_leaf
@property
def prev_leaf(self):
if self.is_root:
return self.last_leaf
idx = self.index - 1
if idx < 0:
return self.parent.prev_leaf
return self.parent[idx].last_leaf
@property
def next_leaf(self):
if self.is_root:
return self.first_leaf
idx = self.index + 1
if idx >= len(self.parent):
return self.parent.next_leaf
return self.parent[idx].first_leaf
@property
def all_leafs(self):
if self.is_leaf:
yield self
for child in self:
yield from child.all_leafs
@property
def orient(self):
if self.is_root:
return self.root_orient
return ~self.parent.orient
@property
def horizontal(self):
return self.orient is HORIZONTAL
@property
def vertical(self):
return self.orient is VERTICAL
@property
def x(self):
if self.is_root:
return self._x
if self.horizontal:
return self.parent.x
return self.parent.x + self.size_offset
@x.setter
def x(self, val):
if not self.is_root:
return
self._x = val
@property
def y(self):
if self.is_root:
return self._y
if self.vertical:
return self.parent.y
return self.parent.y + self.size_offset
@y.setter
def y(self, val):
if not self.is_root:
return
self._y = val
@property
def pos(self):
return Point(self.x, self.y)
@property
def width(self):
if self.is_root:
return self._width
if self.horizontal:
return self.parent.width
return self.size
@width.setter
def width(self, val):
if self.is_root:
self._width = val
elif self.horizontal:
self.parent.size = val
else:
self.size = val
@property
def height(self):
if self.is_root:
return self._height
if self.vertical:
return self.parent.height
return self.size
@height.setter
def height(self, val):
if self.is_root:
self._height = val
elif self.vertical:
self.parent.size = val
else:
self.size = val
@property
def x_end(self):
return self.x + self.width
@property
def y_end(self):
return self.y + self.height
@property
def x_center(self):
return self.x + self.width / 2
@property
def y_center(self):
return self.y + self.height / 2
@property
def center(self):
return Point(self.x_center, self.y_center)
@property
def top_left(self):
return Point(self.x, self.y)
@property
def top_right(self):
return Point(self.x + self.width, self.y)
@property
def bottom_left(self):
return Point(self.x, self.y + self.height)
@property
def bottom_right(self):
return Point(self.x + self.width, self.y + self.height)
@property
def pixel_perfect(self):
"""Return pixel-perfect int dimensions (x, y, width, height) which
compensate for gaps in the layout grid caused by plain int conversion.
"""
x, y, width, height = self.x, self.y, self.width, self.height
threshold = 0.99999
if (x - int(x)) + (width - int(width)) > threshold:
width += 1
if (y - int(y)) + (height - int(height)) > threshold:
height += 1
return Dimensions(*map(int, (x, y, width, height)))
@property
def capacity(self):
return self.width if self.horizontal else self.height
@property
def size(self):
"""Return amount of space taken in parent container."""
if self.is_root:
return None
if self.fixed:
return self._size
if self.flexible:
# Distribute space evenly among flexible nodes
taken = sum(n.size for n in self.siblings if not n.flexible)
flexibles = [n for n in self.parent if n.flexible]
return (self.parent.capacity - taken) / len(flexibles)
return max(sum(gc.min_size for gc in c) for c in self)
@size.setter
def size(self, val):
if self.is_root or not self.siblings:
return
if val is None:
self.reset_size()
return
occupied = sum(s.min_size_bound for s in self.siblings)
val = max(min(val, self.parent.capacity - occupied),
self.min_size_bound)
self.force_size(val)
def force_size(self, val):
"""Set size without considering available space."""
Node.fit_into(self.siblings, self.parent.capacity - val)
if val == 0:
return
if self:
Node.fit_into([self], val)
self._size = val
@property
def size_offset(self):
return sum(c.size for c in self.parent[:self.index])
@staticmethod
def fit_into(nodes, space):
"""Resize nodes to fit them into the available space."""
if not nodes:
return
occupied = sum(n.min_size for n in nodes)
if space >= occupied and any(n.flexible for n in nodes):
# If any flexible node exists, it will occupy the space
# automatically, not requiring any action.
return
nodes_left = nodes[:]
space_left = space
if space < occupied:
for node in nodes:
if node.min_size_bound != node.min_size:
continue
# Substract nodes that are already at their minimal possible
# size because they can't be shrinked any further.
space_left -= node.min_size
nodes_left.remove(node)
if not nodes_left:
return
factor = space_left / sum(n.size for n in nodes_left)
for node in nodes_left:
new_size = node.size * factor
if node.fixed:
node._size = new_size # pylint: disable=protected-access
for child in node:
Node.fit_into(child, new_size)
@property
def fixed(self):
"""A node is fixed if it has a specified size."""
return self._size is not None
@property
def min_size(self):
if self.fixed:
return self._size
if self.is_leaf:
return self.min_size_default
size = max(sum(gc.min_size for gc in c) for c in self)
return max(size, self.min_size_default)
@property
def min_size_bound(self):
if self.is_leaf:
return self.min_size_default
return max(sum(gc.min_size_bound for gc in c) or
self.min_size_default for c in self)
def reset_size(self):
self._size = None
@property
def flexible(self):
"""A node is flexible if its size isn't (explicitly or implictly)
determined.
"""
if self.fixed:
return False
return all((any(gc.flexible for gc in c) or c.is_leaf) for c in self)
def access(self):
self.last_accessed = time.time()
try:
self.parent.access()
except AttributeError:
pass
def neighbor(self, direction):
"""Return adjacent leaf node in specified direction."""
if self.is_root:
return None
if direction.orient is self.parent.orient:
target_idx = self.index + direction.offset
if 0 <= target_idx < len(self.parent):
return self.parent[target_idx].recent_leaf
if self.parent.is_root:
return None
return self.parent.parent.neighbor(direction)
return self.parent.neighbor(direction)
@property
def up(self):
return self.neighbor(UP)
@property
def down(self):
return self.neighbor(DOWN)
@property
def left(self):
return self.neighbor(LEFT)
@property
def right(self):
return self.neighbor(RIGHT)
def common_border(self, node, direction):
"""Return whether a common border with given node in specified
direction exists.
"""
if not border_check[direction](self, node):
return False
if direction in [UP, DOWN]:
detached = node.x >= self.x_end or node.x_end <= self.x
else:
detached = node.y >= self.y_end or node.y_end <= self.y
return not detached
def close_neighbor(self, direction):
"""Return visually adjacent leaf node in specified direction."""
nodes = [n for n in self.root.all_leafs if
self.common_border(n, direction)]
if not nodes:
return None
most_recent = max(nodes, key=lambda n: n.last_accessed)
if most_recent.last_accessed > 0:
return most_recent
if direction in [UP, DOWN]:
match = lambda n: n.x <= self.x_center <= n.x_end
else:
match = lambda n: n.y <= self.y_center <= n.y_end
return next(n for n in nodes if match(n))
@property
def close_up(self):
return self.close_neighbor(UP)
@property
def close_down(self):
return self.close_neighbor(DOWN)
@property
def close_left(self):
return self.close_neighbor(LEFT)
@property
def close_right(self):
return self.close_neighbor(RIGHT)
def add_child(self, node, idx=None):
if idx is None:
idx = len(self)
self.children.insert(idx, node)
node.parent = self
if len(self) == 1:
return
total = self.capacity
Node.fit_into(node.siblings, total - (total / len(self)))
def add_child_after(self, new, old):
self.add_child(new, idx=old.index+1)
def remove_child(self, node):
node._save_restore_state() # pylint: disable=W0212
node.force_size(0)
self.children.remove(node)
if len(self) == 1:
child = self[0]
if self.is_root:
# A single child doesn't need a fixed size
child.reset_size()
else:
# Collapse tree with a single child
self.parent.replace_child(self, child)
Node.fit_into(child, self.capacity)
def remove(self):
self.parent.remove_child(self)
def replace_child(self, old, new):
self[old.index] = new
new.parent = self
new._size = old._size # pylint: disable=protected-access
def flip_with(self, node, reverse=False):
"""Join with node in a new, orthogonal container."""
container = Node()
self.parent.replace_child(self, container)
self.reset_size()
for child in [node, self] if reverse else [self, node]:
container.add_child(child)
def add_node(self, node, mode=None):
"""Add node according to the mode.
This can result in adding it as a child, joining with it in a new
flipped sub-container, or splitting the space with it.
"""
if self.is_root:
self.add_child(node)
elif mode is None:
self.parent.add_child_after(node, self)
elif mode.orient is self.parent.orient:
if mode & AddMode.SPLIT:
node._size = 0 # pylint: disable=protected-access
self.parent.add_child_after(node, self)
self._size = node._size = self.size / 2
else:
self.parent.add_child_after(node, self)
else:
self.flip_with(node)
def restore(self, node):
"""Restore node.
Try to add the node in a place where a node with the same payload
has previously been.
"""
restorables = self.root.restorables
try:
parent, idx, sizes, fixed, flip = restorables[node.payload]
except KeyError:
raise NotRestorableError() # pylint: disable=raise-missing-from
if parent not in self.root:
# Don't try to restore if parent is not part of the tree anymore
raise NotRestorableError()
node.reset_size()
if flip:
old_parent_size = parent.size
parent.flip_with(node, reverse=(idx == 0))
node.size, parent.size = sizes
Node.fit_into(parent, old_parent_size)
else:
parent.add_child(node, idx=idx)
node.size = sizes[0]
if len(sizes) == 2:
node.siblings[0].size = sizes[1]
if not fixed:
node.reset_size()
del restorables[node.payload]
def _save_restore_state(self):
parent = self.parent
sizes = (self.size,)
flip = False
if len(self.siblings) == 1:
# If there is only one node left in the container, we need to save
# its size too because the size will be lost.
sizes += (self.siblings[0]._size,) # pylint: disable=W0212
if not self.parent.is_root:
flip = True
parent = self.siblings[0]
self.root.restorables[self.payload] = (parent, self.index, sizes,
self.fixed, flip)
def move(self, direction):
"""Move this node in `direction`. Return whether node was moved."""
if self.is_root:
return False
if direction.orient is self.parent.orient:
old_idx = self.index
new_idx = old_idx + direction.offset
if 0 <= new_idx < len(self.parent):
p = self.parent
p[old_idx], p[new_idx] = p[new_idx], p[old_idx]
return True
new_sibling = self.parent.parent
else:
new_sibling = self.parent
try:
new_parent = new_sibling.parent
idx = new_sibling.index
except AttributeError:
return False
self.reset_size()
self.parent.remove_child(self)
new_parent.add_child(self, idx + (1 if direction.offset == 1 else 0))
return True
def move_up(self):
return self.move(UP)
def move_down(self):
return self.move(DOWN)
def move_right(self):
return self.move(RIGHT)
def move_left(self):
return self.move(LEFT)
def _move_and_integrate(self, direction):
old_parent = self.parent
self.move(direction)
if self.parent is not old_parent:
self.integrate(direction)
def integrate(self, direction):
if direction.orient != self.parent.orient:
self._move_and_integrate(direction)
return
target_idx = self.index + direction.offset
if target_idx < 0 or target_idx >= len(self.parent):
self._move_and_integrate(direction)
return
self.reset_size()
target = self.parent[target_idx]
self.parent.remove_child(self)
if target.is_leaf:
target.flip_with(self)
else:
target.add_child(self)
def integrate_up(self):
self.integrate(UP)
def integrate_down(self):
self.integrate(DOWN)
def integrate_left(self):
self.integrate(LEFT)
def integrate_right(self):
self.integrate(RIGHT)
def find_payload(self, payload):
if self.payload is payload:
return self
for child in self:
needle = child.find_payload(payload)
if needle is not None:
return needle
return None