Clover coverage report - PLT Utilities Test Coverage (plt-20120304-r5436)
Coverage timestamp: Sat Mar 3 2012 22:01:56 CST
file stats: LOC: 85   Methods: 7
NCLOC: 29   Classes: 1
 
 Source file Conditionals Statements Methods TOTAL
IntersectionRelation.java - 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 edu.rice.cs.plt.iter.IterUtil;
 38   
 39    /**
 40    * The intersection of two relations, lazily constructed and updated dynamically. This improves on
 41    * a general {@code FilteredRelation} by taking advantage of the fact that the predicate used for
 42    * filtering is also a relation.
 43    */
 44    public class IntersectionRelation<T1, T2> extends FilteredRelation<T1, T2> {
 45   
 46    /**
 47    * For best performance of {@link #iterator}, {@link #size}, and {@link #isEmpty}, {@code set2}
 48    * should be the smaller of the two sets (this is not handled automatically because calculating
 49    * sizes may be expensive).
 50    */
 51  0 public IntersectionRelation(Relation<? super T1, ? super T2> rel1, Relation<T1, T2> rel2) {
 52  0 super(rel2, rel1);
 53    }
 54   
 55  0 @Override public PredicateSet<T2> matchFirst(T1 first) {
 56    // cast is valid but current rules don't allow it
 57  0 @SuppressWarnings("unchecked")
 58    Relation<? super T1, ? super T2> rel1 = (Relation<? super T1, ? super T2>) _pred;
 59  0 return new IntersectionSet<T2>(rel1.matchFirst(first), _rel.matchFirst(first));
 60    }
 61   
 62  0 @Override public PredicateSet<T1> matchSecond(T2 second) {
 63    // cast is valid but current rules don't allow it
 64  0 @SuppressWarnings("unchecked")
 65    Relation<? super T1, ? super T2> rel1 = (Relation<? super T1, ? super T2>) _pred;
 66  0 return new IntersectionSet<T1>(rel1.matchSecond(second), _rel.matchSecond(second));
 67    }
 68   
 69  0 public boolean isInfinite() {
 70  0 return ((Relation<?, ?>) _pred).isInfinite() && IterUtil.isInfinite(_rel);
 71    }
 72   
 73  0 public boolean hasFixedSize() {
 74  0 return ((Relation<?, ?>) _pred).hasFixedSize() && IterUtil.hasFixedSize(_rel);
 75    }
 76   
 77  0 public boolean isStatic() {
 78  0 return ((Relation<?, ?>) _pred).isStatic() && IterUtil.isStatic(_rel);
 79    }
 80   
 81  0 @Override public boolean isEmpty() {
 82  0 return ((Relation<?, ?>) _pred).isEmpty() || (_rel != _pred && super.isEmpty());
 83    }
 84   
 85    }