Clover coverage report - PLT Utilities Test Coverage (plt-20120304-r5436)
Coverage timestamp: Sat Mar 3 2012 22:01:56 CST
Overview   Package   File
    FRAMES   NO FRAMES  
file stats: LOC: 125   Methods: 18
NCLOC: 73   Classes: 1
 
 Source file Conditionals Statements Methods TOTAL
FilteredRelation.java 0% 0% 0% 0%
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.collect;
 36   
 37    import java.util.Iterator;
 38    import java.io.Serializable;
 39    import edu.rice.cs.plt.lambda.Predicate;
 40    import edu.rice.cs.plt.lambda.Predicate2;
 41    import edu.rice.cs.plt.lambda.LambdaUtil;
 42    import edu.rice.cs.plt.tuple.Pair;
 43    import edu.rice.cs.plt.tuple.Option;
 44    import edu.rice.cs.plt.iter.FilteredIterator;
 45    import edu.rice.cs.plt.object.Composite;
 46    import edu.rice.cs.plt.object.ObjectUtil;
 47   
 48    /**
 49    * A relation that contains only those pairs contained by both the given relation and the given
 50    * predicate. Note that size operations will take linear time.
 51    */
 52    public class FilteredRelation<T1, T2> extends AbstractRelation<T1, T2> implements Composite, Serializable {
 53   
 54    protected final Relation<T1, T2> _rel;
 55    protected final Predicate2<? super T1, ? super T2> _pred;
 56    private final PredicateSet<T1> _firstSet;
 57    private final PredicateSet<T2> _secondSet;
 58   
 59  0 public FilteredRelation(Relation<T1, T2> relation, Predicate2<? super T1, ? super T2> predicate) {
 60  0 _rel = relation;
 61  0 _pred = predicate;
 62  0 _firstSet = new FilteredSet<T1>(_rel.firstSet(), new Predicate<T1>() {
 63  0 public boolean contains(T1 first) {
 64  0 for (T2 second : _rel.matchFirst(first)) {
 65  0 if (_pred.contains(first, second)) { return true; }
 66    }
 67  0 return false;
 68    }
 69    });
 70  0 _secondSet = new FilteredSet<T2>(_rel.secondSet(), new Predicate<T2>() {
 71  0 public boolean contains(T2 second) {
 72  0 for (T1 first : _rel.matchSecond(second)) {
 73  0 if (_pred.contains(first, second)) { return true; }
 74    }
 75  0 return false;
 76    }
 77    });
 78    }
 79   
 80  0 public int compositeHeight() { return ObjectUtil.compositeHeight(_rel, _pred) + 1; }
 81  0 public int compositeSize() { return ObjectUtil.compositeSize(_rel, _pred) + 1; }
 82   
 83  0 @Override public boolean isEmpty() { return _rel.isEmpty() || super.isEmpty(); }
 84  0 public boolean isInfinite() { return false; }
 85  0 public boolean hasFixedSize() { return false; }
 86  0 public boolean isStatic() { return false; }
 87   
 88  0 public boolean contains(T1 first, T2 second) {
 89  0 return _rel.contains(first, second) && _pred.contains(first, second);
 90    }
 91   
 92  0 public boolean contains(Object obj) {
 93  0 Option<Pair<T1, T2>> cast = CollectUtil.castIfContains(_rel, obj);
 94  0 if (cast.isSome()) {
 95  0 Pair<T1, T2> p = cast.unwrap();
 96  0 return _pred.contains(p.first(), p.second());
 97    }
 98  0 else { return false; }
 99    }
 100   
 101  0 public Iterator<Pair<T1, T2>> iterator() {
 102  0 return FilteredIterator.make(_rel.iterator(), LambdaUtil.<T1, T2>unary(_pred));
 103    }
 104   
 105  0 public PredicateSet<T1> firstSet() { return _firstSet; }
 106   
 107  0 public PredicateSet<T2> matchFirst(final T1 first) {
 108  0 return new FilteredSet<T2>(_rel.matchFirst(first), new Predicate<T2>() {
 109  0 public boolean contains(T2 second) {
 110  0 return _pred.contains(first, second);
 111    }
 112    });
 113    }
 114   
 115  0 public PredicateSet<T2> secondSet() { return _secondSet; }
 116   
 117  0 public PredicateSet<T1> matchSecond(final T2 second) {
 118  0 return new FilteredSet<T1>(_rel.matchSecond(second), new Predicate<T1>() {
 119  0 public boolean contains(T1 first) {
 120  0 return _pred.contains(first, second);
 121    }
 122    });
 123    }
 124   
 125    }
 
CloverReport generated by Clover Code Coverage v1.3.14
Sat Mar 3 2012 22:01:57 CST.		   Open Source License registered to the DrJava Project. This license of Clover is provided to support the development of DrJava only.