I wrote a for loop so you don't have to. Parallel Map, Filter, Reduce library

1. FuncFrog

   1 12 285 7.2 Go

   Stream api (kind of) implementation for go, other useful functions and packages to use go in a functional way

   

   func GetIDs(...) ([]string, ...) { <...> users := GetUsers(...) return ff.Map(users, domain.UserGetID).Do(), ... } ``` Now it's that easy! Furthermore you may like to write gogenerate function to generate such methods for each domain struct. Also there are more cool features, minimal-lock parallelism, error handling etc. in the libtaty https://github.com/koss-null/FuncFrog Cheers!

2. SaaSHub

   www.saashub.com featured

   SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives

   

3. lo

   2 67 21,327 9.3 Go

   💥 A Lodash-style Go library based on Go 1.18+ Generics (map, filter, contains, find...)

   

4. FuncFrog

   3 1 0 8.5

   Stream api (kind of) implementation for go, other useful functions and packages to use go in a functional way (by mattayes)

   

   Yeah, standard implementation meant using a vanilla for loop. I created a benchmark matching the example given above, here were my results:

5. go

   4 2,418 134,656 10.0 Go

   The Go programming language

   

Suggest a related project