HomeSort by relevance Sort by last modified time
    Searched defs:HashEntry (Results 1 - 13 of 13) sorted by null

  /frameworks/compile/mclinker/include/mcld/ADT/
HashEntry.h 1 //===- HashEntry.h ---------------------------------------------------------===//
22 /** \class HashEntry
23 * \brief HashEntry is the item in the bucket of hash table.
25 * mcld::HashEntry illustrates the demand from mcld::HashTable.
26 * Since HashTable can change the definition of the HashEntry by changing
27 * the template argument. class mcld::HashEntry here is used to show the
29 * of the hash table which has no relation to mcld::HashEntry
31 * Since mcld::HashEntry here is a special class whose size is changing,
33 * are doing when you let a new class inherit from mcld::HashEntry.
36 class HashEntry
    [all...]
  /bootable/recovery/minzip/
Hash.h 49 typedef struct HashEntry {
52 } HashEntry;
65 HashEntry* pEntries; /* array on heap */
108 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
  /frameworks/base/include/androidfw/
ZipFileRO.h 225 typedef struct HashEntry {
229 } HashEntry;
257 HashEntry* mHashTable;
  /bionic/libc/bionic/
malloc_debug_common.h 57 struct HashEntry {
59 HashEntry* prev;
60 HashEntry* next;
70 HashEntry* slots[HASHTABLE_SIZE];
pthread_debug.cpp 498 typedef struct HashEntry HashEntry;
499 struct HashEntry {
501 HashEntry* prev;
502 HashEntry* next;
508 HashEntry* slots[HASHTABLE_SIZE];
545 static void hashmap_removeEntry(HashTable* table, HashEntry* entry)
547 HashEntry* prev = entry->prev;
548 HashEntry* next = entry->next;
557 static HashEntry* hashmap_lookup(HashTable* table
    [all...]
  /dalvik/vm/
Hash.h 61 struct HashEntry {
77 HashEntry* pEntries; /* array on heap */
132 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
  /external/chromium_org/third_party/mesa/src/src/mesa/main/
hash.c 52 struct HashEntry {
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 *entry, *next
    [all...]
  /external/mesa3d/src/mesa/main/
hash.c 52 struct HashEntry {
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 *entry, *next
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
ExpandedNameTable.java 87 * 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[] oldTable = m_table
    [all...]
  /external/hyphenation/
hyphen.c 77 typedef struct _HashEntry HashEntry;
83 HashEntry *entries[HASH_SIZE];
87 HashEntry *next;
125 HashEntry *e, *next;
143 HashEntry *e;
146 e = hnj_malloc (sizeof(HashEntry));
158 HashEntry *e;
223 HashEntry *e;
294 HashEntry *e;
    [all...]
  /external/smack/src/org/jivesoftware/smack/util/collections/
AbstractHashedMap.java 29 * 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<K, V> entry = data[index]
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentHashMap.java 172 static final class HashEntry<K,V> {
176 volatile HashEntry<K,V> next;
178 HashEntry(int hash, K key, V value, HashEntry<K,V> next) {
189 final void setNext(HashEntry<K,V> n) {
199 Class<?> k = HashEntry.class;
214 static final <K,V> HashEntry<K,V> entryAt(HashEntry<K,V>[] tab, int i) {
216 (HashEntry<K,V>) UNSAFE.getObjectVolatile
224 static final <K,V> void setEntryAt(HashEntry<K,V>[] tab, int i
    [all...]
  /prebuilts/tools/common/m2/internal/xalan/xalan/2.6.0/
xalan-2.6.0.jar 

Completed in 214 milliseconds