| Clover coverage report - PLT Utilities Test Coverage (plt-20120304-r5436) |
|
 |
|
|||||||||||||||||||
| Source file | Conditionals | Statements | Methods | TOTAL | |||||||||||||||
| UnionMap.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.Map; | |
| 38 | import java.io.Serializable; | |
| 39 | import edu.rice.cs.plt.object.Composite; | |
| 40 | import edu.rice.cs.plt.object.ObjectUtil; | |
| 41 | ||
| 42 | /** | |
| 43 | * A lazily-constructed and dynamically-updated union of two maps. The first is designated | |
| 44 | * the <em>parent</em>, and the second the <em>child</em>. Bindings for keys in the child shadow | |
| 45 | * those in the parent. | |
| 46 | */ | |
| 47 | public class UnionMap<K, V> extends AbstractKeyBasedMap<K, V> implements Composite, Serializable { | |
| 48 | private final Map<? extends K, ? extends V> _parent; | |
| 49 | private final Map<? extends K, ? extends V> _child; | |
| 50 | private final PredicateSet<K> _keys; | |
| 51 | ||
| 52 | 0 | public UnionMap(Map<? extends K, ? extends V> parent, Map<? extends K, ? extends V> child) { |
| 53 | 0 | _parent = parent; |
| 54 | 0 | _child = child; |
| 55 | 0 | _keys = new UnionSet<K>(parent.keySet(), child.keySet()); |
| 56 | } | |
| 57 | ||
| 58 | 0 | public int compositeHeight() { return ObjectUtil.compositeHeight(_parent, _child) + 1; } |
| 59 | 0 | public int compositeSize() { return ObjectUtil.compositeSize(_parent, _child) + 1; } |
| 60 | ||
| 61 | 0 | public V get(Object key) { |
| 62 | 0 | if (_child.containsKey(key)) { return _child.get(key); } |
| 63 | 0 | else { return _parent.get(key); } |
| 64 | } | |
| 65 | ||
| 66 | 0 | public PredicateSet<K> keySet() { return _keys; } |
| 67 | ||
| 68 | } |
|
||||||||||
