Tail call optimized / stackless recursion fibonacci sequence in Java 8 using cyclops-react

tail-call-optimized-fib.java

import static com.aol.cyclops.control.Trampoline.done;
import static com.aol.cyclops.control.Trampoline.more;

public void fib() {
    for(int i=0;i<100_000;i++)
       System.out.println(fibonacci(i, 0l, 1l).get());
}

public Trampoline<Long> fibonacci(Integer count, Long a, Long b) {
     return  count==0 ?  done(a) : more(()->fibonacci (count - 1, b, a + b));
}