Clover coverage report - PLT Utilities Test Coverage (plt-20120304-r5436)
Coverage timestamp: Sat Mar 3 2012 22:01:56 CST
file stats: LOC: 73   Methods: 3
NCLOC: 14   Classes: 1
 
 Source file Conditionals Statements Methods TOTAL
PendingContinuation.java 100% 83.3% 66.7% 81.8%
coverage coverage
 1    /*BEGIN_COPYRIGHT_BLOCK*
 2   
 3    PLT Utilities BSD License
 4   
 5    Copyright (c) 2007-2010 JavaPLT group at Rice University
 6    All rights reserved.
 7   
 8    Developed by: Java Programming Languages Team
 9    Rice University
 10    http://www.cs.rice.edu/~javaplt/
 11   
 12    Redistribution and use in source and binary forms, with or without modification, are permitted
 13    provided that the following conditions are met:
 14   
 15    - Redistributions of source code must retain the above copyright notice, this list of conditions
 16    and the following disclaimer.
 17    - Redistributions in binary form must reproduce the above copyright notice, this list of
 18    conditions and the following disclaimer in the documentation and/or other materials provided
 19    with the distribution.
 20    - Neither the name of the JavaPLT group, Rice University, nor the names of the library's
 21    contributors may be used to endorse or promote products derived from this software without
 22    specific prior written permission.
 23   
 24    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
 25    IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
 26    FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND
 27    CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 28    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 29    DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
 30    IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 31    OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 32   
 33    *END_COPYRIGHT_BLOCK*/
 34   
 35    package edu.rice.cs.plt.recur;
 36   
 37    import edu.rice.cs.plt.lambda.Lambda;
 38   
 39    /**
 40    * A continuation representing computation left to be done (in contrast to {@link ValueContinuation},
 41    * which represents a completed computation). This class provides default implementations of
 42    * {@link #value}, {@link #isResolved}, and {@link #compose}. Subclasses may be defined in one of two
 43    * ways:<ul>
 44    * <li>Simple tail calls may be represented by simply defining an anonymous subclass of
 45    * {@code PendingContinuation}, where the {@code step()} method wraps the delayed recursive invocation.</li>
 46    * <li>More complex cases may be handled by defining continuation classes that extend
 47    * {@code PendingContinuation}. {@link ComposedContinuation} is one example.</li>
 48    * </ul>
 49    */
 50    public abstract class PendingContinuation<T> implements Continuation<T> {
 51   
 52    /** Iteratively invoke {@code step()} until a resolved continuation is produced. */
 53  16 public T value() {
 54  16 Continuation<? extends T> k = this;
 55  2840 while (!k.isResolved()) { k = k.step(); }
 56  16 return k.value();
 57    }
 58   
 59    /** Return {@code false}. */
 60  3862 public boolean isResolved() { return false; }
 61   
 62    /** Create a {@code ComposedContinuation} in terms of this object and the provided function. */
 63  0 public <R> Continuation<R> compose(Lambda<? super T, ? extends Continuation<? extends R>> c) {
 64  0 return new ComposedContinuation<T, R>(this, c);
 65    }
 66   
 67    /**
 68    * Defines the next step of the continuation. For simple tail calls, this is generally a recursive
 69    * invocation of the current method (or a related method).
 70    */
 71    public abstract Continuation<? extends T> step();
 72   
 73    }