@Override public BitSet clone() { return new BitSet(bits.clone()); }
@Override public BitSet clone() { return new BitSet(bits.clone()); }
@Override public BitSet clone() { return new BitSet(bits.clone()); }
private void rehash(int newHashSize) { K[] oldKeys = keys; V[] oldValues = values; numEntries = 0; numSlotsUsed = 0; if (countingAccesses) { recentlyAccessed = new BitSet(newHashSize); } keys = (K[]) new Object[newHashSize]; values = (V[]) new Object[newHashSize]; int length = oldKeys.length; for (int i = 0; i < length; i++) { K key = oldKeys[i]; if (key != null && key != REMOVED) { put(key, oldValues[i]); } } }
private void rehash(int newHashSize) { K[] oldKeys = keys; V[] oldValues = values; numEntries = 0; numSlotsUsed = 0; if (countingAccesses) { recentlyAccessed = new BitSet(newHashSize); } keys = (K[]) new Object[newHashSize]; values = (V[]) new Object[newHashSize]; int length = oldKeys.length; for (int i = 0; i < length; i++) { K key = oldKeys[i]; if (key != null && key != REMOVED) { put(key, oldValues[i]); } } }
private void rehash(int newHashSize) { long[] oldKeys = keys; V[] oldValues = values; numEntries = 0; numSlotsUsed = 0; if (countingAccesses) { recentlyAccessed = new BitSet(newHashSize); } keys = new long[newHashSize]; Arrays.fill(keys, NULL); values = (V[]) new Object[newHashSize]; int length = oldKeys.length; for (int i = 0; i < length; i++) { long key = oldKeys[i]; if (key != NULL && key != REMOVED) { put(key, oldValues[i]); } } }
private void rehash(int newHashSize) { K[] oldKeys = keys; V[] oldValues = values; numEntries = 0; numSlotsUsed = 0; if (countingAccesses) { recentlyAccessed = new BitSet(newHashSize); } keys = (K[]) new Object[newHashSize]; values = (V[]) new Object[newHashSize]; int length = oldKeys.length; for (int i = 0; i < length; i++) { K key = oldKeys[i]; if (key != null && key != REMOVED) { put(key, oldValues[i]); } } }
private void rehash(int newHashSize) { long[] oldKeys = keys; V[] oldValues = values; numEntries = 0; numSlotsUsed = 0; if (countingAccesses) { recentlyAccessed = new BitSet(newHashSize); } keys = new long[newHashSize]; Arrays.fill(keys, NULL); values = (V[]) new Object[newHashSize]; int length = oldKeys.length; for (int i = 0; i < length; i++) { long key = oldKeys[i]; if (key != NULL && key != REMOVED) { put(key, oldValues[i]); } } }
private void rehash(int newHashSize) { long[] oldKeys = keys; V[] oldValues = values; numEntries = 0; numSlotsUsed = 0; if (countingAccesses) { recentlyAccessed = new BitSet(newHashSize); } keys = new long[newHashSize]; Arrays.fill(keys, NULL); values = (V[]) new Object[newHashSize]; int length = oldKeys.length; for (int i = 0; i < length; i++) { long key = oldKeys[i]; if (key != NULL && key != REMOVED) { put(key, oldValues[i]); } } }
@Override public FastByIDMap<V> clone() { FastByIDMap<V> clone; try { clone = (FastByIDMap<V>) super.clone(); } catch (CloneNotSupportedException cnse) { throw new AssertionError(); } clone.keys = keys.clone(); clone.values = values.clone(); clone.recentlyAccessed = countingAccesses ? new BitSet(keys.length) : null; return clone; }
@Override public FastByIDMap<V> clone() { FastByIDMap<V> clone; try { clone = (FastByIDMap<V>) super.clone(); } catch (CloneNotSupportedException cnse) { throw new AssertionError(); } clone.keys = keys.clone(); clone.values = values.clone(); clone.recentlyAccessed = countingAccesses ? new BitSet(keys.length) : null; return clone; }
@Override public FastMap<K,V> clone() { FastMap<K,V> clone; try { clone = (FastMap<K,V>) super.clone(); } catch (CloneNotSupportedException cnse) { throw new AssertionError(); } clone.keys = keys.clone(); clone.values = values.clone(); clone.recentlyAccessed = countingAccesses ? new BitSet(keys.length) : null; return clone; }
@Override public FastMap<K,V> clone() { FastMap<K,V> clone; try { clone = (FastMap<K,V>) super.clone(); } catch (CloneNotSupportedException cnse) { throw new AssertionError(); } clone.keys = keys.clone(); clone.values = values.clone(); clone.recentlyAccessed = countingAccesses ? new BitSet(keys.length) : null; return clone; }
@Override public FastByIDMap<V> clone() { FastByIDMap<V> clone; try { clone = (FastByIDMap<V>) super.clone(); } catch (CloneNotSupportedException cnse) { throw new AssertionError(); } clone.keys = keys.clone(); clone.values = values.clone(); clone.recentlyAccessed = countingAccesses ? new BitSet(keys.length) : null; return clone; }
@Override public FastMap<K,V> clone() { FastMap<K,V> clone; try { clone = (FastMap<K,V>) super.clone(); } catch (CloneNotSupportedException cnse) { throw new AssertionError(); } clone.keys = keys.clone(); clone.values = values.clone(); clone.recentlyAccessed = countingAccesses ? new BitSet(keys.length) : null; return clone; }
@Test(expected = ArrayIndexOutOfBoundsException.class) public void testBounds1() { BitSet bitSet = new BitSet(NUM_BITS); bitSet.set(1000); }
@Test(expected = ArrayIndexOutOfBoundsException.class) public void testBounds2() { BitSet bitSet = new BitSet(NUM_BITS); bitSet.set(-1); }
@Test public void testClone() { BitSet bitSet = new BitSet(NUM_BITS); bitSet.set(NUM_BITS-1); bitSet = bitSet.clone(); assertTrue(bitSet.get(NUM_BITS-1)); }
@Test public void testClear() { BitSet bitSet = new BitSet(NUM_BITS); for (int i = 0; i < NUM_BITS; i++) { bitSet.set(i); } for (int i = 0; i < NUM_BITS; i++) { assertTrue(bitSet.get(i)); } bitSet.clear(); for (int i = 0; i < NUM_BITS; i++) { assertFalse(bitSet.get(i)); } }
@Test public void testGetSet() { BitSet bitSet = new BitSet(NUM_BITS); for (int i = 0; i < NUM_BITS; i++) { assertFalse(bitSet.get(i)); } bitSet.set(0); bitSet.set(NUM_BITS-1); assertTrue(bitSet.get(0)); assertTrue(bitSet.get(NUM_BITS-1)); }