All Downloads are FREE. Search and download functionalities are using the official Maven repository.

groovy.transform.TailRecursive.groovy Maven / Gradle / Ivy

/*
 * Copyright 2013-2014 the original author or authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package groovy.transform

import org.codehaus.groovy.transform.GroovyASTTransformationClass

import java.lang.annotation.ElementType
import java.lang.annotation.Retention
import java.lang.annotation.RetentionPolicy
import java.lang.annotation.Target

/**
 * Class annotation used to transform method with tail recursive calls into iterative methods automagically
 * since the JVM cannot do this itself. This works for both static and non-static methods.
 * 

* It allows you to write a method like this: *

 * class Target {
 *      {@code @TailRecursive}
 *      long sumUp(long number, long sum = 0) {
 *          if (number == 0)
 *              return sum;
 *          sumUp(number - 1, sum + number)
 *      }
 * }
 * def target = new Target()
 * assert target.sumUp(100) == 5050
 * assert target.sumUp(1000000) == 500000500000 //will blow the stack on most machines when used without {@code @TailRecursive}
 * 
* * {@code @TailRecursive} is supposed to work in combination with {@code @CompileStatic} * * Known shortcomings: *
    *
  • Only non-void methods are currently being handled. Void methods will fail compilation. *
  • Only direct recursion (calling the exact same method again) is supported. *
  • Mixing of tail calls and non-tail calls is not possible. The compiler will complain if some recursive calls cannot be handled. *
  • Checking if a recursive call is really tail-recursive is not very strict. You might run into cases where non-tail calls will be considered tail calls. *
  • In the presence of method overloading and method overriding you might run into situations where a call is considered recursive although it really is not. *
  • Catching {@code Throwable} around a recursive might lead to problems *
  • Non trivial continuation passing style examples do not work. *
  • Probably many unrecognized edge cases. *
* * @author Johannes Link * @since 2.3 */ @Retention(RetentionPolicy.SOURCE) @Target([ElementType.METHOD]) @GroovyASTTransformationClass(["org.codehaus.groovy.transform.tailrec.TailRecursiveASTTransformation"]) public @interface TailRecursive { }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy