char changeFree() { int mc = modCount(); char newFree = findNewFreeOrRemoved(); incrementModCount(); mc++; CharArrays.replaceAllKeys(table, freeValue, newFree); this.freeValue = newFree; if (mc != modCount()) throw new ConcurrentModificationException(); return newFree; }
public boolean contains(char key) { return index(key) >= 0; }
private char findNewFreeOrRemoved() { int mc = modCount(); int size = size(); if (size >= CHAR_CARDINALITY - 1) { if (newFree != free && index(newFree) < 0) { break searchForFree; if (mc != modCount()) throw new ConcurrentModificationException(); throw new AssertionError("Impossible state"); index(newFree) >= 0);
public boolean contains(Object key) { return contains(((Character) key).charValue()); }
private char findNewFreeOrRemoved() { int mc = modCount(); int size = size(); if (size >= CHAR_CARDINALITY - 1) { if (newFree != free && index(newFree) < 0) { break searchForFree; if (mc != modCount()) throw new ConcurrentModificationException(); throw new AssertionError("Impossible state"); index(newFree) >= 0);
public boolean contains(Object key) { return contains(((Character) key).charValue()); }
char changeFree() { int mc = modCount(); char newFree = findNewFreeOrRemoved(); incrementModCount(); mc++; CharArrays.replaceAllKeys(table, freeValue, newFree); this.freeValue = newFree; if (mc != modCount()) throw new ConcurrentModificationException(); return newFree; }
public boolean contains(char key) { return index(key) >= 0; }