<@U3E25GSEP> it compiles, but is it tail call opti...
# announcementsv
vaskir
09/27/2018, 10:45 AM@robin it compiles, but is it tail call optimized?
a
Andreas Sinz
09/27/2018, 10:46 AMThere is no recursion in there?
r
robin
09/27/2018, 10:46 AMNo function is tail call optimized on the JVM (Except for maybe some optimization the runtime does). You can imitate that behavior in recursive functions by using the
tailrecv
vaskir
09/27/2018, 10:48 AMBut how to do in with
lateinit var ...r
robin
09/27/2018, 10:50 AMI don't think it's possible there. If you really need it you will have to unroll it yourself.
robin
09/27/2018, 10:50 AMI'm interested what you're actually trying to build here, your requirements seem curiously specific
v
vaskir
09/27/2018, 10:59 AMa scatter-and-gather pool of workers, each of which must process a single task at a time and it has capabilities based on it's state (connected/disconnected/failed/paused), it also renews its connection on timely bases or after specific errors.
vaskir
09/27/2018, 11:01 AMyes, it looks like a job for akka 🙂
m
marstran
09/27/2018, 11:04 AMYou can probably use coroutine actors. https://github.com/Kotlin/kotlinx.coroutines/blob/master/docs/shared-mutable-state-and-concurrency.md#actors
v
vaskir
09/27/2018, 11:05 AMI do 🙂
4 Views