Oh wow, proof of concept :open_mouth: This one run...

# coroutines

[Marc Knaup]

Oh wow, proof of concept 😮
This one runs forever, recursively.

suspend fun main() {
    recurse(1)
}


suspend fun recurse(n: Int) {
    if (n % 1000 == 0)
        delay(1)

    println(n)
    recurse(n+1)

    print("")
}

Question is now how to implement that manually, with @RestrictsSuspension and without the 1ms penalty 😄
And how to figure out a good n % something as it depends on the stack size usage of each function in the call stack.

[Ruckus]

I can't answer all of your question, but you should at least be able to replace delay(1) with yield()

[Marc Knaup]

I've tried that, but it always overflows then 🤔

[louiscad]

@Marc Knaup With which kotlinx.coroutines version and which dispatcher?

[Marc Knaup]

1.3.3 and whatever dispatcher a suspend fun main is using.

[louiscad]

It's using `Dispatchers.Default`… by default.

[louiscad]

Can't you make the function tail recursive? tailrec

[Marc Knaup]

No, it’s a complex full-blown visitor pattern, and visitors can do whatever they like 🙂

[Marc Knaup]

That’s especially crazy with parallel recursive visitors 😄

start visiting
-> visit node X using visitor 1
-> visitor1.visit(X)
-> visit children
-> visit node X using visitor 2
-> visitor2.visit(X)
-> visit children
-> visit node Y using visitor 1
-> visitor1.visit(Y)
-> visit children
-> visit node Y using visitor 2
-> visitor2.visit(Y)
-> visit children
-> and so on

[Marc Knaup]

visit children and visit node … using visitor … are controlled by me.
visitor….visit(…) can be arbitrary code, by every class that implements a Visitor.

[louiscad]

I think @orangy or @elizarov did an experiment with such a recursive logic, they might be able to bring some valuable input from their experience.

[Marc Knaup]

I’ve seen Roman’s work and it goes in the same direction 🙂