Currently exploring purely functional data structures and algorithms based on futures to ensure maximum async progress.
It's early, but so far the problem space feels "fortuitously constrained" to yield particularly clean and efficient solutions.
-
-
Specifically: minimizing dependencies on futures tends to force container designs that minimize combinatorial complexity.
-
forgive me if this is a simple question but is this an area where the concept of reactive steams comes into play?
- 1 more reply
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.