public Object put(Object key, Object value) { if (!(key instanceof Number)) { throw new IllegalArgumentException( "key cannot be null" ); } return put(((Number)key).intValue(), value ); }
public Object put(Object key, Object value) { if (!(key instanceof Number)) { throw new IllegalArgumentException( "key cannot be null" ); } return put(((Number)key).intValue(), value ); }
public Object put(Object key, Object value) { if (!(key instanceof Number)) { throw new IllegalArgumentException( "key cannot be null" ); } return put(((Number)key).intValue(), value ); }
public void putAll(Map otherMap) { for (Iterator it = otherMap.keySet().iterator(); it.hasNext();) { Object k = it.next(); put(k, otherMap.get(k)); } }
public void putAll(Map otherMap) { for (Iterator it = otherMap.keySet().iterator(); it.hasNext();) { Object k = it.next(); put(k, otherMap.get(k)); } }
public void putAll(Map otherMap) { for (Iterator it = otherMap.keySet().iterator(); it.hasNext();) { Object k = it.next(); put(k, otherMap.get(k)); } }
public synchronized SizePool getSizePool(int arraySize) { SizePool result = (SizePool)pools.get(arraySize); if (result == null) { pools.put(arraySize, result = new SizePool(arraySize)); } return result; }
public final Object put(int key, Object value) { int index = ( key & 0x7FFFFFFF ) % table.length; if (value == null) { throw new IllegalArgumentException(); } for (Entry e = table[index] ; e != null ; e = e.next) { if ((e.hash == key) && (e.key == key)) { Object old = e.value; e.value = value; return old; } } if (count >= threshold) { // Rehash the table if the threshold is exceeded. rehash(); return put(key, value); } Entry e = new Entry(); e.hash = key; e.key = key; e.value = value; e.next = table[index]; table[index] = e; ++count; return null; }
public final Object put(int key, Object value) { int index = ( key & 0x7FFFFFFF ) % table.length; if (value == null) { throw new IllegalArgumentException(); } for (Entry e = table[index] ; e != null ; e = e.next) { if ((e.hash == key) && (e.key == key)) { Object old = e.value; e.value = value; return old; } } if (count >= threshold) { // Rehash the table if the threshold is exceeded. rehash(); return put(key, value); } Entry e = new Entry(); e.hash = key; e.key = key; e.value = value; e.next = table[index]; table[index] = e; ++count; return null; }
public final Object put(int key, Object value) { int index = ( key & 0x7FFFFFFF ) % table.length; if (value == null) { throw new IllegalArgumentException(); } for (Entry e = table[index] ; e != null ; e = e.next) { if ((e.hash == key) && (e.key == key)) { Object old = e.value; e.value = value; return old; } } if (count >= threshold) { // Rehash the table if the threshold is exceeded. rehash(); return put(key, value); } Entry e = new Entry(); e.hash = key; e.key = key; e.value = value; e.next = table[index]; table[index] = e; ++count; return null; }