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: 16   Classes: 1
 
 Source file Conditionals Statements Methods TOTAL
BinaryArgContinuation.java - 100% 100% 100%
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 for results that depend on a two recursive invocations, followed by some
 41    * additional computation. Instances must implement {@link #arg1}, which wraps the first recursive
 42    * invocation, {@link #arg2}, which wraps the second, and {@link #apply}, which performs the remaining
 43    * computation.
 44    */
 45    public abstract class BinaryArgContinuation<T1, T2, R> extends PendingContinuation<R> {
 46   
 47    /** Produce a continuation computing the first result of a recursive invocation. */
 48    protected abstract Continuation<? extends T1> arg1();
 49   
 50    /** Produce a continuation computing the second result of a recursive invocation. */
 51    protected abstract Continuation<? extends T2> arg2();
 52   
 53    /**
 54    * Given the results of evaluating {@code arg1()} and {@code arg2()}, produce a continuation for
 55    * the ultimate result.
 56    */
 57    protected abstract Continuation<? extends R> apply(T1 arg1, T2 arg2);
 58   
 59    /**
 60    * Create a {@link ComposedContinuation} in terms of the result of {@code arg1()} and a lambda
 61    * that computes {@code arg2()} and ultimately invokes {@code apply()} with the results.
 62    */
 63  514 public Continuation<R> step() {
 64  514 return new ComposedContinuation<T1, R>(arg1(), new Lambda<T1, Continuation<? extends R>>() {
 65  514 public Continuation<? extends R> value(final T1 arg1) {
 66  514 return new ComposedContinuation<T2, R>(arg2(), new Lambda<T2, Continuation<? extends R>>() {
 67  514 public Continuation<? extends R> value(T2 arg2) { return apply(arg1, arg2); }
 68    });
 69    }
 70    });
 71    }
 72   
 73    }