This repository has been archived by the owner on Jan 3, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 322
/
list.fs
executable file
·646 lines (525 loc) · 25.8 KB
/
list.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
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
// Copyright (c) Microsoft Open Technologies, Inc. All Rights Reserved. Licensed under the Apache License, Version 2.0. See License.txt in the project root for license information.
namespace Microsoft.FSharp.Collections
open System.Diagnostics
open System.Reflection
open Microsoft.FSharp.Core
open Microsoft.FSharp.Core.Operators
open Microsoft.FSharp.Core.LanguagePrimitives
open Microsoft.FSharp.Core.LanguagePrimitives.IntrinsicOperators
open Microsoft.FSharp.Collections
open Microsoft.FSharp.Primitives.Basics
open System.Collections.Generic
open Microsoft.FSharp.Core.SR
[<CompilationRepresentation(CompilationRepresentationFlags.ModuleSuffix)>]
[<RequireQualifiedAccess>]
module List =
let inline indexNotFound() = raise (new System.Collections.Generic.KeyNotFoundException(SR.GetString(SR.keyNotFoundAlt)))
[<CompiledName("Length")>]
let length (list: 'T list) = list.Length
[<CompiledName("Last")>]
let rec last (list : 'T list) =
match list with
| [x] -> x
| _ :: tail -> last tail
| [] -> invalidArg "list" (SR.GetString(SR.inputListWasEmpty))
[<CompiledName("TryLast")>]
let rec tryLast (list: 'T list) =
match list with
| [x] -> Some x
| _ :: tail -> tryLast tail
| [] -> None
[<CompiledName("Reverse")>]
let rev list = Microsoft.FSharp.Primitives.Basics.List.rev list
[<CompiledName("Concat")>]
let concat lists = Microsoft.FSharp.Primitives.Basics.List.concat lists
let inline countByImpl (comparer:IEqualityComparer<'SafeKey>) (projection:'T->'SafeKey) (getKey:'SafeKey->'Key) (list:'T list) =
let dict = Dictionary comparer
let rec loop srcList =
match srcList with
| [] -> ()
| h::t ->
let safeKey = projection h
let mutable prev = 0
if dict.TryGetValue(safeKey, &prev) then dict.[safeKey] <- prev + 1 else dict.[safeKey] <- 1
loop t
loop list
let mutable result = []
for group in dict do
result <- (getKey group.Key, group.Value) :: result
result |> rev
// We avoid wrapping a StructBox, because under 64 JIT we get some "hard" tailcalls which affect performance
let countByValueType (projection:'T->'Key) (list:'T list) = countByImpl HashIdentity.Structural<'Key> projection id list
// Wrap a StructBox around all keys in case the key type is itself a type using null as a representation
let countByRefType (projection:'T->'Key) (list:'T list) = countByImpl Microsoft.FSharp.Core.CompilerServices.RuntimeHelpers.StructBox<'Key>.Comparer (fun t -> Microsoft.FSharp.Core.CompilerServices.RuntimeHelpers.StructBox (projection t)) (fun sb -> sb.Value) list
[<CompiledName("CountBy")>]
let countBy (projection:'T->'Key) (list:'T list) =
#if FX_RESHAPED_REFLECTION
if (typeof<'Key>).GetTypeInfo().IsValueType
#else
if typeof<'Key>.IsValueType
#endif
then countByValueType projection list
else countByRefType projection list
[<CompiledName("Map")>]
let map f list = Microsoft.FSharp.Primitives.Basics.List.map f list
[<CompiledName("MapIndexed")>]
let mapi f list = Microsoft.FSharp.Primitives.Basics.List.mapi f list
[<CompiledName("Indexed")>]
let indexed list = Microsoft.FSharp.Primitives.Basics.List.indexed list
[<CompiledName("MapFold")>]
let mapFold<'T,'State,'Result> (f:'State -> 'T -> 'Result * 'State) acc list =
Microsoft.FSharp.Primitives.Basics.List.mapFold f acc list
[<CompiledName("MapFoldBack")>]
let mapFoldBack<'T,'State,'Result> (f:'T -> 'State -> 'Result * 'State) list acc =
match list with
| [] -> [], acc
| [h] -> let h',s' = f h acc in [h'], s'
| _ ->
let f = OptimizedClosures.FSharpFunc<_,_,_>.Adapt(f)
let rec loop res list =
match list, res with
| [], _ -> res
| h::t, (list', acc') ->
let h',s' = f.Invoke(h,acc')
loop (h'::list', s') t
loop ([], acc) (rev list)
[<CompiledName("Iterate")>]
let iter f list = Microsoft.FSharp.Primitives.Basics.List.iter f list
[<CompiledName("Distinct")>]
let distinct (list:'T list) = Microsoft.FSharp.Primitives.Basics.List.distinctWithComparer HashIdentity.Structural<'T> list
[<CompiledName("DistinctBy")>]
let distinctBy keyf (list:'T list) = Microsoft.FSharp.Primitives.Basics.List.distinctByWithComparer HashIdentity.Structural<_> keyf list
[<CompiledName("OfArray")>]
let ofArray (array:'T array) = Microsoft.FSharp.Primitives.Basics.List.ofArray array
[<CompiledName("ToArray")>]
let toArray (list:'T list) = Microsoft.FSharp.Primitives.Basics.List.toArray list
[<CompiledName("Empty")>]
let empty<'T> = ([ ] : 'T list)
[<CompiledName("Head")>]
let head list = match list with (x:: _) -> x | [] -> invalidArg "list" (SR.GetString(SR.inputListWasEmpty))
[<CompiledName("TryHead")>]
let tryHead list = match list with (x:: _) -> Some x | [] -> None
[<CompiledName("Tail")>]
let tail list = match list with (_ :: t) -> t | [] -> invalidArg "list" (SR.GetString(SR.inputListWasEmpty))
[<CompiledName("IsEmpty")>]
let isEmpty list = match list with [] -> true | _ -> false
[<CompiledName("Append")>]
let append list1 list2 = list1 @ list2
[<CompiledName("Item")>]
let rec item index list =
match list with
| h::t when index >= 0 ->
if index = 0 then h else item (index - 1) t
| _ ->
invalidArg "index" (SR.GetString(SR.indexOutOfBounds))
[<CompiledName("TryItem")>]
let rec tryItem index list =
match list with
| h::t when index >= 0 ->
if index = 0 then Some h else tryItem (index - 1) t
| _ ->
None
[<CompiledName("Get")>]
let nth list index = item index list
let rec chooseAllAcc f xs acc =
match xs with
| [] -> rev acc
| h :: t ->
match f h with
| None -> chooseAllAcc f t acc
| Some x -> chooseAllAcc f t (x::acc)
[<CompiledName("Choose")>]
let choose f xs = chooseAllAcc f xs []
[<CompiledName("SplitAt")>]
let splitAt index (list:'T list) = Microsoft.FSharp.Primitives.Basics.List.splitAt index list
[<CompiledName("Take")>]
let take count (list : 'T list) = Microsoft.FSharp.Primitives.Basics.List.take count list
[<CompiledName("TakeWhile")>]
let takeWhile p (list: 'T list) = Microsoft.FSharp.Primitives.Basics.List.takeWhile p list
[<CompiledName("IterateIndexed")>]
let iteri f list = Microsoft.FSharp.Primitives.Basics.List.iteri f list
[<CompiledName("Initialize")>]
let init count f = Microsoft.FSharp.Primitives.Basics.List.init count f
let rec initConstAcc n x acc =
if n <= 0 then acc else initConstAcc (n-1) x (x::acc)
[<CompiledName("Replicate")>]
let replicate count x =
if count < 0 then invalidArg "count" (SR.GetString(SR.inputMustBeNonNegative))
initConstAcc count x []
[<CompiledName("Iterate2")>]
let iter2 f list1 list2 =
let f = OptimizedClosures.FSharpFunc<_,_,_>.Adapt(f)
let rec loop list1 list2 =
match list1,list2 with
| [],[] -> ()
| (h1::t1), (h2::t2) -> f.Invoke(h1,h2); loop t1 t2
| _ -> invalidArg "list2" (SR.GetString(SR.listsHadDifferentLengths))
loop list1 list2
[<CompiledName("IterateIndexed2")>]
let iteri2 f list1 list2 =
let f = OptimizedClosures.FSharpFunc<_,_,_,_>.Adapt(f)
let rec loop n list1 list2 =
match list1,list2 with
| [],[] -> ()
| (h1::t1), (h2::t2) -> f.Invoke(n,h1,h2); loop (n+1) t1 t2
| _ -> invalidArg "list2" (SR.GetString(SR.listsHadDifferentLengths))
loop 0 list1 list2
let rec map3aux (f:OptimizedClosures.FSharpFunc<_,_,_,_>) list1 list2 list3 acc =
match list1,list2,list3 with
| [],[],[] -> rev acc
| (h1::t1), (h2::t2),(h3::t3) -> let x = f.Invoke(h1,h2,h3) in map3aux f t1 t2 t3 (x :: acc)
| _ -> invalidArg "list3" (SR.GetString(SR.listsHadDifferentLengths))
[<CompiledName("Map3")>]
let map3 f list1 list2 list3 =
let f = OptimizedClosures.FSharpFunc<_,_,_,_>.Adapt(f)
map3aux f list1 list2 list3 []
let rec mapi2aux n (f:OptimizedClosures.FSharpFunc<_,_,_,_>) list1 list2 acc =
match list1,list2 with
| [],[] -> rev acc
| (h1::t1), (h2::t2) -> let x = f.Invoke(n,h1,h2) in mapi2aux (n+1) f t1 t2 (x :: acc)
| _ -> invalidArg "list2" (SR.GetString(SR.listsHadDifferentLengths))
[<CompiledName("MapIndexed2")>]
let mapi2 f list1 list2 =
let f = OptimizedClosures.FSharpFunc<_,_,_,_>.Adapt(f)
mapi2aux 0 f list1 list2 []
[<CompiledName("Map2")>]
let map2 f list1 list2 = Microsoft.FSharp.Primitives.Basics.List.map2 f list1 list2
[<CompiledName("Fold")>]
let fold<'T,'State> f (s:'State) (list: 'T list) =
match list with
| [] -> s
| _ ->
let f = OptimizedClosures.FSharpFunc<_,_,_>.Adapt(f)
let rec loop s xs =
match xs with
| [] -> s
| h::t -> loop (f.Invoke(s,h)) t
loop s list
[<CompiledName("Pairwise")>]
let pairwise (list: 'T list) =
let array = List.toArray list
if array.Length < 2 then [] else
List.init (array.Length-1) (fun i -> array.[i],array.[i+1])
[<CompiledName("Reduce")>]
let reduce f list =
match list with
| [] -> invalidArg "list" (SR.GetString(SR.inputListWasEmpty))
| (h::t) -> fold f h t
[<CompiledName("Scan")>]
let scan<'T,'State> f (s:'State) (list:'T list) =
let f = OptimizedClosures.FSharpFunc<_,_,_>.Adapt(f)
let rec loop s xs acc =
match xs with
| [] -> rev acc
| (h::t) -> let s = f.Invoke(s,h) in loop s t (s :: acc)
loop s list [s]
[<CompiledName("Singleton")>]
let inline singleton value = [value]
[<CompiledName("Fold2")>]
let fold2<'T1,'T2,'State> f (acc:'State) (list1:list<'T1>) (list2:list<'T2>) =
let f = OptimizedClosures.FSharpFunc<_,_,_,_>.Adapt(f)
let rec loop acc list1 list2 =
match list1,list2 with
| [],[] -> acc
| (h1::t1),(h2::t2) -> loop (f.Invoke(acc,h1,h2)) t1 t2
| _ -> invalidArg "list2" (SR.GetString(SR.listsHadDifferentLengths))
loop acc list1 list2
let foldArraySubRight (f:OptimizedClosures.FSharpFunc<'T,_,_>) (arr: 'T[]) start fin acc =
let mutable state = acc
for i = fin downto start do
state <- f.Invoke(arr.[i], state)
state
// this version doesn't causes stack overflow - it uses a private stack
[<CompiledName("FoldBack")>]
let foldBack<'T,'State> f (list:'T list) (acc:'State) =
let f = OptimizedClosures.FSharpFunc<_,_,_>.Adapt(f)
match list with
| [] -> acc
| [h] -> f.Invoke(h,acc)
| [h1;h2] -> f.Invoke(h1,f.Invoke(h2,acc))
| [h1;h2;h3] -> f.Invoke(h1,f.Invoke(h2,f.Invoke(h3,acc)))
| [h1;h2;h3;h4] -> f.Invoke(h1,f.Invoke(h2,f.Invoke(h3,f.Invoke(h4,acc))))
| _ ->
// It is faster to allocate and iterate an array than to create all those
// highly nested stacks. It also means we won't get stack overflows here.
let arr = toArray list
let arrn = arr.Length
foldArraySubRight f arr 0 (arrn - 1) acc
[<CompiledName("ReduceBack")>]
let reduceBack f list =
match list with
| [] -> invalidArg "list" (SR.GetString(SR.inputListWasEmpty))
| _ ->
let f = OptimizedClosures.FSharpFunc<_,_,_>.Adapt(f)
let arr = toArray list
let arrn = arr.Length
foldArraySubRight f arr 0 (arrn - 2) arr.[arrn - 1]
let scanArraySubRight<'T,'State> (f:OptimizedClosures.FSharpFunc<'T,'State,'State>) (arr:_[]) start fin initState =
let mutable state = initState
let mutable res = [state]
for i = fin downto start do
state <- f.Invoke(arr.[i], state);
res <- state :: res
res
[<CompiledName("ScanBack")>]
let scanBack<'T,'State> f (list:'T list) (s:'State) =
match list with
| [] -> [s]
| [h] ->
[f h s; s]
| _ ->
let f = OptimizedClosures.FSharpFunc<_,_,_>.Adapt(f)
// It is faster to allocate and iterate an array than to create all those
// highly nested stacks. It also means we won't get stack overflows here.
let arr = toArray list
let arrn = arr.Length
scanArraySubRight f arr 0 (arrn - 1) s
let foldBack2UsingArrays (f:OptimizedClosures.FSharpFunc<_,_,_,_>) list1 list2 acc =
let arr1 = toArray list1
let arr2 = toArray list2
let n1 = arr1.Length
let n2 = arr2.Length
if n1 <> n2 then invalidArg "list2" (SR.GetString(SR.listsHadDifferentLengths));
let mutable res = acc
for i = n1 - 1 downto 0 do
res <- f.Invoke(arr1.[i],arr2.[i],res)
res
[<CompiledName("FoldBack2")>]
let rec foldBack2<'T1,'T2,'State> f (list1:'T1 list) (list2:'T2 list) (acc:'State) =
match list1,list2 with
| [],[] -> acc
| h1::rest1, k1::rest2 ->
let f = OptimizedClosures.FSharpFunc<_,_,_,_>.Adapt(f)
match rest1, rest2 with
| [],[] -> f.Invoke(h1,k1,acc)
| [h2],[k2] -> f.Invoke(h1,k1,f.Invoke(h2,k2,acc))
| [h2;h3],[k2;k3] -> f.Invoke(h1,k1,f.Invoke(h2,k2,f.Invoke(h3,k3,acc)))
| [h2;h3;h4],[k2;k3;k4] -> f.Invoke(h1,k1,f.Invoke(h2,k2,f.Invoke(h3,k3,f.Invoke(h4,k4,acc))))
| _ -> foldBack2UsingArrays f list1 list2 acc
| _ -> invalidArg "list2" (SR.GetString(SR.listsHadDifferentLengths))
let rec forall2aux (f:OptimizedClosures.FSharpFunc<_,_,_>) list1 list2 =
match list1,list2 with
| [],[] -> true
| (h1::t1),(h2::t2) -> f.Invoke(h1,h2) && forall2aux f t1 t2
| _ -> invalidArg "list2" (SR.GetString(SR.listsHadDifferentLengths))
[<CompiledName("ForAll2")>]
let forall2 f list1 list2 =
match list1,list2 with
| [],[] -> true
| _ ->
let f = OptimizedClosures.FSharpFunc<_,_,_>.Adapt(f)
forall2aux f list1 list2
[<CompiledName("ForAll")>]
let forall f list1 = Microsoft.FSharp.Primitives.Basics.List.forall f list1
[<CompiledName("Exists")>]
let exists f list1 = Microsoft.FSharp.Primitives.Basics.List.exists f list1
[<CompiledName("Contains")>]
let inline contains e list1 =
let rec contains e xs1 =
match xs1 with
| [] -> false
| (h1::t1) -> e = h1 || contains e t1
contains e list1
let rec exists2aux (f:OptimizedClosures.FSharpFunc<_,_,_>) list1 list2 =
match list1,list2 with
| [],[] -> false
| (h1::t1),(h2::t2) ->f.Invoke(h1,h2) || exists2aux f t1 t2
| _ -> invalidArg "list2" (SR.GetString(SR.listsHadDifferentLengths))
[<CompiledName("Exists2")>]
let rec exists2 f list1 list2 =
match list1,list2 with
| [],[] -> false
| _ ->
let f = OptimizedClosures.FSharpFunc<_,_,_>.Adapt(f)
exists2aux f list1 list2
[<CompiledName("Find")>]
let rec find f list = match list with [] -> indexNotFound() | h::t -> if f h then h else find f t
[<CompiledName("TryFind")>]
let rec tryFind f list = match list with [] -> None | h::t -> if f h then Some h else tryFind f t
[<CompiledName("FindBack")>]
let findBack f list = list |> toArray |> Array.findBack f
[<CompiledName("TryFindBack")>]
let tryFindBack f list = list |> toArray |> Array.tryFindBack f
[<CompiledName("TryPick")>]
let rec tryPick f list =
match list with
| [] -> None
| h::t ->
match f h with
| None -> tryPick f t
| r -> r
[<CompiledName("Pick")>]
let rec pick f list =
match list with
| [] -> indexNotFound()
| h::t ->
match f h with
| None -> pick f t
| Some r -> r
[<CompiledName("Filter")>]
let filter f x = Microsoft.FSharp.Primitives.Basics.List.filter f x
[<CompiledName("Except")>]
let except itemsToExclude list =
match box itemsToExclude with
| null -> nullArg "itemsToExclude"
| _ -> ()
match list with
| [] -> list
| _ ->
let cached = HashSet(itemsToExclude, HashIdentity.Structural)
list |> filter cached.Add
[<CompiledName("Where")>]
let where f x = Microsoft.FSharp.Primitives.Basics.List.filter f x
let inline groupByImpl (comparer:IEqualityComparer<'SafeKey>) (keyf:'T->'SafeKey) (getKey:'SafeKey->'Key) (list: 'T list) =
let dict = Dictionary<_,ResizeArray<_>> comparer
// Build the groupings
let rec loop list =
match list with
| v :: t ->
let safeKey = keyf v
let mutable prev = Unchecked.defaultof<_>
if dict.TryGetValue(safeKey, &prev) then
prev.Add v
else
let prev = ResizeArray ()
dict.[safeKey] <- prev
prev.Add v
loop t
| _ -> ()
loop list
// Return the list-of-lists.
dict
|> Seq.map (fun group -> (getKey group.Key, Seq.toList group.Value))
|> Seq.toList
// We avoid wrapping a StructBox, because under 64 JIT we get some "hard" tailcalls which affect performance
let groupByValueType (keyf:'T->'Key) (list:'T list) = groupByImpl HashIdentity.Structural<'Key> keyf id list
// Wrap a StructBox around all keys in case the key type is itself a type using null as a representation
let groupByRefType (keyf:'T->'Key) (list:'T list) = groupByImpl Microsoft.FSharp.Core.CompilerServices.RuntimeHelpers.StructBox<'Key>.Comparer (fun t -> Microsoft.FSharp.Core.CompilerServices.RuntimeHelpers.StructBox (keyf t)) (fun sb -> sb.Value) list
[<CompiledName("GroupBy")>]
let groupBy (keyf:'T->'Key) (list:'T list) =
#if FX_RESHAPED_REFLECTION
if (typeof<'Key>).GetTypeInfo().IsValueType
#else
if typeof<'Key>.IsValueType
#endif
then groupByValueType keyf list
else groupByRefType keyf list
[<CompiledName("Partition")>]
let partition p x = Microsoft.FSharp.Primitives.Basics.List.partition p x
[<CompiledName("Unzip")>]
let unzip x = Microsoft.FSharp.Primitives.Basics.List.unzip x
[<CompiledName("Unzip3")>]
let unzip3 x = Microsoft.FSharp.Primitives.Basics.List.unzip3 x
[<CompiledName("Windowed")>]
let windowed n x = Microsoft.FSharp.Primitives.Basics.List.windowed n x
[<CompiledName("ChunkBySize")>]
let chunkBySize chunkSize list = Microsoft.FSharp.Primitives.Basics.List.chunkBySize chunkSize list
[<CompiledName("SplitInto")>]
let splitInto count list = Microsoft.FSharp.Primitives.Basics.List.splitInto count list
[<CompiledName("Zip")>]
let zip x1 x2 = Microsoft.FSharp.Primitives.Basics.List.zip x1 x2
[<CompiledName("Zip3")>]
let zip3 x1 x2 x3 = Microsoft.FSharp.Primitives.Basics.List.zip3 x1 x2 x3
[<CompiledName("Skip")>]
let skip count list =
if count <= 0 then list else
let rec loop i lst =
match lst with
| _ when i = 0 -> lst
| _::t -> loop (i-1) t
| [] -> invalidArg "count" (SR.GetString(SR.outOfRange))
loop count list
[<CompiledName("SkipWhile")>]
let rec skipWhile p xs =
match xs with
| head :: tail when p head -> skipWhile p tail
| _ -> xs
[<CompiledName("SortWith")>]
let sortWith cmp xs =
match xs with
| [] | [_] -> xs
| _ ->
let array = List.toArray xs
Microsoft.FSharp.Primitives.Basics.Array.stableSortInPlaceWith cmp array
List.ofArray array
[<CompiledName("SortBy")>]
let sortBy f xs =
match xs with
| [] | [_] -> xs
| _ ->
let array = List.toArray xs
Microsoft.FSharp.Primitives.Basics.Array.stableSortInPlaceBy f array
List.ofArray array
[<CompiledName("Sort")>]
let sort xs =
match xs with
| [] | [_] -> xs
| _ ->
let array = List.toArray xs
Microsoft.FSharp.Primitives.Basics.Array.stableSortInPlace array
List.ofArray array
[<CompiledName("SortByDescending")>]
let inline sortByDescending f xs =
let inline compareDescending a b = compare (f b) (f a)
sortWith compareDescending xs
[<CompiledName("SortDescending")>]
let inline sortDescending xs =
let inline compareDescending a b = compare b a
sortWith compareDescending xs
[<CompiledName("OfSeq")>]
let ofSeq source = Seq.toList source
[<CompiledName("ToSeq")>]
let toSeq list = Seq.ofList list
[<CompiledName("FindIndex")>]
let findIndex f list =
let rec loop n = function[] -> indexNotFound() | h::t -> if f h then n else loop (n+1) t
loop 0 list
[<CompiledName("TryFindIndex")>]
let tryFindIndex f list =
let rec loop n = function[] -> None | h::t -> if f h then Some n else loop (n+1) t
loop 0 list
[<CompiledName("FindIndexBack")>]
let findIndexBack f list = list |> toArray |> Array.findIndexBack f
[<CompiledName("TryFindIndexBack")>]
let tryFindIndexBack f list = list |> toArray |> Array.tryFindIndexBack f
[<CompiledName("Sum")>]
let inline sum (list:list<_>) = Seq.sum list
[<CompiledName("SumBy")>]
let inline sumBy f (list:list<_>) = Seq.sumBy f list
[<CompiledName("Max")>]
let inline max (list:list<_>) = Seq.max list
[<CompiledName("MaxBy")>]
let inline maxBy f (list:list<_>) = Seq.maxBy f list
[<CompiledName("Min")>]
let inline min (list:list<_>) = Seq.min list
[<CompiledName("MinBy")>]
let inline minBy f (list:list<_>) = Seq.minBy f list
[<CompiledName("Average")>]
let inline average (list:list<_>) = Seq.average list
[<CompiledName("AverageBy")>]
let inline averageBy f (list:list<_>) = Seq.averageBy f list
[<CompiledName("Collect")>]
let collect f list = Microsoft.FSharp.Primitives.Basics.List.collect f list
[<CompiledName("CompareWith")>]
let inline compareWith (comparer:'T -> 'T -> int) (list1: 'T list) (list2: 'T list) =
let rec loop list1 list2 =
match list1, list2 with
| head1 :: tail1, head2 :: tail2 ->
let c = comparer head1 head2
if c = 0 then loop tail1 tail2 else c
| [], [] -> 0
| _, [] -> 1
| [], _ -> -1
loop list1 list2
[<CompiledName("Permute")>]
let permute indexMap list = list |> toArray |> Array.permute indexMap |> ofArray
[<CompiledName("ExactlyOne")>]
let exactlyOne (source : list<_>) =
match source with
| [x] -> x
| [] -> invalidArg "source" LanguagePrimitives.ErrorStrings.InputSequenceEmptyString
| _ -> invalidArg "source" (SR.GetString(SR.inputSequenceTooLong))
[<CompiledName("Truncate")>]
let truncate count list = Microsoft.FSharp.Primitives.Basics.List.truncate count list
[<CompiledName("Unfold")>]
let unfold<'T,'State> (f:'State -> ('T*'State) option) (s:'State) = Microsoft.FSharp.Primitives.Basics.List.unfold f s