Java tutorial
/* * Copyright (C) 2011-2016 Rinde van Lon, iMinds-DistriNet, KU Leuven * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package com.github.rinde.rinsim.util; import static com.google.common.collect.Maps.newLinkedHashMap; import static com.google.common.collect.Sets.newLinkedHashSet; import java.util.Collection; import java.util.Map; import java.util.Map.Entry; import java.util.Set; import javax.annotation.Nullable; import com.google.common.collect.LinkedHashMultimap; import com.google.common.collect.Multimap; import com.google.common.collect.Multiset; import com.google.common.collect.SetMultimap; /** * A category can have multiple values, a value can be in only one category. * * Trades memory for cpu speed. Lookups are O(1) on both keys and values. * * This datastructure is useful in case you want to regularly look up: * <ul> * <li>the category of a value</li> * <li>all values in a category</li> * </ul> * * @author Rinde van Lon * */ // TODO better name: MultiBiMap ? public class CategoryMap<C, V> implements SetMultimap<C, V> { // TODO use Guava test tools // TODO do a benchmark to compare performance with ordinary multimap // TODO use ForwardingMultimap<K, V> final SetMultimap<C, V> categoryValueMultiMap; final Map<V, C> valueCategoryMap; public CategoryMap() { valueCategoryMap = createMap(); categoryValueMultiMap = createMultimap(); } protected Map<V, C> createMap() { return newLinkedHashMap(); } protected SetMultimap<C, V> createMultimap() { return LinkedHashMultimap.create(); } @Override public int size() { return categoryValueMultiMap.size(); } @Override public boolean isEmpty() { return categoryValueMultiMap.isEmpty(); } @Override public boolean containsKey(Object key) { return categoryValueMultiMap.containsKey(key); } @Override public boolean containsValue(Object value) { return valueCategoryMap.containsKey(value); } @Override public boolean containsEntry(Object key, Object value) { return valueCategoryMap.containsKey(value) && valueCategoryMap.get(value).equals(key); } @Override public boolean remove(Object key, Object value) { return categoryValueMultiMap.remove(key, value) && valueCategoryMap.remove(value) != null; } public boolean removeValue(V value) { final C category = valueCategoryMap.remove(value); return categoryValueMultiMap.remove(category, value); } public boolean removeKey(C key) { final Collection<V> col = categoryValueMultiMap.get(key); for (final V v : col) { valueCategoryMap.remove(v); } return !col.isEmpty(); } @Override public void clear() { categoryValueMultiMap.clear(); valueCategoryMap.clear(); } // TODO @Deprecated @Override public boolean putAll(C key, Iterable<? extends V> values) { throw new UnsupportedOperationException(); } // TODO @Deprecated @Override public boolean putAll(Multimap<? extends C, ? extends V> multimap) { throw new UnsupportedOperationException(); } // TODO @Deprecated @Override public Set<V> replaceValues(C key, Iterable<? extends V> values) { throw new UnsupportedOperationException(); } // TODO should return an unmodifiable view? currently edits in the returned // structure result in an invalid state @Override public Set<V> get(C key) { return categoryValueMultiMap.get(key); } public Collection<V> getMultiple(C... keys) { final Collection<V> values = newLinkedHashSet(); for (final C k : keys) { for (final V v : categoryValueMultiMap.get(k)) { values.add(v); } } return values; } public C getKeys(V value) { return valueCategoryMap.get(value); } @Override public boolean put(C key, V value) { // if same value is already contained in this map (possibly in another // category), remove it first, then add it in using the specified // category if (valueCategoryMap.containsKey(value)) { categoryValueMultiMap.remove(valueCategoryMap.get(value), value); } valueCategoryMap.put(value, key); return categoryValueMultiMap.put(key, value); } @Override public Set<V> removeAll(@Nullable Object key) { final Set<V> values = categoryValueMultiMap.removeAll(key); for (final V v : values) { valueCategoryMap.remove(v); } return values; } @Override public Set<C> keySet() { return categoryValueMultiMap.keySet(); } @Override public Multiset<C> keys() { return categoryValueMultiMap.keys(); } @Override public Collection<V> values() { return valueCategoryMap.keySet(); } @Override public Set<Entry<C, V>> entries() { return categoryValueMultiMap.entries(); } @Override public Map<C, Collection<V>> asMap() { return categoryValueMultiMap.asMap(); } public static <C, V> CategoryMap<C, V> create() { return new CategoryMap<C, V>(); } @Override public String toString() { return categoryValueMultiMap.toString(); } }