-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathChunkedListTests.fs
407 lines (402 loc) · 17.8 KB
/
ChunkedListTests.fs
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
namespace SageSerpent.Infrastructure.Tests
open NUnit.Framework
open System
open SageSerpent.Infrastructure
open SageSerpent.Infrastructure.RandomExtensions
open SageSerpent.Infrastructure.ChunkedListExtensions
type ContenderTriumvirate =
{
ChunkedList: ChunkedList<Int32>
List: List<Int32>
Array: array<Int32>
}
type Decision =
Cons
| ConsWithPotentialDuplicate
| Append
| StartANewDoubleton
| StartABigChunk
| StartABigArrayChunk
| StartASingletonArrayChunk
| StartAnEmptyArrayChunk
| StartANewDuplicateDoubleton
| Halve
| SliceOneOff
[<TestFixture>]
type ChunkedListTestFixture () =
[<Test>]
member this.AnythingListCanDoICanDoBetterICanDoAnythingBetterThanArray () =
let seed =
74339105
let numberOfTrials =
1000
let random =
Random seed
let choices =
[| Cons; ConsWithPotentialDuplicate; Append; StartANewDoubleton; StartABigChunk; StartABigArrayChunk; StartASingletonArrayChunk; StartAnEmptyArrayChunk; StartANewDuplicateDoubleton; Halve; SliceOneOff |]
let decisions =
List.init numberOfTrials
(fun _ ->
random.ChooseOneOf choices)
let checkEquivalenceOfContenders {
ChunkedList = chunkedList
List = list
Array = array
} =
printf "Checking: %A\n" [ yield! chunkedList ]
let shouldBeTrue =
chunkedList
|> ChunkedList.toArray
|> Array.rev
|> BargainBasement.IsSorted // This is by construction of each new triumvirate - what
// we are really checking is that the order of elements is
// preserved via 'Cons' and 'append'.
Assert.IsTrue shouldBeTrue
let tripleResultsAgree (first
, second
, third) =
first = second
&& second = third
let shouldBeTrue =
(ChunkedList.length chunkedList
, List.length list
, Array.length array)
|> tripleResultsAgree
Assert.IsTrue shouldBeTrue
let shouldBeTrue =
(ChunkedList.isEmpty chunkedList
, List.isEmpty list
, Array.isEmpty array)
|> tripleResultsAgree
Assert.IsTrue shouldBeTrue
match chunkedList
, list with
Nil
, [] ->
()
| ChunkedListExtensions.Cons(headFromChunkedList
, tailFromChunkedList)
, headFromList :: tailFromList ->
let shouldBeTrue =
headFromChunkedList = headFromList
Assert.IsTrue shouldBeTrue
let shouldBeTrue =
tailFromChunkedList
= (tailFromList
|> ChunkedList.ofList)
Assert.IsTrue shouldBeTrue
| _ ->
Assert.Fail "Mismatch between 'ChunkedList' and 'List' decompositions."
let shouldBeTrue =
(ChunkedList.toList chunkedList
, list
, Array.toList array)
|> tripleResultsAgree
Assert.IsTrue shouldBeTrue
let sharedLength =
ChunkedList.length chunkedList
let shouldBeTrue =
Nil = chunkedList.[.. -1]
&& Array.empty = array.[.. -1]
&& Nil = chunkedList.[sharedLength ..]
&& Array.empty = array.[sharedLength ..]
Assert.IsTrue shouldBeTrue
if 0 < sharedLength
then
let shouldBeTrue =
let oneElementSliceIsOk index =
1 = chunkedList.[index .. index].Length
&& 1 = array.[index .. index].Length
&& chunkedList.[index .. index].[0] = array.[index .. index].[0]
&& chunkedList.[index] = array.[index]
&& chunkedList.[index .. index].[0] = array.[index]
&& array.[index .. index].[0] = chunkedList.[index]
oneElementSliceIsOk 0
&& oneElementSliceIsOk (sharedLength - 1)
&& (chunkedList.[0 .. sharedLength - 1]
|> ChunkedList.fold (+)
1)
= (array.[0 .. sharedLength - 1]
|> Array.fold (+)
1)
Assert.IsTrue shouldBeTrue
Assert.IsTrue shouldBeTrue
let transform x =
2 * x
let (foldResult
, _
, _) as foldResultsTriple =
ChunkedList.fold (+)
0
chunkedList
, List.fold (+)
0
list
, Array.fold (+)
0
array
let shouldBeTrue =
foldResultsTriple
|> tripleResultsAgree
Assert.IsTrue shouldBeTrue
let mappedChunkedList
, mappedList
, mappedArray =
ChunkedList.map transform
chunkedList
, List.map transform
list
, Array.map transform
array
let (mapAndFoldResult
, _
, _) as mapAndfoldResultsTriple =
ChunkedList.fold (+)
0
mappedChunkedList
, List.fold (+)
0
mappedList
, Array.fold (+)
0
mappedArray
let shouldBeTrue =
mapAndfoldResultsTriple
|> tripleResultsAgree
Assert.IsTrue shouldBeTrue
// This next line simultaneously checks the 'map' for 'ChunkedList' - the transforming the fold result should
// be the same as folding the transformed results as well 'fold' - distribution of multiplication over addition.
let shouldBeTrue =
transform foldResult
= mapAndFoldResult
Assert.IsTrue shouldBeTrue
let zipAndFoldResultsTriple =
let binaryOperation lhs
(x
, y) =
lhs + x * y
ChunkedList.zip chunkedList
mappedChunkedList
|> ChunkedList.fold binaryOperation
1
, List.zip list
mappedList
|> List.fold binaryOperation
1
, Array.zip array
mappedArray
|> Array.fold binaryOperation
1
let shouldBeTrue =
zipAndFoldResultsTriple
|> tripleResultsAgree
Assert.IsTrue shouldBeTrue
let reverseResultsTriple =
ChunkedList.rev chunkedList
|> ChunkedList.toArray
, List.rev list
|> List.toArray
, Array.rev array
let shouldBeTrue =
reverseResultsTriple
|> tripleResultsAgree
Assert.IsTrue shouldBeTrue
let carryOutDecision (contenderTriumvirates
, nextUniqueElement)
decision =
match contenderTriumvirates with
head :: _ ->
checkEquivalenceOfContenders head
| _ ->
()
match contenderTriumvirates
, decision with
headTriumvirate :: tail
, Cons ->
{
ChunkedList =
ChunkedListExtensions.Cons (nextUniqueElement
, headTriumvirate.ChunkedList)
List =
nextUniqueElement
:: headTriumvirate.List
Array =
[| yield nextUniqueElement
yield! headTriumvirate.Array |]
} :: tail
, 1 + nextUniqueElement
| headTriumvirate :: tail
, ConsWithPotentialDuplicate ->
{
ChunkedList =
ChunkedListExtensions.Cons (nextUniqueElement
, headTriumvirate.ChunkedList)
List =
nextUniqueElement
:: headTriumvirate.List
Array =
[| yield nextUniqueElement
yield! headTriumvirate.Array |]
} :: tail
, nextUniqueElement
| headTriumvirate :: nextTriumvirate :: tail
, Append ->
{
ChunkedList =
ChunkedList.append headTriumvirate.ChunkedList
nextTriumvirate.ChunkedList
List =
List.append headTriumvirate.List
nextTriumvirate.List
Array =
Array.append headTriumvirate.Array
nextTriumvirate.Array
} :: tail
, nextUniqueElement
| triumvirates
, StartANewDoubleton ->
let newItems =
[(1 + nextUniqueElement); nextUniqueElement]
{
ChunkedList =
newItems
|> ChunkedList.ofList
List =
newItems
Array =
newItems
|> Array.ofList
} :: triumvirates
, 2 + nextUniqueElement
| triumvirates
, StartABigChunk ->
let chunkSize =
38
let newItems =
List.init chunkSize
(fun index ->
nextUniqueElement + index)
|> List.rev
{
ChunkedList =
newItems
|> ChunkedList.ofList
List =
newItems
Array =
newItems
|> Array.ofList
} :: triumvirates
, chunkSize + nextUniqueElement
| triumvirates
, StartABigArrayChunk ->
let chunkSize =
38
let newItems =
Array.init chunkSize
(fun index ->
nextUniqueElement + index)
|> Array.rev
{
ChunkedList =
newItems
|> ChunkedList.ofArray
List =
newItems
|> List.ofArray
Array =
newItems
} :: triumvirates
, chunkSize + nextUniqueElement
| triumvirates
, StartASingletonArrayChunk ->
let singleton =
[|nextUniqueElement|]
{
ChunkedList =
singleton
|> ChunkedList.ofArray
List =
singleton
|> List.ofArray
Array =
singleton
} :: triumvirates
, 1 + nextUniqueElement
| triumvirates
, StartASingletonArrayChunk ->
let empty =
[||]
{
ChunkedList =
empty
|> ChunkedList.ofArray
List =
empty
|> List.ofArray
Array =
empty
} :: triumvirates
, nextUniqueElement
| triumvirates
, StartANewDuplicateDoubleton ->
let newItems =
[nextUniqueElement; nextUniqueElement]
{
ChunkedList =
newItems
|> ChunkedList.ofList
List =
newItems
Array =
newItems
|> Array.ofList
} :: triumvirates
, 1 + nextUniqueElement
| headTriumvirate :: tail
, Halve ->
let endIndex =
headTriumvirate.ChunkedList.Length / 2
{
ChunkedList =
headTriumvirate.ChunkedList.[0 .. endIndex - 1]
List =
(headTriumvirate.List
|> Array.ofList).[0 .. endIndex - 1]
|> List.ofArray
Array =
headTriumvirate.Array.[0 .. endIndex - 1]
} :: tail
, nextUniqueElement
| headTriumvirate :: tail
, SliceOneOff when not headTriumvirate.ChunkedList.IsEmpty ->
{
ChunkedList =
headTriumvirate.ChunkedList.[1 .. ]
List =
(headTriumvirate.List
|> Array.ofList).[1 ..]
|> List.ofArray
Array =
headTriumvirate.Array.[1 ..]
} :: tail
, nextUniqueElement
| triumvirates
, _ ->
{
ChunkedList =
Nil
List =
[]
Array =
Array.empty
} :: triumvirates
, nextUniqueElement
let triumvirates
, _ =
decisions
|> List.fold carryOutDecision
([]
, 0)
for triumvirate in triumvirates do
checkEquivalenceOfContenders triumvirate