-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLuaLINQ.lua
More file actions
2215 lines (2050 loc) · 65.6 KB
/
LuaLINQ.lua
File metadata and controls
2215 lines (2050 loc) · 65.6 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
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
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
--[[*
* File: LuaLINQ.lua
* Author: 4z0t
* Description: Provides functional approach to work with collections in Lua.
* This library is oriented on performance and simplicity to leave least possible
* memory footprint.
* _ _
* | | | |
* | | |_|
* | | ____________ ___________________
* | | |__________ | |__________ ______|
* | |__________ | | ________ | |
* |__________ | | | | ____ | | |
* | | | | | | | | | |
* | | | | | |____| | | |
* | | | | |________| | |
* | | | |__________ | |
* |_| |____________| |_|
*
* Copyright (c) 2025 4z0t
* All rights reserved.
*
* This software is provided "as is" without warranty of any kind, express or
* implied, including but not limited to the warranties of merchantability,
* fitness for a particular purpose and noninfringement. In no event shall the
* authors or copyright holders be liable for any claim, damages or other
* liability, whether in an action of contract, tort or otherwise, arising from,
* out of or in connection with the software or the use or other dealings in the
* software.
*]]
---#region Upvalues
local setmetatable = setmetatable
local getmetatable = getmetatable
local TableInsert = table.insert
local next = next
-- There is one inconsistency between Lua versions, that makes iteration with ipairs harder.
-- In Lua 5.0 ipairs works 2 ways:
-- if only 1 argument is provided it returns 3 values: ipairs(t) -> ipairs, t, 0
-- if there are 2 of them it works like next does: ipairs(t, i) -> i+1, v[i+1]
-- and second argument can be `nil` and will be considered as 0.
-- In future versions of Lua it no longer works and will result an error, because
-- ipairs returns special function with this implementation in lbaselib.c:
-- ```c
-- static int ipairsaux (lua_State *L) {
-- lua_Integer i = luaL_checkinteger(L, 2);
-- i = luaL_intop(+, i, 1);
-- lua_pushinteger(L, i);
-- return (lua_geti(L, 1, i) == LUA_TNIL) ? 1 : 2;
-- }
-- ```
-- In case you have ability to change it, this would be better for compatibility:
-- ```c
-- static int ipairsaux (lua_State *L) {
-- lua_Integer i = lua_isnil(L, 2) ? 0 : luaL_checkinteger(L, 2);
-- i = luaL_intop(+, i, 1);
-- lua_pushinteger(L, i);
-- return (lua_geti(L, 1, i) == LUA_TNIL) ? 1 : 2;
-- }
-- ```
-- Otherwise this implementation is provided:
local _inextf = ipairs {}
local function inext(t, i)
return _inextf(t, i or 0)
end
local pairs = pairs
---@generic T
---@param t T[]
---@return integer
local function TableGetN(t)
return #t
end
---@param t table
---@return integer
local function TableSize(t)
local n = 0
for _ in pairs(t) do
n = n + 1
end
return n
end
local TableSort = table.sort
local type = type
---@generic T
---@param v T
---@return T
local function Identity(v)
return v
end
---@generic K,V
---@param it fun(k: K):K,V
---@param k K
---@return K,V
local function CallStatefulIterator(it, k)
return it(k)
end
---#endregion
---#region Enumerable and Enumerator
---@alias IteratorFunction fun(t:table, k:any):any, any
---@class Enumerable
---@field t table
---@field iterator IteratorFunction
---@field transformer? (fun(t:table):table)
local EnumerableMeta = {}
EnumerableMeta.__index = EnumerableMeta
---@generic K,V,R
---@param t table
---@param iterator? fun(t:table, k:K):K,V
---@param transformer? fun(t:table):table<K,V>
---@return Enumerable
local function EnumerableCreate(t, iterator, transformer)
return setmetatable(
{
iterator = iterator or inext,
transformer = transformer or false,
t = t,
},
EnumerableMeta)
end
---@generic T, K, V
---@param e Enumerable
---@return (fun(t:T, k:K):K,V)
---@return T
local function EnumerableForIteration(e)
local t, iterator, transformer = e.t, e.iterator, e.transformer
if transformer then
t = transformer(t)
end
return iterator, t
end
---@overload fun(e:any):false
---@param e Enumerable
---@return true
local function IsEnumerable(e)
return getmetatable(e) == EnumerableMeta
end
EnumerableMeta.Enumerate = EnumerableCreate
---@class Enumerator
---@field iterator (fun(t:table, k:any):any, any)
---@field transformer (fun(t:table):table)
local EnumeratorMeta = {}
EnumeratorMeta.__index = EnumeratorMeta
---@generic K,V
---@param iterator fun(t:table, k:K):K,V
---@param transformer? fun(t:table):table<K,V>
---@return Enumerator
local function EnumeratorCreate(iterator, transformer)
return setmetatable(
{
iterator = iterator,
transformer = transformer or false
},
EnumeratorMeta)
end
EnumeratorMeta.Create = EnumeratorCreate
---@return Enumerable
function EnumerableMeta:Clone()
return EnumerableCreate(self.t, self.iterator, self.transformer)
end
---Returns new Enumerable using Enumerator's iterator.
---@param t table
---@return Enumerable
function EnumeratorMeta:Enumerate(t)
return EnumerableCreate(t, self.iterator, self.transformer)
end
---Creates a new Enumerable with the current sequence cached into a table.
---This is useful when you want to iterate over the same sequence multiple times without re-evaluating transformations.
---@return Enumerable @A new Enumerable containing the cached sequence
function EnumerableMeta:Cache()
local iterator, t = EnumerableForIteration(self)
return EnumerableCreate(t, iterator)
end
---#endregion
---#region Call
do
---@generic K,V
---@return fun(t:table, k:K):K,V
---@return table
---@return any
function EnumerableMeta:__call()
return EnumerableForIteration(self)
end
---@generic K,V
---@param t table
---@return fun(t:table, k:K):K,V
---@return table
function EnumeratorMeta:__call(t)
local transformer = self.transformer
-- local initial = nil
-- if transformer then
-- t, initial = transformer(t)
-- end
-- return self.iterator, t, initial
if transformer then
t = transformer(t)
end
return self.iterator, t
end
end
---#endregion
---#region Where
do
---Creates an iterator that filters elements based on a condition
---@generic K,V
---@param iterator fun(t:table, k:K):K,V @The source iterator
---@param transformer? fun(t:table):table<K,V> @Optional transformer function
---@param condition fun(value:V, key:K):boolean @The predicate function to test elements
---@return fun(t:table, k:K):K,V @Iterator function that yields filtered elements
---@return (fun(t:table):table<K,V>)? @Optional transformer function
local function WhereIterator(iterator, transformer, condition)
return function(t, k)
local v
repeat
k, v = iterator(t, k)
if k == nil then
return nil, nil
end
until condition(v, k)
return k, v
end, transformer
end
---@generic K,V
---@param condition fun(value:V, key:K):boolean
---@return Enumerable
function EnumerableMeta:Where(condition)
if condition == nil then
error("Enumerable:Where: condition is required")
end
self.iterator, self.transformer = WhereIterator(self.iterator, self.transformer, condition)
return self
end
---Filters elements in sequence by given condition.
---@generic K,V
---@param condition fun(value:V, key:K):boolean
---@return Enumerator
function EnumeratorMeta:Where(condition)
if condition == nil then
error("Enumerator:Where: condition is required")
end
return EnumeratorCreate(WhereIterator(self.iterator, self.transformer, condition))
end
end
---#endregion
---#region Select
do
---Creates an iterator that transforms each element using a selector function or key
---@generic K,V,R
---@param iterator fun(t:table, k:K):K,V @The source iterator
---@param transformer? fun(t:table):table<K,V> @Optional transformer function
---@param selector (fun(value:V, key:K):R)|string|number @The selector function or key to transform elements
---@return fun(t:table<K, V>, k:K):K,R @Iterator function that yields transformed elements
---@return (fun(t:table):table<K,V>)? @Optional transformer function
local function SelectIterator(iterator, transformer, selector)
local selectorType = type(selector)
if selectorType == "function" then
return function(t, k)
local v
k, v = iterator(t, k)
if k == nil then
return nil, nil
end
return k, selector(v, k)
end, transformer
elseif selectorType == "string" or selectorType == "number" then
return function(t, k)
local v
k, v = iterator(t, k)
if k == nil then
return nil, nil
end
return k, v[selector]
end, transformer
end
error("Invalid selector type: " .. selectorType)
end
---@generic K,V,R
---@param selector (fun(value:V, key:K):R)|string|number
---@return Enumerable
function EnumerableMeta:Select(selector)
if selector == nil then
error("Enumerable:Select: selector is required")
end
self.iterator, self.transformer = SelectIterator(self.iterator, self.transformer, selector)
return self
end
---Transforms elements in sequence with given selector.
---@generic K,V,R
---@param selector (fun(value:V, key:K):R)|string|number
---@return Enumerator
function EnumeratorMeta:Select(selector)
if selector == nil then
error("Enumerator:Select: selector is required")
end
return EnumeratorCreate(SelectIterator(self.iterator, self.transformer, selector))
end
end
---#endregion
---#region Keys
do
---Creates an iterator that yields only the keys from the source iterator
---@generic K,V
---@param iterator fun(t:table, k:K):K,V @The source iterator
---@param transformer? fun(t:table):table<K,V> @Optional transformer function
---@return fun(t:table, k:K):K,K @Iterator function that yields keys
---@return (fun(t:table):table<K,V>)? @Optional transformer function
local function KeysIterator(iterator, transformer)
return function(t, k)
k = iterator(t, k)
return k, k
end, transformer
end
---@return Enumerable
function EnumerableMeta:Keys()
self.iterator, self.transformer = KeysIterator(self.iterator, self.transformer)
return self
end
---Transforms the sequence into an array of keys.
---@return Enumerator
function EnumeratorMeta:Keys()
return EnumeratorCreate(KeysIterator(self.iterator, self.transformer))
end
end
---#endregion
---#region Distinct
do
---@generic T,K,V
---@param iterator fun(t:T, k:K):K,V
---@param t T
---@return fun(k:K):K,V
local function CreateDistinctIterator(iterator, t)
---@generic V
---@type table<V, boolean>?
local seen
---@generic K
---@param sk K
return function(sk)
seen = seen or {}
for k, v in iterator, t, sk do
if not seen[v] then
seen[v] = true
return k, v
end
end
seen = nil
return nil, nil
end
end
---Creates an iterator that yields only distinct elements from the source iterator, keeping the original order
---@generic K,V
---@param iterator fun(t:table, k:K):K,V @The source iterator
---@param transformer? fun(t:table):table<K,V> @Optional transformer function
---@return fun(table: V[], i?: integer):integer, V @Iterator function that yields distinct elements
---@return fun(t:table):V[] @Transformer function that returns array of distinct elements
local function DistinctIterator(iterator, transformer)
if transformer then
return CallStatefulIterator, function(t)
return CreateDistinctIterator(iterator, transformer(t))
end
end
return CallStatefulIterator, function(t)
return CreateDistinctIterator(iterator, t)
end
end
---@return Enumerable
function EnumerableMeta:Distinct()
self.iterator, self.transformer = DistinctIterator(self.iterator, self.transformer)
return self
end
---Transforms the sequence into an array of distinct elements.
---@return Enumerator
function EnumeratorMeta:Distinct()
return EnumeratorCreate(DistinctIterator(self.iterator, self.transformer))
end
end
---#endregion
---#region DistinctBy
do
---@generic T,K,V,R
---@param keySelector fun(v:V):R
---@param iterator fun(t:T, k:K):K,V
---@param t T
---@return fun(k:K):K,V
local function CreateDistinctByIterator(keySelector, iterator, t)
---@generic R
---@type table<R, boolean>?
local seen
---@generic K
---@param sk K
return function(sk)
seen = seen or {}
for k, v in iterator, t, sk do
local key = keySelector(v)
if not seen[key] then
seen[key] = true
return k, v
end
end
seen = nil
return nil, nil
end
end
---!TODO
---@generic K,V
---@param iterator fun(t:table, k:K):K,V
---@param transformer? fun(t:table):table<K,V>
---@param keySelector fun(v:V):K
---@return fun(table: V[], i?: integer):integer, V
---@return fun(t:table):V[]
local function DistinctByIterator(iterator, transformer, keySelector)
if transformer then
return CallStatefulIterator, function(t)
return CreateDistinctByIterator(keySelector, iterator, transformer(t))
end
end
return CallStatefulIterator, function(t)
return CreateDistinctByIterator(keySelector, iterator, t)
end
end
---@generic V,K
---@param keySelector fun(v:V):K
---@return Enumerable
function EnumerableMeta:DistinctBy(keySelector)
if keySelector == nil then
error("Enumerable:DistinctBy: keySelector is required")
end
self.iterator, self.transformer = DistinctByIterator(self.iterator, self.transformer, keySelector)
return self
end
---@generic V,K
---@param keySelector fun(v:V):K
---@return Enumerator
function EnumeratorMeta:DistinctBy(keySelector)
if keySelector == nil then
error("Enumerator:DistinctBy: keySelector is required")
end
return EnumeratorCreate(DistinctByIterator(self.iterator, self.transformer, keySelector))
end
end
---#endregion
---#region Union
do
local function CreateUnionIterator(first, iterator1, second, iterator2, transformer2)
local iterator, source, isSecond, seen = iterator1, first, false, nil
return function(ik)
seen = seen or {}
repeat
for k, v in iterator, source, ik do
if not seen[v] then
seen[v] = true
return k, v
end
end
if isSecond then
break
end
iterator, source, isSecond, ik = iterator2, transformer2(second), true, nil
until false
iterator, source, seen = nil, nil, nil
return nil, nil
end
end
local function UnionIterator(iterator1, transformer1, second, iterator2, transformer2)
if transformer1 then
return CallStatefulIterator, function(t)
return CreateUnionIterator(transformer1(t), iterator1, second, iterator2, transformer2)
end
end
return CallStatefulIterator, function(t)
return CreateUnionIterator(t, iterator1, second, iterator2, transformer2)
end
end
---@param second table|Enumerable
---@return Enumerable
function EnumerableMeta:Union(second)
if IsEnumerable(second) then
---@cast second Enumerable
self.iterator, self.transformer = UnionIterator(self.iterator, self.transformer, second.t, second.iterator,
second.transformer or Identity)
else
self.iterator, self.transformer = UnionIterator(self.iterator, self.transformer, second, next, Identity)
end
return self
end
end
---#endregion
---#region Concat
do
local function CreateConcatIterator(first, iterator1, second, iterator2, transformer2)
local iterator, source, isSecond = iterator1, first, false
return function(ik)
repeat
for k, v in iterator, source, ik do
return k, v
end
if isSecond then
break
end
iterator, source, isSecond, ik = iterator2, transformer2(second), true, nil
until false
iterator, source = nil, nil
return nil, nil
end
end
local function ConcatIterator(iterator1, transformer1, second, iterator2, transformer2)
if transformer1 then
return CallStatefulIterator, function(t)
return CreateConcatIterator(transformer1(t), iterator1, second, iterator2, transformer2)
end
end
return CallStatefulIterator, function(t)
return CreateConcatIterator(t, iterator1, second, iterator2, transformer2)
end
end
---@param second table|Enumerable
---@return Enumerable
function EnumerableMeta:Concat(second)
if IsEnumerable(second) then
---@cast second Enumerable
self.iterator, self.transformer = ConcatIterator(self.iterator, self.transformer, second.t, second.iterator,
second.transformer or Identity)
else
self.iterator, self.transformer = ConcatIterator(self.iterator, self.transformer, second, next, Identity)
end
return self
end
end
---#endregion
---#region Intersect
do
local function CreateIntersectIterator(first, iterator1, second, iterator2)
local set = {}
for _, v in iterator2, second do
set[v] = true
end
return function(ik)
for k, v in iterator1, first, ik do
if set[v] then
set[v] = nil
return k, v
end
end
set = nil
return nil, nil
end
end
local function IntersectIterator(iterator1, transformer1, second, iterator2, transformer2)
if transformer1 then
return CallStatefulIterator, function(t)
return CreateIntersectIterator(transformer1(t), iterator1, transformer2(second), iterator2)
end
end
return CallStatefulIterator, function(t)
return CreateIntersectIterator(t, iterator1, transformer2(second), iterator2)
end
end
---@param second table|Enumerable
---@return Enumerable
function EnumerableMeta:Intersect(second)
if IsEnumerable(second) then
---@cast second Enumerable
self.iterator, self.transformer = IntersectIterator(self.iterator, self.transformer, second.t,
second.iterator,
second.transformer or Identity)
else
self.iterator, self.transformer = IntersectIterator(self.iterator, self.transformer, second, next, Identity)
end
return self
end
end
---#endregion
---#region Except
do
local function CreateExceptIterator(first, iterator1, second, iterator2)
local set = {}
for _, v in iterator2, second do
set[v] = true
end
return function(ik)
for k, v in iterator1, first, ik do
if not set[v] then
set[v] = true
return k, v
end
end
set = nil
return nil, nil
end
end
local function ExceptIterator(iterator1, transformer1, second, iterator2, transformer2)
if transformer1 then
return CallStatefulIterator, function(t)
return CreateExceptIterator(transformer1(t), iterator1, transformer2(second), iterator2)
end
end
return CallStatefulIterator, function(t)
return CreateExceptIterator(t, iterator1, transformer2(second), iterator2)
end
end
---@param second table|Enumerable
---@return Enumerable
function EnumerableMeta:Except(second)
if IsEnumerable(second) then
---@cast second Enumerable
self.iterator, self.transformer = ExceptIterator(self.iterator, self.transformer, second.t,
second.iterator,
second.transformer or Identity)
else
self.iterator, self.transformer = ExceptIterator(self.iterator, self.transformer, second, next, Identity)
end
return self
end
end
---#endregion
---#region Foreach
do
---Creates an iterator that executes a function for each element in the source iterator without modifying the elements
---@generic K,V
---@param iterator fun(t:table, k:K):K,V @The source iterator
---@param transformer? fun(t:table):table<K,V> @Optional transformer function
---@param func fun(value:V, key:K) @Function to execute for each element
---@return fun(table: table<K,V>, key?: K):K, V @Iterator function that yields the original elements
---@return (fun(t:table):table<K,V>)? @Optional transformer function
local function ForeachIterator(iterator, transformer, func)
return function(t, k)
local v
k, v = iterator(t, k)
if k == nil then
return nil, nil
end
func(v, k)
return k, v
end, transformer
end
---@generic K,V
---@param func fun(value:V, key:K)
---@return Enumerable
function EnumerableMeta:Foreach(func)
if func == nil then
error("Enumerable:Foreach: func is required")
end
self.iterator, self.transformer = ForeachIterator(self.iterator, self.transformer, func)
return self
end
---Executes a callback for each element in the sequence.
---@generic K,V
---@param func fun(value:V, key:K)
---@return Enumerator
function EnumeratorMeta:Foreach(func)
if func == nil then
error("Enumerator:Foreach: func is required")
end
return EnumeratorCreate(ForeachIterator(self.iterator, self.transformer, func))
end
end
---#endregion
---#region Reverse
do
---Creates a transformer that reverses the order of elements in the source iterator
---@generic K,V
---@param iterator fun(t:table, k:K):K,V @The source iterator
---@param transformer? fun(t:table):table<K,V> @Optional transformer function
---@return fun(table: V[], i?: integer):integer, V @ipairs iterator
---@return fun(t:table):V[] @Transformer function that returns array of reversed elements
local function ReverseTransformer(iterator, transformer)
if transformer then
-- Would be nice to have but rn it breaks some things
-- if iterator == _ipairs then
-- return ReverseIPairsIterator, function(t)
-- t = transformer(t)
-- return t, TableGetN(t) + 1
-- end
-- end
return inext, function(t)
local nt = {}
for _, v in iterator, transformer(t) do
TableInsert(nt, 1, v)
end
return nt
end
end
-- if iterator == _ipairs then
-- return ReverseIPairsIterator, function(t)
-- return t, TableGetN(t) + 1
-- end
-- end
return inext, function(t)
local nt = {}
for _, v in iterator, t do
TableInsert(nt, 1, v)
end
return nt
end
end
---@return Enumerable
function EnumerableMeta:Reverse()
self.iterator, self.transformer = ReverseTransformer(self.iterator, self.transformer)
return self
end
---Reverses the sequence.
---@return Enumerator
function EnumeratorMeta:Reverse()
return EnumeratorCreate(ReverseTransformer(self.iterator, self.transformer))
end
end
---#endregion
---#region GroupBy
do
---Creates a transformer that groups elements by a key selector function
---@generic K,V,R
---@param iterator fun(t:table, k:K):K,V @The source iterator
---@param transformer? fun(t:table):table<K,V> @Optional transformer function
---@param selector fun(value: V, key:K):R @Function to select the group key for each element
---@return fun(table: table<R,V[]>, key?: R):R, V[] @Iterator over the grouped elements
---@return fun(t:table):table<R,V[]> @Transformer function that returns table mapping group keys to arrays of elements
local function GroupByTransformer(iterator, transformer, selector)
if transformer then
return next, function(t)
local r = {}
for k, v in iterator, transformer(t) do
local nk = selector(v, k)
r[nk] = r[nk] or {}
TableInsert(r[nk], v)
end
return r
end
end
return next, function(t)
local r = {}
for k, v in iterator, t do
local nk = selector(v, k)
r[nk] = r[nk] or {}
TableInsert(r[nk], v)
end
return r
end
end
---@generic K,V,R
---@param selector fun(value: V, key:K):R
---@return Enumerable
function EnumerableMeta:GroupBy(selector)
if selector == nil then
error("Enumerable:GroupBy: selector is required")
end
self.iterator, self.transformer = GroupByTransformer(self.iterator, self.transformer, selector)
return self
end
---Groups elements in sequence by given selector.
---@generic K,V,R
---@param selector fun(value: V, key:K):R
---@return Enumerator
function EnumeratorMeta:GroupBy(selector)
if selector == nil then
error("Enumerator:GroupBy: selector is required")
end
return EnumeratorCreate(GroupByTransformer(self.iterator, self.transformer, selector))
end
end
---#endregion
---#region OrderBy/OrderByDescending
do
---@generic V,R
---@param selector fun(value:V):R
---@param comparer? fun(left: R, right: R): boolean
local function AscendingSortFunction(selector, comparer)
if comparer then
return function(a, b)
return comparer(selector(a), selector(b))
end
end
return function(a, b)
return selector(a) < selector(b)
end
end
---@generic V,R
---@param selector fun(value:V):R
---@param comparer? fun(left: R, right: R): boolean
local function DescendingSortFunction(selector, comparer)
if comparer then
return function(a, b)
return not comparer(selector(b), selector(a))
end
end
return function(a, b)
return selector(b) > selector(a)
end
end
---@generic K,V
---@param iterator fun(t:table, k:K):K,V
---@param transformer? fun(t:table):table<K,V>
---@param sortFunc fun(left: V, right: V): boolean
---@return fun(table: V[], i?: integer):integer, V
---@return fun(t:table):V[]
local function OrderByTransformer(iterator, transformer, sortFunc)
if iterator == inext then
if transformer then
return inext, function(t)
local nt = transformer(t)
TableSort(nt, sortFunc)
return nt
end
end
return inext, function(t)
TableSort(t, sortFunc)
return t
end
end
if transformer then
return inext, function(t)
local nt = {}
for _, v in iterator, transformer(t) do
TableInsert(nt, v)
end
TableSort(nt, sortFunc)
return nt
end
end
return inext, function(t)
local nt = {}
for _, v in iterator, t do
TableInsert(nt, v)
end
TableSort(nt, sortFunc)
return nt
end
end
---@generic V,R
---@param selector fun(value: V):R
---@param comparer? fun(left:R, right:R):boolean
---@return Enumerable
function EnumerableMeta:OrderBy(selector, comparer)
self.iterator, self.transformer = OrderByTransformer(self.iterator, self.transformer,
AscendingSortFunction(selector, comparer))
return self
end
---@generic V,R
---@param selector fun(value: V):R
---@param comparer? fun(left:R, right:R):boolean
---@return Enumerable
function EnumerableMeta:OrderByDescending(selector, comparer)
self.iterator, self.transformer = OrderByTransformer(self.iterator, self.transformer,
DescendingSortFunction(selector, comparer))
return self
end
---@generic V,R
---@param selector fun(value: V):R
---@param comparer? fun(left:R, right:R):boolean
---@return Enumerator
function EnumeratorMeta:OrderBy(selector, comparer)
return EnumeratorCreate(OrderByTransformer(self.iterator, self.transformer,
AscendingSortFunction(selector, comparer)))
end
---@generic V,R
---@param selector fun(value: V):R
---@param comparer? fun(left:R, right:R):boolean
---@return Enumerator
function EnumeratorMeta:OrderByDescending(selector, comparer)
return EnumeratorCreate(OrderByTransformer(self.iterator, self.transformer,
DescendingSortFunction(selector, comparer)))
end
end
---#endregion
---#region SelectMany
do
---@generic K,V,R
---@param iterator fun(t:table, k:K):K,V
---@param outTable table
---@param outKey any
---@param inTable table
---@param inKey any
---@param index number?
---@return any # outKey
---@return table? # inTable
---@return any # inKey
---@return number? # index
---@return any # value
local function IterateMany(iterator, outTable, outKey, inTable, inKey, index)
if outKey == nil then
outKey, inTable = iterator(outTable, outKey)
inKey = nil
index = 0
end
while true do
local v
inKey, v = next(inTable, inKey)
if inKey ~= nil then
return outKey, inTable, inKey, index + 1, v
end
outKey, inTable = iterator(outTable, outKey)
if outKey == nil then
return nil, nil, nil, nil, nil
end
end
end
---@generic K,V,R
---@param iterator fun(t:table, k:K):K,V
---@param selector fun(any, any):table
---@param outTable table
---@param outKey any
---@param inTable table
---@param inKey any
---@param index number?
---@return any # outKey
---@return table? # inTable
---@return any # inKey
---@return number? # index
---@return any # value
local function IterateManyWithSelector(iterator, selector, outTable, outKey, inTable, inKey, index)
if outKey == nil then
outKey, inTable = iterator(outTable, outKey)
if outKey == nil then
return nil, nil, nil, nil, nil
end
inTable = selector(inTable, outKey)
inKey = nil
index = 0
end
while true do
local v
inKey, v = next(inTable, inKey)
if inKey ~= nil then
return outKey, inTable, inKey, index + 1, v
end