Lines Matching defs:Entry
59 m_buckets = new Entry [initialCapacity];
85 final Entry [] buckets = m_buckets;
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
91 if (key == entry.m_key)
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
111 result [scan ++] = entry.m_key;
127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
129 target [scan ++] = entry.m_key;
137 Entry currentKeyEntry = null;
139 // detect if 'key' is already in the table [in which case, set 'currentKeyEntry' to point to its entry]:
145 Entry [] buckets = m_buckets;
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
148 if (key == entry.m_key)
150 currentKeyEntry = entry;
157 // add a new entry:
163 final Entry bucketListHead = buckets [bucketIndex];
164 final Entry newEntry = new Entry (key, bucketListHead);
196 private static final class Entry
198 Entry (final int key, final Entry next)
206 Entry m_next; // singly-linked list link
220 final Entry [] buckets = m_buckets;
223 final Entry [] newBuckets = new Entry [newBucketCount];
225 // rehash all entry chains in every bucket:
228 for (Entry entry = buckets [b]; entry != null; )
230 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry
231 final int entryKey = entry.m_key;
236 final Entry bucketListHead = newBuckets [newBucketIndex];
237 entry.m_next = bucketListHead;
238 newBuckets [newBucketIndex] = entry;
240 entry = next;
252 private Entry [] m_buckets; // table of buckets
