|
59
|
1 package cl.maps.penta;
|
|
|
2
|
|
|
3 import java.util.Collection;
|
|
|
4 import java.util.Map;
|
|
|
5 import java.util.Set;
|
|
|
6
|
|
|
7
|
|
|
8 public interface IPentaMap<V, A, B, C, D, E> {
|
|
|
9
|
|
|
10 int size();
|
|
|
11
|
|
|
12 boolean isEmpty();
|
|
|
13
|
|
|
14 boolean containsKey(PentaKey<A, B, C, D, E> key);
|
|
|
15
|
|
|
16 boolean containsValue(Object value);
|
|
|
17
|
|
|
18 V get(PentaKey<A, B, C, D, E> key);
|
|
|
19
|
|
|
20 V put(PentaKey<A, B, C, D, E> key, V value);
|
|
|
21
|
|
|
22 V remove(PentaKey<A, B, C, D, E> key);
|
|
|
23
|
|
|
24 //void putAll(Map<? extends K, ? extends V> m);
|
|
|
25
|
|
|
26 void clear();
|
|
|
27
|
|
|
28 Set<PentaKey<A, B, C, D, E>> keySet();
|
|
|
29
|
|
|
30 Collection<V> values();
|
|
|
31
|
|
|
32 Set<Map.Entry<PentaKey<A, B, C, D, E>, V>> entrySet();
|
|
|
33
|
|
|
34 boolean equals(Object o);
|
|
|
35
|
|
|
36 /**
|
|
|
37 * Returns the hash code value for this map. The hash code of a map is
|
|
|
38 * defined to be the sum of the hash codes of each entry in the map's
|
|
|
39 * <tt>entrySet()</tt> view. This ensures that <tt>m1.equals(m2)</tt>
|
|
|
40 * implies that <tt>m1.hashCode()==m2.hashCode()</tt> for any two maps
|
|
|
41 * <tt>m1</tt> and <tt>m2</tt>, as required by the general contract of
|
|
|
42 * {@link Object#hashCode}.
|
|
|
43 *
|
|
|
44 * @return the hash code value for this map
|
|
|
45 * @see Map.Entry#hashCode()
|
|
|
46 * @see Object#equals(Object)
|
|
|
47 * @see #equals(Object)
|
|
|
48 */
|
|
|
49 int hashCode();
|
|
|
50
|
|
|
51
|
|
|
52 } |
