OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:HashEntry
(Results
1 - 7
of
7
) sorted by null
/frameworks/base/include/utils/
ZipFileRO.h
197
typedef struct
HashEntry
{
201
}
HashEntry
;
217
HashEntry
* mHashTable;
/bionic/libc/bionic/
malloc_debug_common.h
52
typedef struct
HashEntry
HashEntry
;
53
struct
HashEntry
{
55
HashEntry
* prev;
56
HashEntry
* next;
67
HashEntry
* slots[HASHTABLE_SIZE];
/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
);
/dalvik/vm/
Hash.h
61
typedef struct
HashEntry
{
64
}
HashEntry
;
77
HashEntry
* pEntries; /* array on heap */
132
return sizeof(HashTable) + pHashTable->tableSize * sizeof(
HashEntry
);
/dalvik/libcore/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/webkit/JavaScriptCore/runtime/
Lookup.h
54
class
HashEntry
: public FastAllocBase {
78
void setNext(
HashEntry
*next) { m_next = next; }
79
HashEntry
* next() const { return m_next; }
104
HashEntry
* m_next;
113
mutable const
HashEntry
* table; // Table allocated at runtime.
130
ALWAYS_INLINE const
HashEntry
* entry(JSGlobalData* globalData, const Identifier& identifier) const
136
ALWAYS_INLINE const
HashEntry
* entry(ExecState* exec, const Identifier& identifier) const
143
ALWAYS_INLINE const
HashEntry
* entry(const Identifier& identifier) const
147
const
HashEntry
* entry = &table[identifier.ustring().rep()->existingHash() & compactHashSizeMask];
165
void setUpStaticFunctionSlot(ExecState*, const
HashEntry
*, JSObject* thisObject, const Identifier& propertyName, PropertySlot&)
[
all
...]
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
ConcurrentHashMap.java
189
static final class
HashEntry
<K,V> {
193
final
HashEntry
<K,V> next;
195
HashEntry
(K key, int hash,
HashEntry
<K,V> next, V value) {
203
static final <K,V>
HashEntry
<K,V>[] newArray(int i) {
204
return new
HashEntry
[i];
278
transient volatile
HashEntry
<K,V>[] table;
290
setTable(
HashEntry
.<K,V>newArray(initialCapacity));
299
* Sets table to new
HashEntry
array.
302
void setTable(
HashEntry
<K,V>[] newTable)
[
all
...]
Completed in 627 milliseconds