@SuppressWarnings("unchecked") public Set<java.util.Map.Entry<K, V>> entrySet() { Map m = innerMap!=null?innerMap:makeMap(); return m.entrySet(); }
public Set<K> keySet() { Map m = innerMap!=null?innerMap:makeMap(); return m.keySet(); }
@SuppressWarnings("unchecked") public V put(K key, V value) { if (innerMap==null) { for (int i=0; i<size; i++) { if (listKeys[i].equals(key)) { V old = (V) listValues[i]; listValues[i] = value; return old; } } if (size<maxListFill) { listKeys[size] = key; listValues[size] = value; size++; return null; } else { innerMap = makeMap(); // Switched over to Map so need to clear array references clearArrays(); } } V val = (V) innerMap.put(key, value); size = innerMap.size(); return val; }
public Set<K> keySet() { Map m; if (size>=maxListFill) { m = innerMap; } else { m = makeMap(); } return m.keySet(); }
public Set<java.util.Map.Entry<K, V>> entrySet() { Map m; if (size>maxListFill) { m = innerMap; } else { m = makeMap(); } return m.entrySet(); }
public void putAll(Map<? extends K, ? extends V> m) { if (size+m.size()<maxListFill) { for (Entry<? extends K,? extends V> entry : m.entrySet()) { listKeys[listFill] = entry.getKey(); listValues[listFill] = entry.getValue(); listFill++; } size += m.size(); return; } if (size<maxListFill) innerMap = makeMap(); innerMap.putAll(m); size += m.size(); }
public V put(K key, V value) { if (size<maxListFill) { for (int i=0; i<listFill; i++) { if (listKeys[i].equals(key)) { V old = (V) listValues[i]; listValues[i] = value; return old; } } if (size<maxListFill-1) { size++; listKeys[listFill] = key; listValues[listFill] = value; listFill++; return null; } else { innerMap = makeMap(); size++; } } return innerMap.put(key,value); }