FuncFrog VS fp-go

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!

if it have to be in FP style, this one is better

https://github.com/koss-null/FuncFrog

still prefer non-FP part tho

Hi there! I have finally released a stable version of my stream-like library. It supports some basic features such as Map, Reduce, Filter, Sort, Any, First on any slice or generating function, easy out-of-the-box parallelism with minimum locks and overhead on a regular for cycle. Here it is: https://github.com/koss-null/FuncFrog First of all I will appreciate any code review. Any feedback are welcome. At second, I want to ask the community, what features do you expect to be in such kind of a library and how do you expect them to be implemented? It looks like I need to add some Collect function to be able to produce not only slices, and also add some sources such as BufferedReader or channel.

Hi gophers! In last months I've been working on a FuncFrog - java stream-api - like library, which is fast, parallel, lazy-evaluated and generic-based! You can check it out here: https://github.com/koss-null/FuncFrog

Check this out. I will be glad to any comments and notes https://github.com/koss-null/lambda/tree/0.3.0

I am rly strugging with it developing this:https://github.com/koss-null/lambda

Hi! Some te ago I've released the first beta of my stream-api like library. It have become much more useful and stable since then. Here is is: https://github.com/koss-null/lambda

Check the code out here: https://github.com/koss-null/lambda

True, however the README does link to this:

https://github.com/IBM/fp-go/tree/main/samples