void move(SeparateKVShortQHash hash) { super.copy(hash); freeValue = hash.freeValue(); if (hash.supportRemoved()) removedValue = hash.removedValue(); set = hash.keys(); if (!hash.supportRemoved()) { removedValue = freeValue; removedValue = findNewFreeOrRemoved(); } }
@Override @Nonnull public UpdatableQHashShortSetGO newUpdatableSet(Iterable<Short> elements, int expectedSize) { if (elements instanceof ShortCollection) { if (elements instanceof SeparateKVShortQHash) { SeparateKVShortQHash hash = (SeparateKVShortQHash) elements; if (hash.hashConfig().equals(hashConf)) { UpdatableQHashShortSet set = new UpdatableQHashShortSet(); set.copy(hash); return set; } } int size = elements instanceof Set ? ((Set) elements).size() : expectedSize; UpdatableQHashShortSetGO set = newUpdatableSet(size); set.addAll((Collection<Short>) elements); return set; } else { int size = elements instanceof Set ? ((Set) elements).size() : expectedSize; UpdatableQHashShortSetGO set = newUpdatableSet(size); for (short e : elements) { set.add(e); } return set; } } }
@Override @Nonnull public UpdatableQHashShortSetGO newUpdatableSet(Iterable<Short> elements, int expectedSize) { if (elements instanceof ShortCollection) { if (elements instanceof SeparateKVShortQHash) { SeparateKVShortQHash hash = (SeparateKVShortQHash) elements; if (hash.hashConfig().equals(hashConf)) { UpdatableQHashShortSet set = new UpdatableQHashShortSet(); set.copy(hash); return set; } } int size = elements instanceof Set ? ((Set) elements).size() : expectedSize; UpdatableQHashShortSetGO set = newUpdatableSet(size); set.addAll((Collection<Short>) elements); return set; } else { int size = elements instanceof Set ? ((Set) elements).size() : expectedSize; UpdatableQHashShortSetGO set = newUpdatableSet(size); for (short e : elements) { set.add(e); } return set; } } }
void move(SeparateKVShortQHash hash) { super.copy(hash); freeValue = hash.freeValue(); if (hash.supportRemoved()) removedValue = hash.removedValue(); set = hash.keys(); if (!hash.supportRemoved()) { removedValue = freeValue; removedValue = findNewFreeOrRemoved(); } }
void copy(SeparateKVShortQHash hash) { super.copy(hash); freeValue = hash.freeValue(); if (hash.supportRemoved()) removedValue = hash.removedValue(); set = hash.keys().clone(); if (!hash.supportRemoved()) { removedValue = freeValue; removedValue = findNewFreeOrRemoved(); } }
void copy(SeparateKVShortQHash hash) { super.copy(hash); freeValue = hash.freeValue(); if (hash.supportRemoved()) removedValue = hash.removedValue(); set = hash.keys().clone(); if (!hash.supportRemoved()) { removedValue = freeValue; removedValue = findNewFreeOrRemoved(); } }