|
|||||||||||||||||||
| Source file | Conditionals | Statements | Methods | TOTAL | |||||||||||||||
| FilteredSet.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 java.util.Set; | |
| 38 | import java.util.Collection; | |
| 39 | import java.util.Iterator; | |
| 40 | import java.io.Serializable; | |
| 41 | import edu.rice.cs.plt.lambda.Predicate; | |
| 42 | import edu.rice.cs.plt.tuple.Option; | |
| 43 | import edu.rice.cs.plt.iter.IterUtil; | |
| 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 set that contains only those elements contained by both the given set and the given | |
| 50 | * predicate. Note that size operations will take linear time. | |
| 51 | */ | |
| 52 | public class FilteredSet<T> extends AbstractPredicateSet<T> implements Composite, Serializable { | |
| 53 | ||
| 54 | protected final Set<? extends T> _set; | |
| 55 | protected final Predicate<? super T> _pred; | |
| 56 | ||
| 57 | 0 | public FilteredSet(Set<? extends T> set, Predicate<? super T> predicate) { |
| 58 | 0 | _set = set; |
| 59 | 0 | _pred = predicate; |
| 60 | } | |
| 61 | ||
| 62 | 0 | public int compositeHeight() { return ObjectUtil.compositeHeight(_set, _pred) + 1; } |
| 63 | 0 | public int compositeSize() { return ObjectUtil.compositeSize(_set, _pred) + 1; } |
| 64 | ||
| 65 | 0 | public boolean contains(Object o) { |
| 66 | 0 | Option<T> cast = CollectUtil.castIfContains(_set, o); |
| 67 | 0 | if (cast.isSome()) { return _pred.contains(cast.unwrap()); } |
| 68 | 0 | else { return false; } |
| 69 | } | |
| 70 | ||
| 71 | 0 | @Override public boolean containsAll(Collection<?> objs) { |
| 72 | 0 | if (_set.containsAll(objs)) { |
| 73 | // all elements must be subtypes of T (strictly speaking, the type parameter of this | |
| 74 | // collection may not be a subtype of T, despite all the elements having that type; but | |
| 75 | // that doesn't matter as far as the Iterable interface is concerned | |
| 76 | 0 | @SuppressWarnings("unchecked") Iterable<? extends T> iter = (Iterable<? extends T>) objs; |
| 77 | 0 | return IterUtil.and(iter, _pred); |
| 78 | } | |
| 79 | 0 | else { return false; } |
| 80 | } | |
| 81 | ||
| 82 | /** Traversing the iterator is linear in the size of the original set. */ | |
| 83 | 0 | public Iterator<T> iterator() { return new FilteredIterator<T>(_set.iterator(), _pred); } |
| 84 | ||
| 85 | 0 | @Override public boolean isEmpty() { return _set.isEmpty() || super.isEmpty(); } |
| 86 | 0 | public boolean isInfinite() { return false; } |
| 87 | 0 | public boolean hasFixedSize() { return false; } |
| 88 | 0 | public boolean isStatic() { return false; } |
| 89 | ||
| 90 | } |
|
||||||||||