If I'm implementing take via unfold, what's the di...

# functional

[Jakub Pi]

If I'm implementing take via unfold, what's the difference between encoding the remaining n as part of the state vs a recursive call?

[Jakub Pi]

fun <A> Stream<A>.take(n: Int): Stream<A> = 
    unfold(Pair(this, n)) { (s, n) -> 
        if (s is Cons && n > 0) Some(Pair(s.h(), Pair(s.t(), n-1)))
        else None
    }

[Jakub Pi]

fun <A> Stream<A>.take(n: Int): Stream<A> =
    unfold(this) { s ->
        if (s is Cons && n > 0) Some(Pair(s.h(), s.t().take(n-1)))
        else None
    }

[Jakub Pi]

Are they both equally viable, and are there some hidden costs associated with one of them?