[mappu]

Piling on here - My impression of your snippet here is that GroupBy() and Values() both construct (potentially very large) temporary arrays on the stack.

Maybe Haskell and F# can elide this kind of thing, but it's not something the Go compiler is going to do.

[Yoric]

Rust and OCaml (the latter if you use the right libraries) can definitely avoid it. Why couldn't Go?

[skjfdoslifjeifj]

The standard Ocaml compiler doesn't elide it and as far as I'm aware neither do any of the publicly available libraries. All of the lazy stream implementations in Ocaml have a performance cost similar to Java streams. Haskell and Rust are relatively unique in that they can completely eliminate the performance cost in the typical cases.

[mappu]

An alternate-universe Go with a lot more (& slower) compiler passes could do it, but I don't believe there are any plans to build such a thing. As it stands, this kind of code (where all intermediates have type []T) will run much more poorly than you could do with imperative loops.

The final generics design is probably not expressive enough to do it ergonomically in user code neither (building something where the intermediates are a library type with a last `.something()` call to collect a final []T).

[pjmlp]

OCaml compiles as fast Go.

No secret sauce, just having the pleasure of chosing multiple backends, including an interpreter.

Bytecode runtime during workflow, optimized native AOT for release and final production tests.

[duped]

That's just bad design - iterators and sequences need to be lazy. The intermediary type should not eagerly create large arrays on the stack, it should only ever do real work once the iterator has been driven.

[rad_gruchalski]

No, they don’t need to be. They can be. Go wasn’t designed as a functional language but to be fast to compile, fast to execute, zero dependency binary and simple syntax. It achieved that by a mile.

[duped]

Implementing iterator combinators by eagerly evaluating them into temporaries is a bad, naïve design that results in the issue illustrated above.

A much better design is to do it lazily which is possible if you can store closures as fields of a data structure.

Not sure what fast compilation and execution or dependencies has to do with this. Implementing iterators that way is the worst possible solution that results in slow execution that can blow up the stack and crash a program. It would be better not to have iterators at all than to require them to be eagerly evaluated.

You can support functional features without being a Haskell...

[rad_gruchalski]

Yes, lots of science. Go has slices which require specifying a size and you iterate over them using a for statement. You want lazy, pop in a channel and do it lazy.

[skybrian]

That’s probably okay if the code is I/O bound anyway, but in Go it will run a lot slower than doing multiple steps within a single for loop.

For loops may be unfashionable but they aren’t hard to read.

[duped]

I don't find iterator combinations hard to read. Especially with postfix methods.

I do find deeply nested for loops with outer variables that might start uninitialized or need to be mutable much more difficult to read.

[skybrian]

Sometimes moving an inner for loop to a separate function (that will likely be inlined) is better to explicitly show its inputs and outputs.

[mappu]

I agree they need to be lazy. This is why it's problematic - Go is only adding generics and not laziness.

[wrnr]

I've been waiting to do things like that in Go for a long time. It can be done efficiently just like the Java Stream interface.

[Serow225]

FWIW C# would as well (LINQ)