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

1. FuncFrog

   1 12 278 6.9 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. InfluxDB

   www.influxdata.com featured

   InfluxDB – Built for High-Performance Time Series Workloads. InfluxDB 3 OSS is now GA. Transform, enrich, and act on time series data directly in the database. Automate critical tasks and eliminate the need to move data externally. Download now.

   

3. lo

   2 65 19,417 9.1 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,262 127,772 10.0 Go

   The Go programming language

   

Suggest a related project