| Clover coverage report - PLT Utilities Test Coverage (plt-20120304-r5436) |
|
 |
|
|
|||||||||||||||||||
| Source file | Conditionals | Statements | Methods | TOTAL | |||||||||||||||
| AbstractPredicateSet.java | 50% | 75% | 66.7% | 69.2% |
|
||||||||||||||
| 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.AbstractSet; | |
| 38 | ||
| 39 | /** | |
| 40 | * An extension of AbstractSet that implements the PredicateSet interface. Subclasses must | |
| 41 | * define {@link #contains}, {@link #iterator}, {@link #isInfinite}, {@link #hasFixedSize}, | |
| 42 | * and {@link #isStatic}. Mutable sets must also implement {@link #add} and the iterator's | |
| 43 | * {@link java.util.Iterator#remove} method. Subclasses may also find it useful to override | |
| 44 | * {@link #size(int)}, {@link #isEmpty}, {@link #remove}, and {@link #clear} for improved | |
| 45 | * efficiency. | |
| 46 | */ | |
| 47 | public abstract class AbstractPredicateSet<T> extends AbstractSet<T> implements PredicateSet<T> { | |
| 48 | ||
| 49 | /** | |
| 50 | * Test whether the set contains an object. Overridden here to force subclasses to provide an | |
| 51 | * implementation. The default implementation ({@link AbstractSet#contains}) is a linear search, | |
| 52 | * which is almost always unreasonable for a set. | |
| 53 | */ | |
| 54 | @Override public abstract boolean contains(Object o); | |
| 55 | ||
| 56 | /** Returns {@code size(1) == 0}. */ | |
| 57 | 0 | @Override public boolean isEmpty() { return size(1) == 0; } |
| 58 | ||
| 59 | /** Returns {@code size(Integer.MAX_VALUE)}. */ | |
| 60 | 68 | public int size() { return size(Integer.MAX_VALUE); } |
| 61 | ||
| 62 | /** Computes the size by traversing the iterator (requires linear time). */ | |
| 63 | 68 | public int size(int bound) { |
| 64 | 68 | int result = 0; |
| 65 | // javac 1.5.0_16 crashes with this annotation | |
| 66 | //for (@SuppressWarnings("unused") T elt : this) { result++; if (result == bound) break; } | |
| 67 | 0 | for (T elt : this) { result++; if (result == bound) break; } |
| 68 | 68 | return result; |
| 69 | } | |
| 70 | ||
| 71 | } |
|
||||||||||
