-
Notifications
You must be signed in to change notification settings - Fork 2
/
formula_layout.lua
1464 lines (1111 loc) · 49.3 KB
/
formula_layout.lua
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
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
-- Optimizations.
local ipairs = ipairs;
local pairs = pairs;
local table = table;
local print = print;
local tostring = tostring;
local setmetatable = setmetatable;
local assert = assert;
-- Imports from other modules.
local createCalcDepGraphSystem = createCalcDepGraphSystem;
local createDependencyFirstIterator = createDependencyFirstIterator;
local createBoundingBox2D = createBoundingBox2D;
local createTreeNodeIterator = createTreeNodeIterator;
local MATH_GLOBAL_DEBUG = false;
function formula_debug(isdebug)
MATH_GLOBAL_DEBUG = not not (isdebug);
end
local function debugmsg(msg)
if (#msg == 0) then return; end;
if not (localPlayer) then
print(msg);
else
outputDebugString(msg);
end
end
local function cloneIndexedTable(t)
if not (t) then
return {};
end
local new = {};
for m,n in ipairs(t) do
new[m] = n;
end
return new;
end
local function tremove(t, i)
for m,n in ipairs(t) do
if (n == i) then
table.remove(t, m);
break;
end
end
end
local function thasitem(list, a)
for m,n in ipairs(list) do
if (n == a) then
return true;
end
end
return false;
end
local function tcontentstr(t)
local str = "{";
if (#t > 0) then
str = str .. tostring(t[1]);
for n=2,#t do
str = str .. ", " .. tostring(t[n]);
end
end
return str .. "}";
end
local function tisempty(t)
for _,__ in pairs(t) do
return false;
end
return true;
end
-- There are better algorithms out there but this does the job in Lua pretty well.
local function cutset(a, b)
local cloned = cloneIndexedTable(a);
local n = 1;
local num_items = #cloned;
while ( n <= num_items ) do
local item = cloned[n];
if not (thasitem(b, item)) then
table.remove(cloned, n);
num_items = num_items - 1;
else
n = n + 1;
end
end
return cloned;
end
local function splitset(a, b)
local n = 1;
local num_items = #a;
while ( n <= num_items ) do
local item = a[n];
if (thasitem(b, item)) then
table.remove(a, n);
num_items = num_items - 1;
else
n = n + 1;
end
end
end
-- Meta-table for weak keys and values.
local _wkv_mt = { __mode = "kv" };
function createFormulaLayoutManager(hint_name, MATH_LOCAL_DEBUG)
local manager = {};
-- Graph system for the calculation clouds and nodes.
local dependency_sys = createCalcDepGraphSystem();
local function createCloudManager(
data_init_cb, data_reset_cb, data_copyover_cb, twoitem_calc_cb, node_get_data_cb, node_get_dep_cb, node_get_childcount_cb, node_contains_node_cb,
data_paramstring_init_cb, data_paramstring_append_cb, data_paramstring_encapsulate_cb, node_get_paramstring_cb
)
-- Contains interdependent sets of rule-nodes. Each set represents one
-- state of calculation.
local calculation_clouds = {};
setmetatable(calculation_clouds, _wkv_mt);
local cloudMan = {};
local function createCalculationCloud(calcNodes)
calcNodes = cloneIndexedTable(calcNodes);
-- Used for storing calculation data.
local meta = {};
data_init_cb(meta);
-- Used for sheduling the calculation in dependency-order.
local dependency_node = dependency_sys.createDepNode();
for m,n in ipairs(calcNodes) do
node_get_dep_cb(n).setDependent(dependency_node);
end
local cloudUseCount = 1;
local cloud = {};
function cloud.reference()
cloudUseCount = cloudUseCount + 1;
end
function cloud.addNode(c)
table.insert(calcNodes, c);
node_get_dep_cb(c).setDependent(dependency_node);
end
function cloud.removeNode(c)
tremove(calcNodes, c);
node_get_dep_cb(c).unsetDependent(dependency_node);
end
function cloud.removeNodes(nodelist)
for m,n in ipairs(nodelist) do
tremove(calcNodes, n);
node_get_dep_cb(n).unsetDependent(dependency_node);
end
end
function cloud.getPartialCalcNodes()
return calcNodes;
end
local subclouds = {};
function cloud.getSubClouds()
return subclouds;
end
function cloud.addSubCloud(c)
table.insert(subclouds, c);
c.getDependencyNode().setDependent(dependency_node);
end
function cloud.setSubClouds(sub)
assert(#subclouds == 0);
subclouds = sub;
for m,n in ipairs(subclouds) do
n.getDependencyNode().setDependent(dependency_node);
end
end
function cloud.hasNoSubClouds()
return ( #subclouds == 0 );
end
function cloud.getNodeCount()
local numNodes = 0;
for m,n in ipairs(calcNodes) do
numNodes = numNodes + node_get_childcount_cb(n);
end
for m,n in ipairs(subclouds) do
numNodes = numNodes + n.getNodeCount();
end
return numNodes;
end
function cloud.containsNode(node)
for m,n in ipairs(calcNodes) do
if (node_contains_node_cb(n, node)) then
return true;
end
end
for m,n in ipairs(subclouds) do
if (n.containsNode(node)) then
return true;
end
end
return false;
end
function cloud.toparamstring()
local paramstring = {};
data_paramstring_init_cb(paramstring);
local function append_str_subcloud(subcloud)
local sub_paramstring = subcloud.toparamstring();
data_paramstring_append_cb(paramstring, sub_paramstring);
end
for m,n in ipairs(subclouds) do
append_str_subcloud(n);
end
for m,n in ipairs(calcNodes) do
local sub_paramstring = node_get_paramstring_cb(n);
data_paramstring_append_cb(paramstring, sub_paramstring);
end
data_paramstring_encapsulate_cb(paramstring);
return paramstring;
end
function cloud.tostring()
local paramstring = cloud.toparamstring();
if not (paramstring) then return ""; end;
return data_paramstring_tostring(paramstring);
end
local _tmp_calc_data = {};
data_init_cb(_tmp_calc_data);
function cloud.calculate()
-- Before you can calculate this cloud, you have to calculate all dependencies.
data_reset_cb(meta);
local function accountSubCloud(subCloud)
local sub_meta = subCloud.getMeta();
twoitem_calc_cb(meta, sub_meta);
end
for m,n in ipairs(subclouds) do
accountSubCloud(n);
end
for m,n in ipairs(calcNodes) do
node_get_data_cb(_tmp_calc_data, n);
twoitem_calc_cb(meta, _tmp_calc_data);
end
end
function cloud.getMeta()
return meta;
end
function cloud.clone()
local cloned = createCalculationCloud(calcNodes);
cloned.setSubClouds(cloneIndexedTable(subclouds));
data_copyover_cb(cloned.getMeta(), meta);
return cloned;
end
function cloud.extend(item)
if (cloudUseCount == 1) then
cloud.addNode(item);
return cloud;
end
local newCloud = cloud.clone();
newCloud.addNode(item);
return newCloud;
end
function cloud.drop()
if (cloudUseCount == 1) then
for m,n in ipairs(calcNodes) do
node_get_dep_cb(n).unsetDependent(dependency_node);
end
for m,n in ipairs(subclouds) do
n.getDependencyNode().unsetDependent(dependency_node);
end
calculation_clouds[cloud] = nil;
end
end
function dependency_node.calculate()
cloud.calculate();
end
function cloud.getDependencyNode()
return dependency_node;
end
function dependency_node.getDependencies()
local deps = {};
for m,n in ipairs(subclouds) do
table.insert(deps, n.getDependencyNode());
end
for m,n in ipairs(calcNodes) do
table.insert(deps, node_get_dep_cb(n));
end
return deps;
end
calculation_clouds[cloud] = cloud;
return cloud;
end
cloudMan.createCalculationCloud = createCalculationCloud;
local function find_biggest_common_nodeset(find_nodes)
local maxcount = false;
local set = false;
local source_cloud = false;
for m,n in pairs(calculation_clouds) do
local common_set = cutset(n.getPartialCalcNodes(), find_nodes);
local common_set_size = #common_set;
if (common_set_size > 0) then
if (maxcount == false) or (maxcount < common_set_size) then
maxcount = common_set_size;
set = common_set;
source_cloud = n;
end
end
end
return set, source_cloud;
end
-- Greedy-find best overlaps of one cloud with other clouds.
function cloudMan.greedyCloudAcquire(_nodes)
local new_nodes = cloneIndexedTable(_nodes);
local take_child_clouds = {};
local nodecount = #new_nodes;
while (true) do
local common_set, cloud = find_biggest_common_nodeset(new_nodes);
if not (common_set) then
break;
end
local common_set_size = #common_set;
if (MATH_GLOBAL_DEBUG) or (MATH_LOCAL_DEBUG) then
debugmsg("found common subset size: " .. common_set_size);
end
local cs_same_size_as_request = (common_set_size == nodecount);
local cs_same_size_as_found = false;
if (cloud.hasNoSubClouds()) then
cs_same_size_as_found = (common_set_size == cloud.getNodeCount());
end
if (cs_same_size_as_request) and (cs_same_size_as_found) and (#take_child_clouds == 0) then
cloud.reference();
return cloud;
end
if (cs_same_size_as_found) then
if (MATH_GLOBAL_DEBUG) or (MATH_LOCAL_DEBUG) then
debugmsg("cset entire size of source cloud, taking entire...");
end
table.insert(take_child_clouds, cloud);
cloud.reference();
else
cloud.removeNodes(common_set);
local newCloud = createCalculationCloud(common_set);
cloud.addSubCloud(newCloud);
newCloud.reference();
table.insert(take_child_clouds, newCloud);
end
splitset(new_nodes, common_set);
nodecount = #new_nodes;
if (cs_same_size_as_request) then
break;
end
end
if (MATH_GLOBAL_DEBUG) or (MATH_LOCAL_DEBUG) then
if (#take_child_clouds == 0) then
debugmsg("greedy-cloud-acquire: not sharing with any other clouds");
end
end
local newCloud = createCalculationCloud(new_nodes);
newCloud.setSubClouds(take_child_clouds);
return newCloud;
end
function cloudMan.getClouds()
return calculation_clouds;
end
return cloudMan;
end
local function bbox_paramstring_init(data)
data.x_minstr = false;
data.x_maxstr = false;
data.y_minstr = false;
data.y_maxstr = false;
data.is_multi_entry = false;
data.is_complex = false;
end
local function bbox_paramstring_append(data, append_data)
if (append_data.x_minstr) then
if (data.x_minstr) then
data.x_minstr = data.x_minstr .. ", ";
data.x_maxstr = data.x_maxstr .. ", ";
data.y_minstr = data.y_minstr .. ", ";
data.y_maxstr = data.y_maxstr .. ", ";
data.is_multi_entry = true;
else
data.x_minstr = "";
data.x_maxstr = "";
data.y_minstr = "";
data.y_maxstr = "";
end
data.x_minstr = data.x_minstr .. append_data.x_minstr;
data.x_maxstr = data.x_maxstr .. append_data.x_maxstr;
data.y_minstr = data.y_minstr .. append_data.y_minstr;
data.y_maxstr = data.y_maxstr .. append_data.y_maxstr;
end
end
local function bbox_paramstring_encapsulate(data)
if (data.is_multi_entry) then
data.x_minstr = "min(" .. data.x_minstr .. ")";
data.x_maxstr = "max(" .. data.x_maxstr .. ")";
data.y_minstr = "min(" .. data.y_minstr .. ")";
data.y_maxstr = "max(" .. data.y_maxstr .. ")";
data.is_complex = false;
end
end
local function bbox_paramstring_tostring(data)
if not (data.x_minstr) then
return "(empty)";
end
return
"min(x) = " .. data.x_minstr .. ", " ..
"max(x) = " .. data.x_maxstr .. ", " ..
"min(y) = " .. data.y_minstr .. ", " ..
"max(y) = " .. data.y_maxstr;
end
local function bbox_paramstring_from_node(node)
local nodeCloud = node.getChildCloud();
local paramstring = nodeCloud.toparamstring();
local local_w, local_h = node.getSize();
local x_minstr = paramstring.x_minstr;
local x_maxstr = paramstring.x_maxstr;
local y_minstr = paramstring.y_minstr;
local y_maxstr = paramstring.y_maxstr;
if not (x_minstr) then return false; end;
if (local_w) and (local_h) then
if not (x_minstr) then
x_minstr = "";
x_maxstr = "";
y_minstr = "";
y_maxstr = "";
else
x_minstr = x_minstr .. ", ";
x_maxstr = x_maxstr .. ", ";
y_minstr = y_minstr .. ", ";
y_maxstr = y_maxstr .. ", ";
paramstring.is_multi_entry = true;
end
x_minstr = x_minstr .. "0";
x_maxstr = x_maxstr .. local_w;
y_minstr = y_minstr .. "0";
y_maxstr = y_maxstr .. local_h;
end
if (paramstring.is_complex) then
x_minstr = "(" .. x_minstr .. ")";
x_maxstr = "(" .. x_maxstr .. ")";
y_minstr = "(" .. y_minstr .. ")";
y_maxstr = "(" .. y_maxstr .. ")";
end
x_minstr = local_x .. " + " .. x_minstr .. " * " .. local_scale;
x_maxstr = local_x .. " + " .. x_maxstr .. " * " .. local_scale;
y_minstr = local_y .. " + " .. y_minstr .. " * " .. local_scale;
y_maxstr = local_y .. " + " .. y_maxstr .. " * " .. local_scale;
paramstring.x_minstr = x_minstr;
paramstring.x_maxstr = x_maxstr;
paramstring.y_minstr = y_minstr;
paramstring.y_maxstr = y_maxstr;
paramstring.is_complex = true;
return paramstring;
end
local function minmax_meta_init(data)
data.bbox = createBoundingBox2D();
end
local function minmax_meta_reset(data)
data.bbox.reset();
end
local function minmax_meta_copyfrom(dst, src)
dst.bbox.setValues(src.bbox.getValues());
end
local function minmax_meta_twocalc(dst, calc)
dst.bbox.accountBounds(calc.bbox.getValues());
end
local function minmax_meta_fromnode(data, node)
local min_x, max_x, min_y, max_y = node.getParentSpaceValues();
data.bbox.setValues(min_x, max_x, min_y, max_y);
end
local function minmax_meta_depnode(node)
return node.getParentSpaceValuesNode();
end
local function minmax_meta_childcount(node)
return node.getChildCloud().getNodeCount();
end
local function minmax_meta_containsnode(node, insider)
return node.getChildCloud().containsNode(insider);
end
local function createMinMaxCloudManager()
return createCloudManager(
minmax_meta_init, minmax_meta_reset, minmax_meta_copyfrom, minmax_meta_twocalc,
minmax_meta_fromnode, minmax_meta_depnode, minmax_meta_childcount, minmax_meta_containsnode,
bbox_paramstring_init, bbox_paramstring_append, bbox_paramstring_encapsulate,
bbox_paramstring_from_node
);
end
local function border_minmax_meta_fromnode(data, node)
local min_x, max_x, min_y, max_y = node.getParentSpaceBorderValues();
data.bbox.setValues(min_x, max_x, min_y, max_y);
end
local function border_minmax_meta_depnode(node)
return node.getParentSpaceBorderValuesNode();
end
local function border_minmax_meta_childcount(node)
return node.getBorderCloud().getNodeCount();
end
local function border_minmax_meta_containsnode(node, insider)
return node.getBorderCloud().containsNode(insider);
end
local function border_bbox_paramstring_from_node(node)
-- TODO implement when actually required.
assert( false );
end
local function createBorderMinMaxCloudManager()
return createCloudManager(
minmax_meta_init, minmax_meta_reset, minmax_meta_copyfrom, minmax_meta_twocalc,
border_minmax_meta_fromnode, border_minmax_meta_depnode, border_minmax_meta_childcount, border_minmax_meta_containsnode,
bbox_paramstring_init, bbox_paramstring_append, bbox_paramstring_encapsulate,
border_bbox_paramstring_from_node
);
end
local globalCloudMan = createMinMaxCloudManager();
local globalBorderCloudMan = createBorderMinMaxCloudManager();
-- All nodes of this system, but not limited to one drawing hierarchy.
local nodes = {};
setmetatable(nodes, _wkv_mt);
-- Creates a node that is executed after calculation of the dependencies.
function manager.createLayoutNode(init_x, init_y, init_w, init_h, init_scale, parentNode, dependingOnNodes, nearby_callback, init_children_callback)
local local_x = init_x;
local local_y = init_y;
local local_w = init_w;
local local_h = init_h;
local local_scale = init_scale;
local node = {};
function node.setInitPos(x, y)
init_x = x;
init_y = y;
end
function node.setInitSize(w, h)
init_w = w;
init_h = h;
end
function node.setInitScale(scale)
init_scale = scale;
end
local function check_parent_of_deps(deps)
for m,n in ipairs(deps) do
if not (n.getParent() == parentNode) then
error("dependencies of node must have same parent as node", 3);
end
end
end
local children_callbacks = {};
-- Calculation hierarchy dependency nodes.
local local_dep_node = dependency_sys.createDepNode();
function node.getLocalDepNode()
return local_dep_node;
end
-- Children nodes in the hierarchy.
local childrenNodes = {};
local dependencies = {};
local function createDependency(dcnodes, cb)
check_parent_of_deps(dcnodes);
local depinfo = {};
depinfo.cloud = globalCloudMan.greedyCloudAcquire(dcnodes);
depinfo.cb = cb;
depinfo.cloud.getDependencyNode().setDependent(local_dep_node);
dependencies[depinfo] = depinfo;
return depinfo;
end
local function removeDependency(depinfo)
depinfo.cloud.getDependencyNode().unsetDependent(local_dep_node);
dependencies[depinfo] = nil;
end
if (dependingOnNodes) then
createDependency(dependingOnNodes, nearby_callback);
end
-- Border calculation semantics.
local border_left = 0;
local border_right = 0;
local border_top = 0;
local border_bottom = 0;
local borderNodeCloud = globalBorderCloudMan.greedyCloudAcquire(nil);
function node.setBorder(t, l, b, r)
border_top = t;
border_left = l;
border_bottom = b;
border_right = r;
end
function node.getBorder()
return border_top, border_left, border_bottom, border_right;
end
function node.getBorderCloud()
return borderNodeCloud;
end
local border_dependencies = {};
-- Cloud for calculation of the entire layout.
local nodeCloud = globalCloudMan.greedyCloudAcquire(nil);
local local_tmp_bbox = createBoundingBox2D();
local abs_x = false;
local abs_y = false;
local abs_scale = false;
function local_dep_node.calculate()
-- Initialize the local parameters.
local_x = init_x;
local_y = init_y;
local_w = init_w;
local_h = init_h;
local_scale = init_scale;
for m,n in pairs(dependencies) do
local depCloud = n.cloud;
local dep_min_x, dep_max_x, dep_min_y, dep_max_y = depCloud.getMeta().bbox.getValues();
local new_local_x, new_local_y, new_local_w, new_local_h, new_local_scale =
n.cb( dep_min_x, dep_max_x, dep_min_y, dep_max_y );
if (new_local_x) then
local_x = new_local_x;
end
if (new_local_y) then
local_y = new_local_y;
end
if (new_local_w) then
local_w = new_local_w;
end
if (new_local_h) then
local_h = new_local_h;
end
if (new_local_scale) then
local_scale = new_local_scale;
end
end
local function calc_child_bbox()
local_tmp_bbox.setValues(nodeCloud.getMeta().bbox.getValues());
if (local_w) and (local_h) then
local_tmp_bbox.accountBounds(0, local_w, 0, local_h);
end
return local_tmp_bbox.getValues();
end
if (#border_dependencies >= 1) then
for m,n in ipairs(border_dependencies) do
local_tmp_bbox.setValues(borderNodeCloud.getMeta().bbox.getValues());
if (local_w) and (local_h) then
local border_minx = -border_left;
local border_maxx = local_w + border_right;
local border_miny = -border_top;
local border_maxy = local_h + border_bottom;
local_tmp_bbox.accountBounds(border_minx, border_maxx, border_miny, border_maxy);
end
local curobj_border_minx, curobj_border_maxx, curobj_border_miny, curobj_border_maxy = local_tmp_bbox.getValues();
local child_local_minx, child_local_maxx, child_local_miny, child_local_maxy = calc_child_bbox();
if (child_local_minx) and (curobj_border_minx) then
local curobj_border_left = ( child_local_minx - curobj_border_minx );
local curobj_border_right = ( curobj_border_maxx - child_local_maxx );
local curobj_border_top = ( child_local_miny - curobj_border_miny );
local curobj_border_bottom = ( curobj_border_maxy - child_local_maxy );
local depCloud = n.bound_cloud;
local borderCloud = n.cloud;
local border_minx, border_maxx, border_miny, border_maxy = borderCloud.getMeta().bbox.getValues();
local dep_minx, dep_maxx, dep_miny, dep_maxy = depCloud.getMeta().bbox.getValues();
if (border_minx) and (dep_minx) then
local dep_border_left = ( dep_minx - border_minx );
local dep_border_top = ( dep_miny - border_miny );
local dep_border_right = ( border_maxx - dep_maxx );
local dep_border_bottom = ( border_maxy - dep_maxy );
if (dep_border_left < curobj_border_left) then
dep_border_left = curobj_border_left;
end
if (dep_border_top < curobj_border_top) then
dep_border_top = curobj_border_top;
end
if (dep_border_right < curobj_border_right) then
dep_border_right = curobj_border_right;
end
if (dep_border_bottom < curobj_border_bottom) then
dep_border_bottom = curobj_border_bottom;
end
local keepdist_minx = ( dep_minx - dep_border_left );
local keepdist_maxx = ( dep_maxx + dep_border_right );
local keepdist_miny = ( dep_miny - dep_border_top );
local keepdist_maxy = ( dep_maxy + dep_border_bottom );
local new_local_x, new_local_y, new_local_w, new_local_h, new_local_scale = n.cb( keepdist_minx, keepdist_maxx, keepdist_miny, keepdist_maxy );
if (new_local_x) then
local_x = new_local_x;
end
if (new_local_y) then
local_y = new_local_y;
end
if (new_local_w) then
local_w = new_local_w;
end
if (new_local_h) then
local_h = new_local_h;
end
if (new_local_scale) then
local_scale = new_local_scale;
end
end
end
end
end
for m,n in ipairs(children_callbacks) do
local child_local_minx, child_local_maxx, child_local_miny, child_local_maxy = calc_child_bbox();
local new_local_x, new_local_y, new_local_w, new_local_h, new_local_scale =
n(child_local_minx, child_local_maxx, child_local_miny, child_local_maxy);
if (new_local_x) then
local_x = new_local_x;
end
if (new_local_y) then
local_y = new_local_y;
end
if (new_local_w) then
local_w = new_local_w;
end
if (new_local_h) then
local_h = new_local_h;
end
if (new_local_scale) then
local_scale = new_local_scale;
end
end
end
function local_dep_node.getDependencies()
local deps = {};
for m,n in pairs(dependencies) do
table.insert(deps, n.cloud.getDependencyNode());
end
for m,n in ipairs(border_dependencies) do
table.insert(deps, n.cloud.getDependencyNode());
table.insert(deps, n.bound_cloud.getDependencyNode());
end
local has_border_deps = (#border_dependencies >= 1);
if (has_border_deps) then
table.insert(deps, borderNodeCloud.getDependencyNode());
end
if (#children_callbacks >= 1) or (has_border_deps) then
table.insert(deps, nodeCloud.getDependencyNode());
end
return deps;
end
function node.addChildrenCallback(cb)
table.insert(children_callbacks, cb);
if (#children_callbacks == 1) then
nodeCloud.getDependencyNode().setDependent(local_dep_node);
end
end
function node.removeChildrenCallback(cb)
tremove(children_callbacks, cb);
if (#children_callbacks == 0) and (#border_dependencies == 0) then
nodeCloud.getDependencyNode().unsetDependent(local_dep_node);
end
end
function node.clearChildrenCallbacks()
children_callbacks = {};
if (#border_dependencies == 0) then
nodeCloud.getDependencyNode().unsetDependent(local_dep_node);
end
end
node.addChildrenCallback(init_children_callback);
local abs_dep_node = dependency_sys.createDepNode();
function abs_dep_node.calculate()
local parent_x, parent_y, parent_scale;
if (parentNode) then
parent_x, parent_y = parentNode.getAbsolutePos();
parent_scale = parentNode.getAbsoluteScale();
else
parent_x = 0;
parent_y = 0;
parent_scale = 1;
end
-- Calculate the absolute parameters of the node.
-- Should be fine since we have proper local parameters now.
if (parent_x) and (parent_y) and (parent_scale) and (local_x) and (local_y) then
abs_x = ( local_x * parent_scale + parent_x );
abs_y = ( local_y * parent_scale + parent_y );
else
abs_x = false;
abs_y = false;
end
if (parent_scale) and (local_scale) then
abs_scale = ( parent_scale * local_scale );
else
abs_scale = false;
end
end
function node.getAbsoluteDepNode()
return abs_dep_node;