zishuo/lo
1
0
Fork 0
mirror of https://github.com/samber/lo.git synced 2025-10-07 08:50:56 +08:00
Code Issues Packages Projects Releases Wiki Activity
372 Commits 47 Branches 62 Tags
1a60415ae9bfed50b51ef3b496653b5cb00d9a1e
Commit Graph

63 Commits

Author SHA1 Message Date
Samuel Berthe
6acbd95b44 Merge pull request #18 from quantumsheep/patch-1 
Improve `Map[T any, R any]` speed
 2022-03-08 12:46:06 +01:00
Yusuke Yajima
4785574798 Add FlatMap 2022-03-08 13:17:03 +09:00
Nathanael Demacon
0ce5602ac1 Improve Map[T any, R any] speed 2022-03-07 10:20:25 +01:00
Samuel Berthe
74d4363ffc Merge pull request #11 from HirbodBehnam/master 
Use struct{} for sets
 2022-03-05 23:16:58 +01:00
Samuel Berthe
98ecdea940 adding Sample+Samples 2022-03-05 23:13:18 +01:00
Samuel Berthe
2d3ea84ba6 feat: adding attempt + repeat + times 2022-03-05 21:24:37 +01:00
HirbodBehnam
1def922659 Use struct{} for sets 2022-03-05 22:00:44 +03:30
Samuel Berthe
0c3545daf3 feat: adding lo.PartitionBy + lop.PartitionBy + lo.GroupBy 2022-03-05 18:44:39 +01:00
Samuel Berthe
a233d0efe3 💄 2022-03-05 01:28:53 +01:00
retornam
a117131e75 Use rand.Shuffle for Shuffle 
The default Shuffle from rand implements
Fisher-Yates Shuffle algorithm[1] which is
better than naive shuffling.

[1] https://en.wikipedia.org/wiki/Fisher–Yates_shuffle
 2022-03-04 15:13:21 -08:00
Samuel Berthe
60559e145a adding index arguments to Map, ForEach and Reduce 2022-03-03 14:07:25 +01:00
Bluskript
d1c9c5f04b make Filter have a second argument for index 2022-03-03 07:29:16 -05:00
Samuel Berthe
74b7c77702 Initial commit 2022-03-02 13:52:01 +01:00