|
|||||||||||||||||||
| Source file | Conditionals | Statements | Methods | TOTAL | |||||||||||||||
| ComposedMap.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.lambda.Predicate; | |
| 40 | import edu.rice.cs.plt.object.Composite; | |
| 41 | import edu.rice.cs.plt.object.ObjectUtil; | |
| 42 | ||
| 43 | /** | |
| 44 | * The transitive composition of two maps, lazily constructed and dynamically-updated. An entry | |
| 45 | * {@code k=v} appears in the map if and only if there is an entry {@code k=x} in the first map | |
| 46 | * and {@code x=v} in the second. | |
| 47 | */ | |
| 48 | public class ComposedMap<K, X, V> extends AbstractKeyBasedMap<K, V> implements Composite, Serializable { | |
| 49 | private final Map<? extends K, ? extends X> _map1; | |
| 50 | private final Map<? super X, ? extends V> _map2; | |
| 51 | private final PredicateSet<K> _keys; | |
| 52 | ||
| 53 | 0 | public ComposedMap(Map<? extends K, ? extends X> map1, Map<? super X, ? extends V> map2) { |
| 54 | 0 | _map1 = map1; |
| 55 | 0 | _map2 = map2; |
| 56 | 0 | _keys = new FilteredSet<K>(_map1.keySet(), new Predicate<K>() { |
| 57 | 0 | public boolean contains(K key) { return _map2.containsKey(_map1.get(key)); } |
| 58 | }); | |
| 59 | } | |
| 60 | ||
| 61 | 0 | public int compositeHeight() { return ObjectUtil.compositeHeight(_map1, _map2) + 1; } |
| 62 | 0 | public int compositeSize() { return ObjectUtil.compositeSize(_map1, _map2) + 1; } |
| 63 | ||
| 64 | 0 | public V get(Object key) { |
| 65 | 0 | if (_map1.containsKey(key)) { |
| 66 | 0 | X middle = _map1.get(key); |
| 67 | 0 | return _map2.get(middle); |
| 68 | } | |
| 69 | 0 | else { return null; } |
| 70 | } | |
| 71 | ||
| 72 | 0 | public PredicateSet<K> keySet() { return _keys; } |
| 73 | ||
| 74 | } |
|
||||||||||