|
30 | 30 | */ |
31 | 31 | public abstract class BaseMapEntity<K, V> extends BaseEntity implements Map<K, V> { |
32 | 32 |
|
33 | | - private final TreeMap<K, V> innerMap = new TreeMap<K, V>(); |
| 33 | + private final TreeMap<K, V> innerMap = new TreeMap<K, V>(); |
| 34 | + |
| 35 | + @Override |
| 36 | + public int size() { |
| 37 | + return innerMap.size(); |
| 38 | + } |
| 39 | + |
| 40 | + @Override |
| 41 | + public boolean isEmpty() { |
| 42 | + return innerMap.isEmpty(); |
| 43 | + } |
| 44 | + |
| 45 | + @Override |
| 46 | + public boolean containsKey(Object key) { |
| 47 | + return innerMap.containsKey(key); |
| 48 | + } |
| 49 | + |
| 50 | + @Override |
| 51 | + public boolean containsValue(Object value) { |
| 52 | + return innerMap.containsValue(value); |
| 53 | + } |
| 54 | + |
| 55 | + @Override |
| 56 | + public V get(Object key) { |
| 57 | + return innerMap.get(key); |
| 58 | + } |
| 59 | + |
| 60 | + @Override |
| 61 | + public V put(K key, V value) { |
| 62 | + return innerMap.put(key, value); |
| 63 | + } |
| 64 | + |
| 65 | + @Override |
| 66 | + public V remove(Object key) { |
| 67 | + return innerMap.remove(key); |
| 68 | + } |
| 69 | + |
| 70 | + @Override |
| 71 | + public void putAll(Map<? extends K, ? extends V> t) { |
| 72 | + innerMap.putAll(t); |
| 73 | + } |
| 74 | + |
| 75 | + @Override |
| 76 | + public void clear() { |
| 77 | + innerMap.clear(); |
| 78 | + } |
| 79 | + |
| 80 | + @Override |
| 81 | + public Set<K> keySet() { |
| 82 | + return innerMap.keySet(); |
| 83 | + } |
| 84 | + |
| 85 | + @Override |
| 86 | + public Collection<V> values() { |
| 87 | + return innerMap.values(); |
| 88 | + } |
| 89 | + |
| 90 | + @Override |
| 91 | + public Set<java.util.Map.Entry<K, V>> entrySet() { |
| 92 | + return innerMap.entrySet(); |
| 93 | + } |
34 | 94 |
|
35 | | - public int size() { |
36 | | - return innerMap.size(); |
37 | | - } |
38 | | - |
39 | | - public boolean isEmpty() { |
40 | | - return innerMap.isEmpty(); |
41 | | - } |
42 | | - |
43 | | - public boolean containsKey(Object key) { |
44 | | - return innerMap.containsKey(key); |
45 | | - } |
46 | | - |
47 | | - public boolean containsValue(Object value) { |
48 | | - return innerMap.containsValue(value); |
49 | | - } |
50 | | - |
51 | | - public V get(Object key) { |
52 | | - return innerMap.get(key); |
53 | | - } |
54 | | - |
55 | | - public V put(K key, V value) { |
56 | | - return innerMap.put(key, value); |
57 | | - } |
58 | | - |
59 | | - public V remove(Object key) { |
60 | | - return innerMap.remove(key); |
61 | | - } |
62 | | - |
63 | | - public void putAll(Map<? extends K, ? extends V> t) { |
64 | | - innerMap.putAll(t); |
65 | | - } |
66 | | - |
67 | | - public void clear() { |
68 | | - innerMap.clear(); |
69 | | - } |
70 | | - |
71 | | - public Set<K> keySet() { |
72 | | - return innerMap.keySet(); |
73 | | - } |
74 | | - |
75 | | - public Collection<V> values() { |
76 | | - return innerMap.values(); |
77 | | - } |
78 | | - |
79 | | - public Set<java.util.Map.Entry<K, V>> entrySet() { |
80 | | - return innerMap.entrySet(); |
81 | | - } |
82 | | - |
83 | 95 | } |
0 commit comments