/** * @see java.util.Map#containsKey(java.lang.Object) */ @Override public boolean containsKey(final Object key) { return findKey(0, key) != -1; }
/** * @see java.util.Map#containsKey(java.lang.Object) */ public boolean containsKey(final Object key) { return findKey(0, key) != -1; }
/** * @see java.util.Map#containsKey(java.lang.Object) */ public boolean containsKey(final Object key) { return findKey(0, key) != -1; }
/** * @see java.util.Map#get(java.lang.Object) */ public V get(final Object key) { // Search for key final int index = findKey(key); if (index != -1) { // Return value return values[index]; } // Failed to find key return null; }
/** * @see java.util.Map#get(java.lang.Object) */ public Object get(final Object key) { // Search for key final int index = findKey(key); if (index != -1) { // Return value return values[index]; } // Failed to find key return null; }
/** * @see java.util.Map#get(java.lang.Object) */ @Override public V get(final Object key) { // Search for key final int index = findKey(key); if (index != -1) { // Return value return values[index]; } // Failed to find key return null; }
/** * @see java.util.Map#remove(java.lang.Object) */ @Override public V remove(final Object key) { // Search for key final int index = findKey(key); if (index != -1) { // Store value final V oldValue = values[index]; keys[index] = null; values[index] = null; size--; return oldValue; } return null; }
/** * @see java.util.Map#remove(java.lang.Object) */ public Object remove(final Object key) { // Search for key final int index = findKey(key); if (index != -1) { // Store value final Object oldValue = values[index]; keys[index] = null; values[index] = null; size--; return oldValue; } return null; }
/** * @see java.util.Map#remove(java.lang.Object) */ public V remove(final Object key) { // Search for key final int index = findKey(key); if (index != -1) { // Store value final V oldValue = values[index]; keys[index] = null; values[index] = null; size--; return oldValue; } return null; }
/** * Finds a key by starting at lastSearchIndex and searching from there. If the key is found, * lastSearchIndex is advanced so the next key search can find the next key in the array, which * is the most likely to be retrieved. * * @param key * Key to find in map * @return Index of matching key or -1 if not found */ private int findKey(final Object key) { if (size > 0) { // Find key starting at search index final int index = findKey(lastSearchIndex, key); // Found match? if (index != -1) { // Start search at the next index next time lastSearchIndex = nextIndex(index); // Return index of key return index; } } return -1; }
/** * Finds a key by starting at lastSearchIndex and searching from there. If the key is found, * lastSearchIndex is advanced so the next key search can find the next key in the array, which * is the most likely to be retrieved. * * @param key * Key to find in map * @return Index of matching key or -1 if not found */ private int findKey(final Object key) { if (size > 0) { // Find key starting at search index final int index = findKey(lastSearchIndex, key); // Found match? if (index != -1) { // Start search at the next index next time lastSearchIndex = nextIndex(index); // Return index of key return index; } } return -1; }
/** * Finds a key by starting at lastSearchIndex and searching from there. If the key is found, * lastSearchIndex is advanced so the next key search can find the next key in the array, which * is the most likely to be retrieved. * * @param key * Key to find in map * @return Index of matching key or -1 if not found */ private int findKey(final Object key) { if (size > 0) { // Find key starting at search index final int index = findKey(lastSearchIndex, key); // Found match? if (index != -1) { // Start search at the next index next time lastSearchIndex = nextIndex(index); // Return index of key return index; } } return -1; }
final int index = findKey(key);
final int index = findKey(key);
final int index = findKey(key);