Searched refs:HashEntry (Results 1 - 5 of 5) sorted by relevance

/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DExpandedNameTable.java87 * internal HashEntry array.
102 private HashEntry[] m_table;
123 m_table = new HashEntry[m_capacity];
138 m_table[i] = new HashEntry(m_defaultExtendedTypes[i], i, i, null);
192 // Calculate the index into the HashEntry table.
199 for (HashEntry e = m_table[index]; e != null; e = e.next)
210 // Expand the internal HashEntry array if necessary.
233 HashEntry entry = new HashEntry(newET, m_nextType, hash, m_table[index]);
248 HashEntry[] oldTabl
375 private static final class HashEntry class in class:ExpandedNameTable
382 protected HashEntry(ExtendedType key, int value, int hash, HashEntry next) method in class:ExpandedNameTable.HashEntry
[all...]
/external/smack/src/org/jivesoftware/smack/util/collections/
H A DAbstractHashedMap.java29 * Key-value entries are stored in instances of the <code>HashEntry</code> class,
87 protected transient HashEntry<K, V>[] data;
126 this.data = new HashEntry[initialCapacity];
162 this.data = new HashEntry[initialCapacity];
192 HashEntry<K, V> entry = data[hashIndex(hashCode, data.length)]; // no local for hash index
229 HashEntry entry = data[hashIndex(hashCode, data.length)]; // no local for hash index
248 HashEntry entry = data[i];
258 HashEntry entry = data[i];
281 HashEntry<K, V> entry = data[index];
326 HashEntry<
1014 protected static class HashEntry <K,V> implements Map.Entry<K, V>, KeyValue<K, V> { class in class:AbstractHashedMap
1032 protected HashEntry(HashEntry<K, V> next, int hashCode, K key, V value) { method in class:AbstractHashedMap.HashEntry
[all...]
H A DAbstractReferenceMap.java2 // Perhaps use four different types of HashEntry classes for max efficiency:
3 // normal HashEntry for HARD,HARD
377 HashEntry<K, V> previous = null;
378 HashEntry<K, V> entry = data[index];
402 protected HashEntry<K, V> getEntry(Object key) {
442 * Creates a ReferenceEntry instead of a HashEntry.
450 public HashEntry<K, V> createEntry(HashEntry<K, V> next, int hashCode, K key, V value) {
564 protected static class ReferenceEntry <K,V> extends HashEntry<K, V> {
888 HashEntry<
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dhash.c52 struct HashEntry { struct
55 struct HashEntry *Next; /**< pointer to next entry */
63 struct HashEntry *Table[TABLE_SIZE]; /**< the lookup table */
104 struct HashEntry *entry = table->Table[pos];
106 struct HashEntry *next = entry->Next;
130 const struct HashEntry *entry;
180 struct HashEntry *entry;
208 entry = MALLOC_STRUCT(HashEntry);
234 struct HashEntry *entry, *prev;
293 struct HashEntry *entr
[all...]
/external/mesa3d/src/mesa/main/
H A Dhash.c52 struct HashEntry { struct
55 struct HashEntry *Next; /**< pointer to next entry */
63 struct HashEntry *Table[TABLE_SIZE]; /**< the lookup table */
104 struct HashEntry *entry = table->Table[pos];
106 struct HashEntry *next = entry->Next;
130 const struct HashEntry *entry;
180 struct HashEntry *entry;
208 entry = MALLOC_STRUCT(HashEntry);
234 struct HashEntry *entry, *prev;
293 struct HashEntry *entr
[all...]

Completed in 1873 milliseconds