| Clover coverage report - PLT Utilities Test Coverage (plt-20130623-r5436) |
|
 |
|
|||||||||||||||||||
| Source file | Conditionals | Statements | Methods | TOTAL | |||||||||||||||
| ComplementRelation.java | 0% | 0% | 0% | 0% |
|
||||||||||||||
| 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 | import edu.rice.cs.plt.lambda.LambdaUtil; | |
| 39 | import edu.rice.cs.plt.lambda.Predicate2; | |
| 40 | ||
| 41 | /** | |
| 42 | * The complement of a relation {@code excluded} in a domain {@code domain} (alternatively, | |
| 43 | * {@code domain - excluded}), constructed lazily and updated dynamically. | |
| 44 | */ | |
| 45 | public class ComplementRelation<T1, T2> extends FilteredRelation<T1, T2> { | |
| 46 | ||
| 47 | private final Relation<? super T1, ? super T2> _excluded; | |
| 48 | ||
| 49 | 0 | public ComplementRelation(Relation<T1, T2> domain, Relation<? super T1, ? super T2> excluded) { |
| 50 | 0 | super(domain, LambdaUtil.negate((Predicate2<? super T1, ? super T2>)excluded)); |
| 51 | 0 | _excluded = excluded; |
| 52 | } | |
| 53 | ||
| 54 | 0 | @Override public PredicateSet<T2> matchFirst(T1 first) { |
| 55 | 0 | return new ComplementSet<T2>(_rel.matchFirst(first), _excluded.matchFirst(first)); |
| 56 | } | |
| 57 | ||
| 58 | 0 | @Override public PredicateSet<T1> matchSecond(T2 second) { |
| 59 | 0 | return new ComplementSet<T1>(_rel.matchSecond(second), _excluded.matchSecond(second)); |
| 60 | } | |
| 61 | ||
| 62 | 0 | public boolean isInfinite() { |
| 63 | 0 | return IterUtil.isInfinite(_rel) && !_excluded.isInfinite(); |
| 64 | } | |
| 65 | ||
| 66 | 0 | public boolean hasFixedSize() { |
| 67 | 0 | return IterUtil.hasFixedSize(_rel) && _excluded.hasFixedSize(); |
| 68 | } | |
| 69 | ||
| 70 | 0 | public boolean isStatic() { |
| 71 | 0 | return IterUtil.isStatic(_rel) && _excluded.isStatic(); |
| 72 | } | |
| 73 | ||
| 74 | 0 | @Override public boolean isEmpty() { |
| 75 | 0 | if (_rel.isEmpty()) { return true; } |
| 76 | 0 | else if (_excluded.isEmpty()) { return false; } |
| 77 | 0 | else if (_rel == _excluded) { return true; } |
| 78 | 0 | else { return _excluded.containsAll(_rel); } |
| 79 | } | |
| 80 | ||
| 81 | } |
|
||||||||||
