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
211 lines (164 loc) · 6.96 KB
/
Copy pathsetoperations.livecodescript
File metadata and controls
211 lines (164 loc) · 6.96 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
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 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
/*
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 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