Lines Matching refs:entry
61 m_buckets = new Entry [initialCapacity];
87 final Entry [] buckets = m_buckets;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
93 if (key == entry.m_key)
112 final Entry [] buckets = m_buckets;
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
118 if (key == entry.m_key)
119 return entry.m_value;
136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
138 result [scan ++] = entry.m_key;
156 Entry currentKeyEntry = null;
158 // detect if 'key' is already in the table [in which case, set 'currentKeyEntry' to point to its entry]:
164 Entry [] buckets = m_buckets;
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
167 if (key == entry.m_key)
169 currentKeyEntry = entry;
185 // add a new entry:
191 final Entry bucketListHead = buckets [bucketIndex];
192 final Entry newEntry = new Entry (key, value, bucketListHead);
222 private static final class Entry implements Serializable
224 Entry (final int key, final Object value, final Entry next)
234 Entry m_next; // singly-linked list link
248 final Entry [] buckets = m_buckets;
251 final Entry [] newBuckets = new Entry [newBucketCount];
253 // rehash all entry chains in every bucket:
256 for (Entry entry = buckets [b]; entry != null; )
258 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry
259 final int entryKey = entry.m_key;
264 final Entry bucketListHead = newBuckets [newBucketIndex];
265 entry.m_next = bucketListHead;
266 newBuckets [newBucketIndex] = entry;
268 entry = next;
280 private Entry [] m_buckets; // table of buckets
