Home
last modified time | relevance | path

Searched refs:m_NumOfBuckets (Results 1 – 4 of 4) sorted by relevance

/frameworks/compile/mclinker/include/mcld/ADT/
DHashBase.tcc55 m_NumOfBuckets(0), in HashTableImpl()
71 m_NumOfBuckets = 0; in HashTableImpl()
90 m_NumOfBuckets = in init()
97 m_Buckets = (bucket_type*)calloc(m_NumOfBuckets, sizeof(bucket_type)); in init()
106 m_NumOfBuckets = 0; in clear()
115 if (m_NumOfBuckets == 0) { in lookUpBucketFor()
121 unsigned int index = full_hash % m_NumOfBuckets; in lookUpBucketFor()
151 if (index == m_NumOfBuckets) in lookUpBucketFor()
160 if (m_NumOfBuckets == 0) in findKey()
164 unsigned int index = full_hash % m_NumOfBuckets; in findKey()
[all …]
DHashIterator.h34 m_EndIndex = m_Index = m_HashValue % m_pHashTable->m_NumOfBuckets; in ChainIteratorBase()
47 if (m_Index == m_pHashTable->m_NumOfBuckets) in ChainIteratorBase()
108 if (m_Index == m_pHashTable->m_NumOfBuckets) in advance()
209 if (m_pHashTable->m_NumOfBuckets == m_Index) { // to the end in advance()
DHashBase.h84 size_t numOfBuckets() const { return m_NumOfBuckets; } in numOfBuckets()
121 unsigned int m_NumOfBuckets; variable
DHashTable.tcc28 for (unsigned int i = 0; i < BaseTy::m_NumOfBuckets; ++i) { in ~HashTable()
44 for (unsigned int i = 0; i < BaseTy::m_NumOfBuckets; ++i) { in clear()
160 return ((float)BaseTy::m_NumOfEntries / (float)BaseTy::m_NumOfBuckets); in load_factor()