package cl.maps.duplex;

import java.util.Collection;
import java.util.Map;
import java.util.Set;


public interface IDuplexMap<V, A, B> {

	int size();
	
	boolean isEmpty();

	boolean containsKey(DuplexKey<A, B> key);

	boolean containsValue(Object value);
	
	V get(DuplexKey<A, B> key);
	
	V put(DuplexKey<A, B> key, V value);

	V remove(DuplexKey<A, B> key);

	//void putAll(Map<? extends K, ? extends V> m);

	void clear();

	Set<DuplexKey<A, B>> keySet();

	Collection<V> values();

	Set<Map.Entry<DuplexKey<A, B>, V>> entrySet();

	boolean equals(Object o);

	/**
	  * Returns the hash code value for this map.  The hash code of a map is
	  * defined to be the sum of the hash codes of each entry in the map's
	  * <tt>entrySet()</tt> view.  This ensures that <tt>m1.equals(m2)</tt>
	  * implies that <tt>m1.hashCode()==m2.hashCode()</tt> for any two maps
	  * <tt>m1</tt> and <tt>m2</tt>, as required by the general contract of
	  * {@link Object#hashCode}.
	  *
	  * @return the hash code value for this map
	  * @see Map.Entry#hashCode()
	  * @see Object#equals(Object)
	  * @see #equals(Object)
	  */
	int hashCode();
	
}