Lines Matching refs:hash
31 * a simple hash algorithm directly into this class, instead of using the
33 * are combined in getExpandedTypeID() method to share the same hash calculation
35 * expand the hash table.
80 * The initial capacity of the hash table. Use a bigger number
86 * The capacity of the hash table, i.e. the size of the
92 * The threshold of the hash table, which is equal to capacity * loadFactor.
93 * If the number of entries in the hash table is bigger than the threshold,
94 * the hash table needs to be expanded.
99 * The internal array to store the hash entries.
100 * Each array member is a slot for a hash bucket.
186 // Calculate the hash code
187 int hash = type + namespace.hashCode() + localName.hashCode();
190 hashET.redefine(type, namespace, localName, hash);
193 int index = hash % m_capacity;
197 // Look up the expanded name in the hash table. Return the id if
198 // the expanded name is already in the hash table.
201 if (e.hash == hash && e.key.equals(hashET))
213 index = hash % m_capacity;
219 ExtendedType newET = new ExtendedType(type, namespace, localName, hash);
231 // Create a new hash entry for the new ExtendedType and put it into
233 HashEntry entry = new HashEntry(newET, m_nextType, hash, m_table[index]);
262 int newIndex = e.hash % newCapacity;
371 * Inner class which represents a hash table entry.
373 * the same bucket in the case of "hash collision".
379 int hash;
382 protected HashEntry(ExtendedType key, int value, int hash, HashEntry next)
386 this.hash = hash;