forked from livecode/livecode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsetoperations.livecodescript
More file actions
469 lines (394 loc) · 15.2 KB
/
Copy pathsetoperations.livecodescript
File metadata and controls
469 lines (394 loc) · 15.2 KB
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
script "CoreArraySetOp"
/*
Copyright (C) 2015 LiveCode Ltd.
This file is part of LiveCode.
LiveCode is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License v3 as published by the Free
Software Foundation.
LiveCode is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with LiveCode. If not see <http://www.gnu.org/licenses/>. */
/*
Semantics of array union:
function ArrayUnion(pLeft, pRight, pRecursive)
repeat for each key tKey in pRight
if tKey is not among the keys of pLeft then
put pRight[tKey] into pLeft[tKey]
else if pRecursive then
put ArrayUnion(pLeft[tKey], pRight[tKey], true) into pLeft[tKey]
end if
end repeat
return pLeft
end ArrayUnion
*/
on TestArrayUnion
local tString1
put "a" into tString1
union tString1 with "b"
TestAssert "union: left non-array, right non-array", tString1 is "a"
local tString2, tFixedArray
put "a" into tString2
put "b" into tFixedArray[1]
union tString2 with tFixedArray
TestAssert "union: left non-array, right array", tString2[1] is "b"
local tArray1
put "a" into tArray1[1]
union tArray1 with "b"
TestAssert "union: left array, right non-array", tArray1[1] is "a"
local tArray2
put "a" into tArray2[1]
union tArray2 with tFixedArray
TestAssert "union: left array, right array, same key", tArray2[1] is "a"
local tArray3
put "c" into tArray3[2]
union tArray3 with tFixedArray
TestAssert "union: left array, right array, existing key", tArray3[2] is "c"
TestAssert "union: left array, right array, additional key", tArray3[1] is "b"
end TestArrayUnion
on TestArrayUnionInto
local tLeft, tRight, tOut
put "a" into tLeft[1]
put "b" into tRight[2]
union tLeft with tRight into tOut
TestAssert "union into: left array unchanged", \
the number of elements in tLeft is 1 and \
tLeft[1] is "a"
TestAssert "union into: right array unchanged", \
the number of elements in tRight is 1 and \
tRight[2] is "b"
TestAssert "union into: out correct", \
the number of elements in tOut is 2 and \
tOut[1] is "a" and \
tOut[2] is "b"
end TestArrayUnionInto
on TestNestedArrayNonRecursiveUnion
local tLeftArray2, tRightArray2
put "a" into tLeftArray2[1]
put "b" into tRightArray2[1][1]
union tLeftArray2 with tRightArray2
TestAssert "non-recursive union: left value non-array, right value array", tLeftArray2[1] is "a"
local tLeftArray4, tRightArray4
put "a" into tLeftArray4[1][1]
put "b" into tRightArray4[1][2]
union tLeftArray4 with tRightArray4
TestAssert "non-recursive union: left value array, right value array, additional key", tLeftArray4[1][2] is empty
end TestNestedArrayNonRecursiveUnion
on TestNestedArrayRecursiveUnion
local tLeftArray1, tRightArray1
put "a" into tLeftArray1[1]
put "b" into tRightArray1[1]
union tLeftArray1 with tRightArray1 recursively
TestAssert "recursive union: left value non-array, right value non-array", tLeftArray1[1] is "a"
local tLeftArray2, tRightArray2
put "a" into tLeftArray2[1]
put "b" into tRightArray2[1][1]
union tLeftArray2 with tRightArray2 recursively
TestAssert "recursive union: left value non-array, right value array", tLeftArray2[1][1] is "b"
local tLeftArray3, tRightArray3
put "a" into tLeftArray3[1][1]
put "b" into tRightArray3[1]
union tLeftArray3 with tRightArray3 recursively
TestAssert "recursive union: left value array, right value non-array", tLeftArray3[1][1] is "a"
local tLeftArray4, tRightArray4
put "a" into tLeftArray4[1][1]
put "b" into tRightArray4[1][2]
union tLeftArray4 with tRightArray4 recursively
TestAssert "recursive union: left value array, right value array, existing key", tLeftArray4[1][1] is "a"
TestAssert "recursive union: left value array, right value array, additional key", tLeftArray4[1][2] is "b"
end TestNestedArrayRecursiveUnion
on TestArrayRecursiveUnionInto
local tLeft, tRight, tOut
put "a" into tLeft[1][1]
put "b" into tRight[1][2]
union tLeft with tRight recursively into tOut
TestAssert "union into: left array unchanged", \
the number of elements in tLeft is 1 and \
the number of elements in tLeft[1] is 1 and \
tLeft[1][1] is "a"
TestAssert "union into: right array unchanged", \
the number of elements in tRight is 1 and \
the number of elements in tRight[1] is 1 and \
tRight[1][2] is "b"
TestAssert "union into: out correct", \
the number of elements in tOut is 1 and \
the number of elements in tOut[1] is 2 and \
tOut[1][1] is "a" and \
tOut[1][2] is "b"
end TestArrayRecursiveUnionInto
/*
Semantics of array symmetric difference:
function ArraySymmetricDifference(pLeft, pRight)
repeat for each key tKey in pRight
if tKey is not among the keys of pLeft then
put pRight[tKey] into pLeft[tKey]
else
delete variable pLeft[tKey]
end if
end repeat
return pLeft
end ArraySymmetricDifference
*/
on TestArraySymmetricDifference
local tLeftNonArray, tRightNonArray
put "a" into tLeftNonArray
put "b" into tRightNonArray
symmetric difference tLeftNonArray with tRightNonArray
TestAssert "symmetric difference: left non-array, right non-array", tLeftNonArray is "a"
local tRightArray
put "a" into tLeftNonArray
put "b" into tRightArray[1]
symmetric difference tLeftNonArray with tRightArray
TestAssert "symmetric difference: left non-array, right array", tLeftNonArray[1] is "b"
local tLeftArray
put "a" into tLeftArray[1]
symmetric difference tLeftArray with tRightNonArray
TestAssert "symmetric difference: left array, right non-array", tLeftArray[1] is "a"
put empty into tLeftArray
put "a" into tLeftArray[1]
put empty into tRightArray
put "b" into tRightArray[1]
symmetric difference tLeftArray with tRightArray
TestAssert "symmetric difference: left array, right array, same key", \
tLeftArray is not an array
put empty into tLeftArray
put "a" into tLeftArray[1]
put empty into tRightArray
put "b" into tRightArray[1]
put "c" into tRightArray[2]
symmetric difference tLeftArray with tRightArray
TestAssert "symmetric difference: left array, right array, right superset of left", \
"1" is not among the keys of tLeftArray and tLeftArray[2] is "c"
put empty into tLeftArray
put "a" into tLeftArray[1]
put "c" into tLeftArray[2]
put empty into tRightArray
put "b" into tRightArray[1]
symmetric difference tLeftArray with tRightArray
TestAssert "symmetric difference: left array, right array, right subset of left", \
"1" is not among the keys of tLeftArray and tLeftArray[2] is "c"
put empty into tLeftArray
put "a" into tLeftArray[1]
put "c" into tLeftArray[2]
put empty into tRightArray
put "b" into tRightArray[1]
put "d" into tRightArray[3]
symmetric difference tLeftArray with tRightArray
TestAssert "symmetric difference: left array, right array, neither is subset of other", \
the number of elements in tLeftArray is 2 and \
"1" is not among the keys of tLeftArray and \
tLeftArray[2] is "c" and \
tLeftArray[3] is "d"
end TestArraySymmetricDifference
on TestArraySymmetricDifferenceInto
local tLeft, tRight, tOut
put "a" into tLeft[1]
put "b" into tRight[2]
symmetric difference tLeft with tRight into tOut
TestAssert "symmetric difference into: left array unchanged", \
the number of elements in tLeft is 1 and \
tLeft[1] is "a"
TestAssert "symmetric difference into: right array unchanged", \
the number of elements in tRight is 1 and \
tRight[2] is "b"
TestAssert "symmetric difference into: out correct", \
the number of elements in tOut is 2 and \
tOut[1] is "a" and \
tOut[2] is "b"
end TestArraySymmetricDifferenceInto
/*
Semantics of array intersect:
function ArrayIntersect(pLeft, pRight, pRecursive)
repeat for each key tKey in pLeft
if tKey is not among the keys of pRight then
delete variable pLeft[tKey]
else if pRecursive then
put ArrayIntersect(pLeft[tKey], pRight[tKey], true) into pLeft[tKey]
end if
end repeat
return pLeft
end ArrayIntersect
*/
on TestArrayIntersect
local tString1
put "a" into tString1
intersect tString1 with "b"
TestAssert "intersect: left non-array, right non-array", tString1 is "a"
local tString2, tFixedArray
put "a" into tString2
put "b" into tFixedArray[1]
intersect tString2 with tFixedArray
TestAssert "intersect: left non-array, right array", tString2 is "a"
local tArray1
put "a" into tArray1[1]
intersect tArray1 with "b"
TestAssert "intersect: left array, right non-array", tArray1 is empty
local tArray2
put "a" into tArray2[1]
intersect tArray2 with tFixedArray
TestAssert "intersect: left array, right array, same key", tArray2[1] is "a"
local tLeftArray3, tRightArray3
put "a" into tLeftArray3[1]
put "b" into tLeftArray3[2]
put "c" into tRightArray3[2]
put "d" into tRightArray3[3]
intersect tLeftArray3 with tRightArray3
TestAssert "intersect: left array, right array, key present in left not right", tLeftArray3[1] is empty
TestAssert "intersect: left array, right array, key present in right not left", tLeftArray3[3] is empty
TestAssert "intersect: left array, right array, key present in left and right", tLeftArray3[2] is "b"
end TestArrayIntersect
on TestArrayIntersectInto
local tLeft, tRight, tOut
put "a" into tLeft[1]
put "c" into tLeft[2]
put "b" into tRight[2]
put "d" into tRight[3]
intersect tLeft with tRight into tOut
TestAssert "intersect into: left array unchanged", \
the number of elements in tLeft is 2 and \
tLeft[1] is "a" and tLeft[2] is "c"
TestAssert "intersect into: right array unchanged", \
the number of elements in tRight is 2 and \
tRight[2] is "b" and tRight[3] is "d"
TestAssert "intersect into: out correct", \
the number of elements in tOut is 1 and \
tOut[2] is "c"
end TestArrayIntersectInto
on TestNestedArrayNonRecursiveIntersect
local tLeftArray2, tRightArray2
put "a" into tLeftArray2[1]
put "b" into tRightArray2[1][1]
intersect tLeftArray2 with tRightArray2
TestAssert "non-recursive intersect: left value non-array, right value array", tLeftArray2[1] is "a"
local tLeftArray4, tRightArray4
put "a" into tLeftArray4[1][1]
put "b" into tRightArray4[1][2]
intersect tLeftArray4 with tRightArray4
TestAssert "non-recursive intersect: left value array, right value array, additional key", tLeftArray4[1][1] is "a"
end TestNestedArrayNonRecursiveIntersect
on TestNestedArrayRecursiveIntersect
local tLeftArray1, tRightArray1
put "a" into tLeftArray1[1]
put "b" into tRightArray1[1]
intersect tLeftArray1 with tRightArray1 recursively
TestAssert "recursive intersect: left value non-array, right value non-array", tLeftArray1[1] is "a"
local tLeftArray2, tRightArray2
put "a" into tLeftArray2[1]
put "b" into tRightArray2[1][1]
intersect tLeftArray2 with tRightArray2 recursively
TestAssert "recursive intersect: left value non-array, right value array", tLeftArray2[1] is "a"
local tLeftArray3, tRightArray3
put "a" into tLeftArray3[1][1]
put "b" into tRightArray3[1]
intersect tLeftArray3 with tRightArray3 recursively
TestAssert "recursive intersect: left value array, right value non-array", tLeftArray3[1] is empty
local tLeftArray4, tRightArray4
put "a" into tLeftArray4[1][1]
put "b" into tLeftArray4[1][2]
put "c" into tRightArray4[1][2]
put "d" into tRightArray4[1][3]
intersect tLeftArray4 with tRightArray4 recursively
TestAssert "recursive intersect: left value array, right value array, key present in left not right", tLeftArray4[1][1] is empty
TestAssert "recursive intersect: left value array, right value array, key present in right not left", tLeftArray4[1][3] is empty
TestAssert "recursive intersect: left value array, right value array, key present in left and right", tLeftArray4[1][2] is "b"
end TestNestedArrayRecursiveIntersect
on TestArrayRecursiveIntersectInto
local tLeft, tRight, tOut
put "a" into tLeft[1][1]
put "c" into tLeft[1][2]
put "b" into tRight[1][2]
put "d" into tRight[1][3]
intersect tLeft with tRight recursively into tOut
TestAssert "intersect into: left array unchanged", \
the number of elements in tLeft is 1 and \
the number of elements in tLeft[1] is 2 and \
tLeft[1][1] is "a" and tLeft[1][2] is "c"
TestAssert "intersect into: right array unchanged", \
the number of elements in tRight is 1 and \
the number of elements in tRight[1] is 2 and \
tRight[1][2] is "b" and tRight[1][3] is "d"
TestAssert "intersect into: out correct", \
the number of elements in tOut is 1 and \
the number of elements in tOut[1] is 1 and \
tOut[1][2] is "c"
end TestArrayRecursiveIntersectInto
/*
Semantics of array difference:
function ArrayDifference(pLeft, pRight)
repeat for each key tKey in pLeft
if tKey is among the keys of pRight then
delete variable pLeft[tKey]
end if
end repeat
return pLeft
end ArrayDifference
*/
on TestArrayDifference
local tLeftNonArray, tRightNonArray
put "a" into tLeftNonArray
put "b" into tRightNonArray
difference tLeftNonArray with tRightNonArray
TestAssert "difference: left non-array, right non-array", tLeftNonArray is "a"
local tRightArray
put "a" into tLeftNonArray
put "b" into tRightArray[1]
difference tLeftNonArray with tRightArray
TestAssert "difference: left non-array, right array", tLeftNonArray is "a"
local tLeftArray
put "a" into tLeftArray[1]
difference tLeftArray with tRightNonArray
TestAssert "difference: left array, right non-array", tLeftArray[1] is "a"
put empty into tLeftArray
put "a" into tLeftArray[1]
put empty into tRightArray
put "b" into tRightArray[1]
difference tLeftArray with tRightArray
TestAssert "difference: left array, right array, same key", \
tLeftArray is not an array
put empty into tLeftArray
put "a" into tLeftArray[1]
put empty into tRightArray
put "b" into tRightArray[1]
put "c" into tRightArray[2]
difference tLeftArray with tRightArray
TestAssert "difference: left array, right array, right superset of left", \
tLeftArray is not an array
put empty into tLeftArray
put "a" into tLeftArray[1]
put "c" into tLeftArray[2]
put empty into tRightArray
put "b" into tRightArray[1]
difference tLeftArray with tRightArray
TestAssert "difference: left array, right array, right subset of left", \
the number of elements in tLeftArray is 1 and \
tLeftArray[2] is "c"
put empty into tLeftArray
put "a" into tLeftArray[1]
put "c" into tLeftArray[2]
put empty into tRightArray
put "b" into tRightArray[1]
put "d" into tRightArray[3]
difference tLeftArray with tRightArray
TestAssert "difference: left array, right array, neither is subset of other", \
the number of elements in tLeftArray is 1 and \
tLeftArray[2] is "c"
end TestArrayDifference
on TestArrayDifferenceInto
local tLeft, tRight, tOut
put "a" into tLeft[1]
put "c" into tLeft[2]
put "b" into tRight[2]
put "d" into tRight[3]
difference tLeft with tRight into tOut
TestAssert "difference into: left array unchanged", \
the number of elements in tLeft is 2 and \
tLeft[1] is "a" and tLeft[2] is "c"
TestAssert "difference into: right array unchanged", \
the number of elements in tRight is 2 and \
tRight[2] is "b" and tRIght[3] is "d"
TestAssert "difference into: out correct", \
the number of elements in tOut is 1 and \
tOut[1] is "a"
end TestArrayDifferenceInto