-
Notifications
You must be signed in to change notification settings - Fork 0
/
zonefunc.js
283 lines (251 loc) · 5.82 KB
/
zonefunc.js
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
const ndcls = require('ndtreejs').ndcls
const {dcp} = require('./util.js')
function get_ledge(z) {
return({sx:z.l,sy:z.t,ex:z.l,ey:z.b})
}
function get_redge(z) {
return({sx:z.r,sy:z.t,ex:z.r,ey:z.b})
}
function get_tedge(z) {
return({sx:z.l,sy:z.t,ex:z.r,ey:z.t})
}
function get_bedge(z) {
return({sx:z.l,sy:z.b,ex:z.r,ey:z.b})
}
function edge_eq(e0,e1) {
let cond0 = (e0.sx === e1.sx)
let cond1 = (e0.sy === e1.sy)
let cond2 = (e0.ex === e1.ex)
let cond3 = (e0.ey === e1.ey)
return(cond0 && cond1 && cond2 && cond3)
}
function is_ladj_of(z0,z1) {
let redge = get_redge(z0)
let ledge = get_ledge(z1)
let rlngth = redge.ey - redge.sy + 1
let llngth = ledge.ey - ledge.sy + 1
let cond0 = (llngth === rlngth)
let cond1 = ((redge.sx + 1) === ledge.sx)
let cond2 = (z0.t === z1.t)
return(cond0 && cond1 && cond2)
}
function is_radj_of(z0,z1) {
return(is_ladj_of(z1,z0))
}
function is_tadj_of(z0,z1) {
let bedge = get_bedge(z0)
let tedge = get_tedge(z1)
let blngth = bedge.ex - bedge.sx + 1
let tlngth = tedge.ex - tedge.sx + 1
let cond0 = (blngth === tlngth)
let cond1 = ((bedge.ey + 1) === tedge.sy)
let cond2 = (z0.l === z1.l)
return(cond0 && cond1 && cond2)
}
function is_badj_of(z0,z1) {
return(is_tadj_of(z1,z0))
}
function zones2znds(zones) {
let znds = zones.map(zone=>{let nd = new ndcls.Tree();nd.zone = zone;return(nd)})
return(znds)
}
function sort_znds_l2r(znds) {
znds.sort(
function(a,b) {
return(a.zone.l-b.zone.l)
}
)
return(znds)
}
function sort_znds_t2b(znds) {
znds.sort(
function(a,b) {
return(a.zone.t-b.zone.t)
}
)
return(znds)
}
function sort_znds_tl2br(znds) {
znds.sort(
function(a,b) {
let cond = (a.zone.t-b.zone.t)
if(cond === 0) {
return(a.zone.l-b.zone.l)
} else {
return(cond)
}
}
)
return(znds)
}
function sort_znds_lt2rb(znds) {
znds.sort(
function(a,b) {
let cond = (a.zone.l-b.zone.l)
if(cond === 0) {
return(a.zone.t-b.zone.t)
} else {
return(cond)
}
}
)
return(znds)
}
function lppend(znd0,znd1) {
let z = {
t:znd1.zone.t,
l:znd1.zone.l,
b:znd0.zone.b,
r:znd0.zone.r,
type:'col'
}
let pznd = new ndcls.Tree()
pznd.zone = z
pznd.$append_child(znd1)
pznd.$append_child(znd0)
return(pznd)
}
function rppend(znd0,znd1) {
let z = {
t:znd0.zone.t,
l:znd0.zone.l,
b:znd1.zone.b,
r:znd1.zone.r,
type:'col'
}
let pznd = new ndcls.Tree()
pznd.zone = z
pznd.$append_child(znd0)
pznd.$append_child(znd1)
return(pznd)
}
function tppend(znd0,znd1) {
let z = {
t:znd1.zone.t,
l:znd1.zone.l,
b:znd0.zone.b,
r:znd0.zone.r,
type:'row'
}
let pznd = new ndcls.Tree()
pznd.zone = z
pznd.$append_child(znd1)
pznd.$append_child(znd0)
return(pznd)
}
function bppend(znd0,znd1) {
let z = {
t:znd0.zone.t,
l:znd0.zone.l,
b:znd1.zone.b,
r:znd1.zone.r,
type:'row'
}
let pznd = new ndcls.Tree()
pznd.zone = z
pznd.$append_child(znd0)
pznd.$append_child(znd1)
return(pznd)
}
function iter_next_l2r(d) {
unhandled = d.unhandled
handled = d.handled
let znd = unhandled[0]
let next_unhandled = []
for(let i=1;i<unhandled.length;i++){
let other = unhandled[i]
let cond = is_radj_of(other.zone,znd.zone)
if(cond) {
znd = rppend(znd,other)
} else {
next_unhandled.push(other)
}
}
handled.push(znd)
unhandled = next_unhandled
return({handled:handled,unhandled:unhandled})
}
function iter_next_t2b(d) {
unhandled = d.unhandled
handled = d.handled
let znd = unhandled[0]
let next_unhandled = []
for(let i=1;i<unhandled.length;i++){
let other = unhandled[i]
let cond = is_badj_of(other.zone,znd.zone)
if(cond) {
znd = bppend(znd,other)
} else {
next_unhandled.push(other)
}
}
handled.push(znd)
unhandled = next_unhandled
return({handled:handled,unhandled:unhandled})
}
function agg_l2r(znds) {
let unhandled = sort_znds_lt2rb(znds)
let handled =[]
d = {unhandled:unhandled,handled:handled}
while(d.unhandled.length>0) {
d = iter_next_l2r(d)
}
return(d.handled)
}
function agg_t2b(znds) {
let unhandled = sort_znds_tl2br(znds)
let handled =[]
d = {unhandled:unhandled,handled:handled}
while(d.unhandled.length>0) {
d = iter_next_t2b(d)
}
return(d.handled)
}
function znds2tree(znds) {
while(znds.length>1) {
let l2r_agg = agg_l2r(znds.map(znd=>znd.$clone()))
let t2b_agg = agg_t2b(znds.map(znd=>znd.$clone()))
if(t2b_agg.length<l2r_agg.length) {
znds = t2b_agg
} else {
znds = l2r_agg
}
}
return(znds[0])
}
function show_znd_tree(tree) {
let sdfs = tree.$sdfs()
for(let i=0;i<sdfs.length;i++) {
let z = sdfs[i]
let depth = z.$depth()
let indent = ' '.repeat(depth)+i+':'
let tag = (z.zone.type === undefined)?z.zone.rune:z.zone.type
console.log(indent+tag)
}
}
module.exports = {
get_ledge,
get_redge,
get_tedge,
get_bedge,
edge_eq,
is_ladj_of,
is_radj_of,
is_tadj_of,
is_badj_of,
zones2znds,
sort_znds_l2r,
sort_znds_t2b,
sort_znds_tl2br,
sort_znds_lt2rb,
lppend,
rppend,
tppend,
bppend,
iter_next_l2r,
iter_next_t2b,
agg_l2r,
agg_t2b,
znds2tree,
show_znd_tree,
}