org.apache.cassandra.utils.BiMultiValMap Maven / Gradle / Ivy
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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 org.apache.cassandra.utils;
import com.google.common.collect.HashMultimap;
import com.google.common.collect.Multimap;
import com.google.common.collect.Multimaps;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
/**
*
* A variant of BiMap which does not enforce uniqueness of values. This means the inverse
* is a Multimap. (But the "forward" view is not a multimap; keys may only each have one value.)
*
* @param
* @param
*/
public class BiMultiValMap implements Map
{
protected final Map forwardMap;
protected final Multimap reverseMap;
public BiMultiValMap()
{
this.forwardMap = new HashMap();
this.reverseMap = HashMultimap.create();
}
public Multimap inverse()
{
return Multimaps.unmodifiableMultimap(reverseMap);
}
public void clear()
{
forwardMap.clear();
reverseMap.clear();
}
public boolean containsKey(Object key)
{
return forwardMap.containsKey(key);
}
public boolean containsValue(Object value)
{
return reverseMap.containsKey(value);
}
public Set> entrySet()
{
return forwardMap.entrySet();
}
public V get(Object key)
{
return forwardMap.get(key);
}
public boolean isEmpty()
{
return forwardMap.isEmpty();
}
public Set keySet()
{
return forwardMap.keySet();
}
public V put(K key, V value)
{
V oldVal = forwardMap.put(key, value);
if (oldVal != null)
reverseMap.remove(oldVal, key);
reverseMap.put(value, key);
return oldVal;
}
public void putAll(Map extends K, ? extends V> m)
{
for (Map.Entry extends K, ? extends V> entry : m.entrySet())
put(entry.getKey(), entry.getValue());
}
public V remove(Object key)
{
V oldVal = forwardMap.remove(key);
reverseMap.remove(oldVal, key);
return oldVal;
}
public int size()
{
return forwardMap.size();
}
public Collection values()
{
return reverseMap.keys();
}
}