short changeFree() { int mc = modCount(); short newFree = findNewFreeOrRemoved(); incrementModCount(); mc++; ShortArrays.replaceAllKeys(table, freeValue, newFree); this.freeValue = newFree; if (mc != modCount()) throw new ConcurrentModificationException(); return newFree; }
short changeFree() { int mc = modCount(); short newFree = findNewFreeOrRemoved(); incrementModCount(); mc++; ShortArrays.replaceAllKeys(table, freeValue, newFree); this.freeValue = newFree; if (mc != modCount()) throw new ConcurrentModificationException(); return newFree; }
short changeRemoved() { int mc = modCount(); short newRemoved = findNewFreeOrRemoved(); incrementModCount(); mc++; if (!noRemoved()) { ShortArrays.replaceAllKeys(table, removedValue, newRemoved); } this.removedValue = newRemoved; if (mc != modCount()) throw new ConcurrentModificationException(); return newRemoved; }
short changeRemoved() { int mc = modCount(); short newRemoved = findNewFreeOrRemoved(); incrementModCount(); mc++; if (!noRemoved()) { ShortArrays.replaceAllKeys(table, removedValue, newRemoved); } this.removedValue = newRemoved; if (mc != modCount()) throw new ConcurrentModificationException(); return newRemoved; }
void move(ParallelKVShortQHash hash) { super.copy(hash); freeValue = hash.freeValue(); if (hash.supportRemoved()) removedValue = hash.removedValue(); table = hash.table(); if (!hash.supportRemoved()) { removedValue = freeValue; removedValue = findNewFreeOrRemoved(); } }
void move(ParallelKVShortQHash hash) { super.copy(hash); freeValue = hash.freeValue(); if (hash.supportRemoved()) removedValue = hash.removedValue(); table = hash.table(); if (!hash.supportRemoved()) { removedValue = freeValue; removedValue = findNewFreeOrRemoved(); } }
void copy(ParallelKVShortQHash hash) { super.copy(hash); freeValue = hash.freeValue(); if (hash.supportRemoved()) removedValue = hash.removedValue(); table = hash.table().clone(); if (!hash.supportRemoved()) { removedValue = freeValue; removedValue = findNewFreeOrRemoved(); } }
void copy(ParallelKVShortQHash hash) { super.copy(hash); freeValue = hash.freeValue(); if (hash.supportRemoved()) removedValue = hash.removedValue(); table = hash.table().clone(); if (!hash.supportRemoved()) { removedValue = freeValue; removedValue = findNewFreeOrRemoved(); } }