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

• FuncFrog

  12 204 8.7 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!

• lo

  64 15,348 5.8 Go

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

• InfluxDB

  www.influxdata.com sponsored

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

• FuncFrog

  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:

• go

  2,068 119,564 10.0 Go

  The Go programming language

  

Suggest a related project