FuncFrog
filter
FuncFrog | filter | |
---|---|---|
12 | 18 | |
279 | 838 | |
0.7% | - | |
6.9 | 0.0 | |
5 months ago | about 2 years ago | |
Go | Go | |
MIT License | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
FuncFrog
-
I wrote a for loop so you don't have to. Parallel Map, Filter, Reduce library
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!
-
Functional Programming Library for Golang by IBM
if it have to be in FP style, this one is better
https://github.com/koss-null/FuncFrog
still prefer non-FP part tho
-
FuncFrog: fast, parallel and lazy stream-api. Please help me with the code review and project development ideas
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.
-
FuncFrog - fast stream-API like library got it first stable release!
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
-
Fast Golang Stream API (lazy, inline-friendly, parallel) as an alternative for RxGo
Check this out. I will be glad to any comments and notes https://github.com/koss-null/lambda/tree/0.3.0
-
What necessary packages or functions that Go doesn't have?
I am rly strugging with it developing this:https://github.com/koss-null/lambda
-
Another update on my Nifty inline filtering, map and reduce library.
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
- Looking for libraries ideas to develop
- Have you moved from Java to Go (or another popular language).
-
Parallel, lazy evaluated Java Stream API-like library for Go is closer to the release than ever
Check the code out here: https://github.com/koss-null/lambda
filter
-
Querying and transforming object graphs in Go
Here’s Rob Pike’s (one of the original Go designers) attempt to “see what the hubbub is all about”: https://github.com/robpike/filter
- Future language enhancements to go
-
Why Golang instead of Kotlin?
I find the language really solid but asking on r/golang is quite an adventure. It's extremely distant from go's spirit, the grammar is even more rich than Rust. Typical example: let, run, with, apply, and also - they all practically do the same but with a different scope of this and return value. Just looking at the flow API can get your head spinning. To illustrate how much it's completely the opposite of Go, see how Rob Pike pokes fun at map/filter and tells people they should not use it . I guess you can't force all developers to adhere to this mental model, but that's about it, but that's about it, technical arguments are irrelevant except for extremely niche concerns about memory and startup time
-
Supporting the Use of Rust in the Chromium Project
I mean sure, let's praise the ergonomics of channels and the reliability of maps. As for datastructures, we already have datastructures at home . They just work fine. Nobody needs more than that because rob pike told us so
-
Why isn’t Go used in AI/ML?
Go will never have a map/filter syntax, to the point rob pike even makes fun of it , do you really want to use it for that kind of domain ?
-
State of Rust for web backends
Also since generators are mentioned I recently came across this rob pike moment, he implemented a reduce function that takes and returns all interface{} types and uses reflection to check if the call is valid at runtime - that's the most typical Go that can ever be written in 40 lines - all that to make the point that it's useless. Such a great spirit. https://github.com/robpike/filter
- Go 1.21 may have a clear(x) builtin and there's an interesting reason why
- What necessary packages or functions that Go doesn't have?
-
Golang is so fun to write
A few points that stood out to me: error handling in Go is generally pretty good. It's much more performant compared to throwing exceptions and the high frequency of error handling helps a lot with debugging and avoiding unexpected errors. What you've described as "poor OOP'ish" is partly true, yes Go does poor OOP, because it doesn't try to do OOP. The language favours composition over inheritance. Strongly applying OOP concepts in Go is simply not using the language in its intended way. For implicit interfaces, it's completely fair that you don't like them, but it's not a disadvantage of the language. I for one find implicit interfaces very intuitive and feel it's the right way for it to be done. No function overloading and lack of ternary operations is absolutely intentional, both of these are overcome by writing more expressive code, which is not a bad thing. Similarly with no built in map/filter/find, these can be achieved using for-loops. Reference https://github.com/robpike/filter for Rob Pike's implementation of filter, stating in the readme that there's not much use for it and to just use for-loops instead. Last thing, enums are expressed using iota: https://go.dev/ref/spec#Iota
-
Lies we tell ourselves to keep using Golang
> I didn't get that desire for purity that you gleaned from it.
'Folks who develop an allergic reaction to "big balls of mutable state without sum types" tend to gravitate towards languages that gives them control over mutability, lifetimes, and lets them build abstractions.'
This mutability argument is present throughout the article. Seems like nothing sans Rust or niche functional languages is enough.
> Nil pointer exceptions, for example, don't have to exist anymore..
The language most notorious for those is Java due to almost everything being passed via a nullable reference. When everything can be nullable, how can you know where to check for it? Go addresses this to an extent by explicitly separating pointers from values. Values are the default and cannot be nil, so the opportunity for null dereferences is greatly diminished. It's not a perfect solution, but it's not nothing either.
> and yet they do in Go because they couldn't be bothered to add sum types.
Damn those lazy Go devs!
> Its type system is barely a step above a dynamic language.
Turns out even a basic type system is a huge improvement over none. Just being able to restrict values to concrete types goes a long way.
> You have to write the same imperative looping code over and over because Rob Pike would rather just use a for loop than something mildly expressive like map or filter (https://github.com/robpike/filter).
There are arguments to be made either way, but I definitely agree generics (along with iterators) should have been there since day 1.
> Every function that does meaningful work is littered with if err != nil { return err }.
One big positive of this that I don't see in other languages is every `return` in a function must be on the start of a line. That is, every single exit path of a function is easily findable by visually scanning
What are some alternatives?
fp-go - functional programming library for golang
Weaviate - Weaviate is an open-source vector database that stores both objects and vectors, allowing for the combination of vector search with structured filtering with the fault tolerance and scalability of a cloud-native database.
access-key-rotator - A PoC how to rotate your IAM access keys and store them in Github secrets
ply - Painless polymorphism
rss-bot - Telegram bot for RSS feeds
go-onnxruntime - Unofficial C binding for Onnxruntime in Golang.
lrpc - Simple, lightweight, multi-codec RPC library for Go.
goonnx - Go language bindings for ONNX runtime
gofpher - a collection of functional programming constructs for go
glinq - Go port of DotNet LINQ using generics introduced in Go 1.18
unlocker - ⚠️ Replaced by ItalyPaleAle/Revaulter! -- Wrap and unwrap keys using a key vault with admin consent
datastation - App to easily query, script, and visualize data from every database, file, and API.