--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/main/java/cl/maps/penta/IPentaMap.java	Wed Dec 14 15:49:40 2016 +0100
@@ -0,0 +1,52 @@
+package cl.maps.penta;
+
+import java.util.Collection;
+import java.util.Map;
+import java.util.Set;
+
+
+public interface IPentaMap<V, A, B, C, D, E> {
+
+	int size();
+	
+	boolean isEmpty();
+
+	boolean containsKey(PentaKey<A, B, C, D, E> key);
+
+	boolean containsValue(Object value);
+	
+	V get(PentaKey<A, B, C, D, E> key);
+	
+	V put(PentaKey<A, B, C, D, E> key, V value);
+
+	V remove(PentaKey<A, B, C, D, E> key);
+
+	//void putAll(Map<? extends K, ? extends V> m);
+
+	void clear();
+
+	Set<PentaKey<A, B, C, D, E>> keySet();
+
+	Collection<V> values();
+
+	Set<Map.Entry<PentaKey<A, B, C, D, E>, 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();
+
+
+}
\ No newline at end of file