Lines Matching refs:pHashTable
89 void mzHashTableClear(HashTable* pHashTable);
94 void mzHashTableFree(HashTable* pHashTable);
99 INLINE int mzHashTableNumEntries(HashTable* pHashTable) in mzHashTableNumEntries() argument
101 return pHashTable->numEntries; in mzHashTableNumEntries()
107 INLINE int mzHashTableMemUsage(HashTable* pHashTable) in mzHashTableMemUsage() argument
109 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry); in mzHashTableMemUsage()
121 void* mzHashTableLookup(HashTable* pHashTable, unsigned int itemHash, void* item,
128 bool mzHashTableRemove(HashTable* pHashTable, unsigned int hash, void* item);
135 int mzHashForeach(HashTable* pHashTable, HashForeachFunc func, void* arg);
150 HashTable* pHashTable; member
156 int lim = pIter->pHashTable->tableSize; in mzHashIterNext()
158 void* data = pIter->pHashTable->pEntries[i].data; in mzHashIterNext()
164 INLINE void mzHashIterBegin(HashTable* pHashTable, HashIter* pIter) in mzHashIterBegin() argument
166 pIter->pHashTable = pHashTable; in mzHashIterBegin()
172 return (pIter->idx >= pIter->pHashTable->tableSize); in mzHashIterDone()
176 assert(pIter->idx >= 0 && pIter->idx < pIter->pHashTable->tableSize); in mzHashIterData()
177 return pIter->pHashTable->pEntries[pIter->idx].data; in mzHashIterData()
188 void mzHashTableProbeCount(HashTable* pHashTable, HashCalcFunc calcFunc,