boolean removeStash (T key) { T[] keyTable = this.keyTable; for (int i = capacity, n = i + stashSize; i < n; i++) { if (key.equals(keyTable[i])) { removeStashIndex(i); size--; return true; } } return false; }
boolean removeStash (T key) { T[] keyTable = this.keyTable; for (int i = capacity, n = i + stashSize; i < n; i++) { if (key.equals(keyTable[i])) { removeStashIndex(i); size--; return true; } } return false; }
public void remove () { if (currentIndex < 0) throw new IllegalStateException("next must be called before remove."); if (currentIndex >= set.capacity) { set.removeStashIndex(currentIndex); nextIndex = currentIndex - 1; findNextIndex(); } else { set.keyTable[currentIndex] = null; } currentIndex = -1; set.size--; }
public void remove () { if (currentIndex < 0) throw new IllegalStateException("next must be called before remove."); if (currentIndex >= set.capacity) { set.removeStashIndex(currentIndex); nextIndex = currentIndex - 1; findNextIndex(); } else { set.keyTable[currentIndex] = null; } currentIndex = -1; set.size--; }
boolean removeStash (T key) { T[] keyTable = this.keyTable; for (int i = capacity, n = i + stashSize; i < n; i++) { if (key.equals(keyTable[i])) { removeStashIndex(i); size--; return true; } } return false; }
public void remove () { if (currentIndex < 0) throw new IllegalStateException("next must be called before remove."); if (currentIndex >= set.capacity) { set.removeStashIndex(currentIndex); nextIndex = currentIndex - 1; findNextIndex(); } else { set.keyTable[currentIndex] = null; } currentIndex = -1; set.size--; }