1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204
| public Interface Map<K,V>{ int size();
boolean isEmpty();
boolean constainsKey(Object key);
boolean containsValue(Object value);
V get(Object key);
V put(Object key,Object value);
V remove(Object key);
void putAll(Map<? extends K, ? extends V> m);
void clear();
Set<K> keySet();
Collection<V> values();
Set<Map.Entry<K,V>> entrySet();
Interface Entry<K,V> { K getKey();
V getValue();
V setValue(V value);
boolean equals(Object o);
int hashCode();
public static <K extends Comparable<? super K> ,V> Comparator<Map.Entry<K,V> comparingByKey(){ return (Comparator<Map.Entry<K,V>> & Serializable) (c1,c2)->c1.getKey().compareTo(c2.getKey()); }
public static <K,V extends Comparable <? super V>> Comparator<Map.Entry<K,V>> comparingByValue(){ return (Comparator<Map.Entry<K,V>> & Serializable) (c1,c2) -> c1.getValue().compareTo(c2.getValue()); }
public static <K,V> Comparator<Map.Entry<K,V>> comparingByKey(Comparator<? super K> cmp){ Objects.requireNonNull(cmp); return (Comparator<Map.Entry<K,V>> & Serializable)(c1,c2) -> cmp.compare(c1.getKey(),c2.getKey()); }
public static <K,V> Comparator<Map.Entry<K,V>> comparingByValue(Comparator<? super V> cmp){ Objects.requireNonNull(cmp); return (Comparator<Map.Entry<K,V>> & Serializable)(c1,c2)->cmp.compare(c1.getValue(), c2.getValue()); } }
boolean equals (Object o);
int hashCode();
default V getOrDefault(Object key , V defaultValue){ V v; return (((v = get(key)) != null) || constainsKey(key)) ? v : defaultValue; }
default void forEach(BiConsumer<? super K, ? super V> action){ Objects.requireNonNull(action); for(Map.Entry<K,V> entry :entrySet()){ K k; V v; try{ k = entry.getKey(); v = entry.getValue(); } catch (IllegalStateException ise){ throw new ConcurrentModificationException(ise); }
action.accept(k,v); } }
default void replaceAll(BiFunction<? super K, ? super V, ? extends V> function){ Objects.requireNonNull(function); for(Map.Entry<K,V> entry : entrySet()){ K k; V v; try { k = entry.getKey(); v = entry.getValue(); } catch (IllegalStateException ise){ throw new ConcurrentModificationException(ise); }
v = function.apply(k,v);
try{ entry.setValue(v); } catch(IllegalStateException ise){ throw new ConcurrentModificationException(ise); } } }
default V putIfAbsent(K key, V value){ V v = get(key); if( v== null){ v = put(key,value); }
return v; }
default boolean remove(Object key,Object value){ Object vurValue = get(key); if(!Objects.equals(curValue ,value) || (curValue == null && !constainsKey(key)){ return false; } remove(key); return true; }
default boolean replace(K key,V oldValue, V newValue){ Object curValue = get(key); if( !Objects.equals(curValue,oldValue) || (curValue == null && !containsKey(key))){ return false; }
put(key,newValue); return true; }
default V replace(K key, V value){ V curValue; if(((curValue = get(key)) != null) || containsKey(key)){ curValue = put(key,value); } return curValue }
default V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction){ Objects.requireNonNull(mappingFunction); V v; if((v = get(key)) == null ){ V newValue if((newValue = mappingFunction.apply(key)) != null) { put(key, newValue); return newValue; } }
return v; }
default V computeIfPresent(K key, BiFunction<? super K , ? super V, ? extends V> remappingFunction){ V oldValue; if((oldValue = get(key)) != null){ V newValue = remappingFunction.apply(key,oldValue); if(newValue != null){ put(key,newValue); return newValue; } else { remove(key); return null; } } }
default V compute(K key,BiFunction<? super K, ? super V , ? extends V> remappingFunction){ Objects.requireNonNull(remappingFunction);
V newValue = remappingFunction.apply(key,oldValue); if(newValue == null){ if(oldValue != null || containsKey(key)){ remove(key); return null; } else { return null; } } else { put(key,newValue); return newValue; } }
default V merge(K key, V value, BiFunction<? super V, ? super V, ? extends V> remappingFunction){ Objects.requireNonNull(remappingFunction); Objects.requireNonNull(value);
V oldValue = get(key); V newValue = (oldValue == null ?) value : remappingFunction.apply(oldValue,value);
if(newValue == null){ remove(key); } else { put(key,newValue); }
return newValue; } }
|