ackfoobar
Joined 5 years ago
Joined 5 years ago
> That just isn't true
Generational ZGC is free for everyone to use.
AFAIK, in the current implementation, Java's virtual threads yields only when they block (cooperative). But the spec allows a JVM to implement them as preemptive.
Then they added structured concurrency, which roughly solves the same problem as Go's context, arguably more elegantly.
I worked on a purely functional Scala codebase (Cats). I joined after the original authors were gone.
Some new comers were not fluent in it after ~a year.
https://en.wikipedia.org/wiki/Committee_to_End_Pay_Toilets_i...
Maybe the definition covers both, but I still think it's worth distinguishing between incentives creating a bad equilibrium and simply antisocial behaviours. When I hear "tragedy of the commons", I think of the former.
Quite the opposite. "When Jarred announced the Rust rewrite, we were ecstatic."
> It’s definitionally an ad hominem against Jared.
Who Jarred is, as a CEO, definitely has an impact on how the company develops software - how Zig is used. And the argument is that Zig is used badly in Bun. Without that context, I, as a reader, would have to actually read through a lot of code to be convinced of that point.
> This feature does have some limitations, for instance when we have multiple nested function calls, but in those cases an explicit lambda expression is always still possible.
I've also complained about that a while ago https://news.ycombinator.com/item?id=35707689
---
The solution is to delimit the level of expression the underscore (or dollar sign suggested in the article) belongs to. In Kotlin they use braces and `it`.
{ add(it, 3) } // Kotiln
add(_, 3) // Scala
Then modifying the "hole in the expression" is easy. Suppose we want to subtract the first argument by 2 before passing that to `add`: { add(subtract(it, 2), 3) } // Kotlin
// add(subtract(_, 2), 3) // no, this means adding 3 to the function `add(subtract(_, 2)`
x => { add(subtract(x, 2), 3) } // ScalaIn that case I want the signature of "this function pre-computes, then returns another function" and "this function takes two arguments" to be different, to show intent.
> achieved through compiler optimisation
Haskell is different in that its evaluation ordering allows this. But in strict evaluation languages, this is much harder, or even forbidden by language semantics.
Here's what Yaron Minsky (an OCaml guy) has to say:
> starting from scratch, I’d avoid partial application as the default way of building multi-argument functions.
https://discuss.ocaml.org/t/reason-general-function-syntax-d...
I think Java (or other JVM languages) are then best positioned, because of jooq. Still the best SQL generation library I've used.
I use ShiftIt (a lovely project, but dead) reimplemented in Hammerspoon. It is very comprehensive.
There are just too many ways to use Scala, and everyone thinks they're doing it "idiomatically".