Entry<T> m = new Entry<T>(p.objectRef, p.hash, p.proxyRef, newTable[k]); newTable[k] = m;
Entry<T> m = new Entry<T>(p.objectRef, p.hash, p.proxyRef, newTable[k]); newTable[k] = m;
Entry<T> m = new Entry<T>(p.objectRef, p.hash, p.proxyRef, newTable[k]); newTable[k] = m;
Entry<T> m = new Entry<T>(p.objectRef, p.hash, p.proxyRef, newTable[k]); newTable[k] = m;
e = new Entry<T>(object, hash, proxy, cache.referenceType, table[index], referenceQueue); table[index] = e; tableSize = potentialNewSize;
e = new Entry<T>(object, hash, proxy, cache.referenceType, table[index], referenceQueue); table[index] = e; tableSize = potentialNewSize;
e = new Entry<T>(object, hash, proxy, cache.referenceType, table[index], referenceQueue); table[index] = e; tableSize = potentialNewSize;
e = new Entry<T>(object, hash, proxy, cache.referenceType, table[index], referenceQueue); table[index] = e; tableSize = potentialNewSize;
e = new Entry<T>(object, hash, proxy, cache.referenceType, table[index], referenceQueue); table[index] = e; tableSize = potentialNewSize;
e = new Entry<T>(object, hash, proxy, cache.referenceType, table[index], referenceQueue); table[index] = e; tableSize = potentialNewSize;
e = new Entry<T>(object, hash, proxy, cache.referenceType, table[index], referenceQueue); table[index] = e; tableSize = potentialNewSize;
e = new Entry<T>(object, hash, proxy, cache.referenceType, table[index], referenceQueue); table[index] = e; tableSize = potentialNewSize;
private void remove(Entry<T>[] table, int hash, Entry<T> e) { int index = hash & (table.length - 1); Entry<T> first = table[index]; for (Entry<T> n = first; n != null; n = n.next) { if (n == e) { Entry<T> newFirst = n.next; for (Entry<T> p = first; p != n; p = p.next) { newFirst = new Entry<T>(p.objectRef, p.hash, p.proxyRef, newFirst); } table[index] = newFirst; tableSize--; entryTable = table; // write-volatile return; } } }
private void remove(Entry<T>[] table, int hash, Entry<T> e) { int index = hash & (table.length - 1); Entry<T> first = table[index]; for (Entry<T> n = first; n != null; n = n.next) { if (n == e) { Entry<T> newFirst = n.next; for (Entry<T> p = first; p != n; p = p.next) { newFirst = new Entry<T>(p.objectRef, p.hash, p.proxyRef, newFirst); } table[index] = newFirst; tableSize--; entryTable = table; // write-volatile return; } } }
private void remove(Entry<T>[] table, int hash, Entry<T> e) { int index = hash & (table.length - 1); Entry<T> first = table[index]; for (Entry<T> n = first; n != null; n = n.next) { if (n == e) { Entry<T> newFirst = n.next; for (Entry<T> p = first; p != n; p = p.next) { newFirst = new Entry<T>(p.objectRef, p.hash, p.proxyRef, newFirst); } table[index] = newFirst; tableSize--; entryTable = table; // write-volatile return; } } }
private void remove(Entry<T>[] table, int hash, Entry<T> e) { int index = hash & (table.length - 1); Entry<T> first = table[index]; for (Entry<T> n = first; n != null; n = n.next) { if (n == e) { Entry<T> newFirst = n.next; for (Entry<T> p = first; p != n; p = p.next) { newFirst = new Entry<T>(p.objectRef, p.hash, p.proxyRef, newFirst); } table[index] = newFirst; tableSize--; entryTable = table; // write-volatile return; } } }