Lines Matching defs:Entry
47 private Entry<T>[] table = newTable(1<<3); // table's length MUST be a power of two
58 for (Entry<T> entry = this.table[index]; entry != null; entry = entry.next) {
73 for (Entry<T> entry = this.table[index]; entry != null; entry = entry.next) {
80 this.table[index] = new Entry<T>(key, hash, value, this.queue, this.table[index]);
87 Entry<T>[] table = newTable(this.table.length * 2);
108 Entry<T> entry = (Entry<T>) ref;
111 Entry<T> prev = this.table[index];
112 Entry<T> current = prev;
114 Entry<T> next = current.next;
133 private void transfer(Entry<T>[] oldTable, Entry<T>[] newTable) {
135 Entry<T> entry = oldTable[i];
138 Entry<T> next = entry.next;
157 private Entry<T>[] newTable(int length) {
158 return (Entry<T>[]) new Entry<?>[length];
161 private static int getIndex(Entry<?>[] table, int hash) {
165 private static class Entry<T> extends WeakReference<Object> {
168 private Entry<T> next;
170 Entry(Object key, int hash, T value, ReferenceQueue<Object> queue, Entry<T> next) {