Understanding how to convert recursive to a trampoline

Question

I've recently read about trampolining as a way to eliminate tail calls. I'd like to convert one of my functions to something that utilizes trampolines, but I'm having a tough time getting going (I'm coming here from the OO world).

def buildTree (X:DenseMatrix[Double], Y:DenseVector[Double], minBucket:Int):Node = {
        // Get the split variable, split point and data for this data
        val (splitVar, splitPoint, leftX, leftY, rightX, rightY) = chooseSplit(X, Y, minBucket);
        // If we couldn't find a split, then we have a leaf
        if(splitVar == Double.NegativeInfinity){
            new Node(Y)
        }else{
            // Otherwise recursively build the children and create yourself as a vertex
            val left =  buildTree(leftX, leftY, minBucket))
            val right = buildTree(rightX, rightY, minBucket))
            new Node(Y, splitVar, splitPoint, left, right)
        }
    }

Specifically, if I have two different recursive calls I want to make in a 'More()' statement, is that okay?

score 2 · Accepted Answer · answered Apr 02 '14 at 16:13

Your buildTree method does not make any tail calls and therefore cannot take advantage of trampolining. Tail calls are an optimization for when the return value of a method is result of another method call. It allows the stack frame to be replaced with that of the function being called. Without tail call optimization, recursive function calls will cause the stack to increase in size, possible resulting in a stack overflow. Your buildTree method does call itself twice, but the original stack frame has to remain so the result of the two function calls can be combined in creating the new Node.

The JVM has no built in support for tail all optimization, but Scala has a hack for tail calls where a function invokes itself. Scala replaces these recursive functions calls with a jump to the beginning of the function, effectively turning the recursion into iteration. Unfortunately, this doesn't work for co-recursive calls (e.g. when method A calls B which calls A). Trampolining can be used here instead, either based on a special monad, or abusing exception handling. There is no reason to use trampolining elsewhere.

Understanding how to convert recursive to a trampoline

1 Answers1