private void clearStaleEntry(int index) { while (true) { K currentKey; do { if (index == 0) { index = keys.length - 1; } else { index--; } currentKey = keys[index]; } while (currentKey == null || currentKey == REMOVED); if (recentlyAccessed.get(index)) { recentlyAccessed.clear(index); } else { break; } } // Delete the entry ((Object[])keys)[index] = REMOVED; numEntries--; values[index] = null; }
private void clearStaleEntry(int index) { while (true) { K currentKey; do { if (index == 0) { index = keys.length - 1; } else { index--; } currentKey = keys[index]; } while (currentKey == null || currentKey == REMOVED); if (recentlyAccessed.get(index)) { recentlyAccessed.clear(index); } else { break; } } // Delete the entry ((Object[])keys)[index] = REMOVED; numEntries--; values[index] = null; }
private void clearStaleEntry(int index) { while (true) { long currentKey; do { if (index == 0) { index = keys.length - 1; } else { index--; } currentKey = keys[index]; } while (currentKey == NULL || currentKey == REMOVED); if (recentlyAccessed.get(index)) { recentlyAccessed.clear(index); } else { break; } } // Delete the entry keys[index] = REMOVED; numEntries--; values[index] = null; }
private void clearStaleEntry(int index) { while (true) { long currentKey; do { if (index == 0) { index = keys.length - 1; } else { index--; } currentKey = keys[index]; } while (currentKey == NULL || currentKey == REMOVED); if (recentlyAccessed.get(index)) { recentlyAccessed.clear(index); } else { break; } } // Delete the entry keys[index] = REMOVED; numEntries--; values[index] = null; }
private void clearStaleEntry(int index) { while (true) { K currentKey; do { if (index == 0) { index = keys.length - 1; } else { index--; } currentKey = keys[index]; } while (currentKey == null || currentKey == REMOVED); if (recentlyAccessed.get(index)) { recentlyAccessed.clear(index); } else { break; } } // Delete the entry ((Object[])keys)[index] = REMOVED; numEntries--; values[index] = null; }
private void clearStaleEntry(int index) { while (true) { long currentKey; do { if (index == 0) { index = keys.length - 1; } else { index--; } currentKey = keys[index]; } while (currentKey == NULL || currentKey == REMOVED); if (recentlyAccessed.get(index)) { recentlyAccessed.clear(index); } else { break; } } // Delete the entry keys[index] = REMOVED; numEntries--; values[index] = null; }
@Test public void testClone() { BitSet bitSet = new BitSet(NUM_BITS); bitSet.set(NUM_BITS-1); bitSet = bitSet.clone(); assertTrue(bitSet.get(NUM_BITS-1)); }