Searched refs:hashIndex (Results 1 – 5 of 5) sorted by relevance
| /external/qemu/android/base/containers/ |
| D | PodVector_unittest.cpp | 19 static int hashIndex(size_t n) { in hashIndex() function
41 v.append(hashIndex(n)); in TEST()
45 EXPECT_EQ(hashIndex(n), v[n]) << "At index " << n; in TEST()
53 v.append(hashIndex(n)); in TEST()
57 EXPECT_EQ(hashIndex(n), v[0]) << "At index " << n; in TEST()
67 v.prepend(hashIndex(n)); in TEST()
71 EXPECT_EQ(hashIndex(kMaxCount - n - 1), v[n]) << "At index " << n; in TEST()
80 v.append(hashIndex(n)); in TEST()
86 EXPECT_EQ(hashIndex(n), v[n]) << "At index " << n; in TEST()
95 v.append(hashIndex(n)); in TEST()
[all …]
|
| /external/smack/src/org/jivesoftware/smack/util/collections/ |
| D | AbstractHashedMap.java | 192 HashEntry<K, V> entry = data[hashIndex(hashCode, data.length)]; // no local for hash index in get()
229 HashEntry entry = data[hashIndex(hashCode, data.length)]; // no local for hash index in containsKey()
280 int index = hashIndex(hashCode, data.length); in put()
325 int index = hashIndex(hashCode, data.length); in remove()
406 protected int hashIndex(int hashCode, int dataSize) { in hashIndex() method in AbstractHashedMap
423 HashEntry<K, V> entry = data[hashIndex(hashCode, data.length)]; // no local for hash index in getEntry()
459 protected void reuseEntry(HashEntry<K, V> entry, int hashIndex, int hashCode, K key, V value) { in reuseEntry() argument
460 entry.next = data[hashIndex]; in reuseEntry()
480 protected void addMapping(int hashIndex, int hashCode, K key, V value) { in addMapping() argument
482 HashEntry<K, V> entry = createEntry(data[hashIndex], hashCode, key, value); in addMapping()
[all …]
|
| D | AbstractReferenceMap.java | 376 int index = hashIndex(hash, data.length); in purge()
|
| /external/chromium_org/chrome/common/extensions/docs/examples/api/downloads/download_links/ |
| D | send_links.js | 14 var hashIndex = href.indexOf('#');
15 if (hashIndex >= 0) {
16 href = href.substr(0, hashIndex);
|
| /external/skia/src/gpu/ |
| D | GrTHashTable.h | 126 int hashIndex = hash2Index(key.getHash()); in find() local
127 T* elem = fHash[hashIndex]; in find()
148 fHash[hashIndex] = fSorted[index]; in find()
|