Conc: Better Structured Concurrency for Go

Re:Conc: Better Structured Concurrency for Go by stephen123 on Wednesday January 11, 2023 @08:12PM (#34347707)

The main difference is that reading from channels will block if its empty where Futures, return the same value.

Written more concisely.

f := New(func() Type{return t}) v := g.Get() w := g.Get()

[ Parent | on HN ]

Re:Conc: Better Structured Concurrency for Go by ilyt on Wednesday January 11, 2023 @08:15PM (#34347747)

I wish Go had macros a'la Rust, it would be possible to write the whole thing in so much nicer way.

[ Parent | on HN ]

Re:Conc: Better Structured Concurrency for Go by philosopher1234 on Thursday January 12, 2023 @01:26AM (#34349927)

say good bye to all your nice tooling, fast compile times, uniform code bases...

Programmer write cost <<<<<<<<< read cost

[ Parent | on HN ]

Re:Conc: Better Structured Concurrency for Go by sa46 on Thursday January 12, 2023 @02:09AM (#34350194)

When do you find reusing a promise useful? I know one canonical example is a loadable hashmap as in Concurrent Programming in Java, but I was curious if you knew of other examples.

[ Parent | on HN ]