Home
last modified time | relevance | path

Searched refs:mHashes (Results 1 – 5 of 5) sorted by relevance

/frameworks/support/collection/src/main/java/androidx/collection/
DSimpleArrayMap.java68 int[] mHashes; field in SimpleArrayMap
92 int index = binarySearchHashes(mHashes, N, hash); in indexOf()
106 for (end = index + 1; end < N && mHashes[end] == hash; end++) { in indexOf()
111 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) { in indexOf()
130 int index = binarySearchHashes(mHashes, N, 0); in indexOfNull()
144 for (end = index + 1; end < N && mHashes[end] == 0; end++) { in indexOfNull()
149 for (int i = index - 1; i >= 0 && mHashes[i] == 0; i--) { in indexOfNull()
168 mHashes = (int[])array[1]; in allocArrays()
171 if (DEBUG) System.out.println(TAG + " Retrieving 2x cache " + mHashes in allocArrays()
182 mHashes = (int[])array[1]; in allocArrays()
[all …]
DArraySet.java78 private int[] mHashes; field in ArraySet
91 int index = ContainerHelpers.binarySearch(mHashes, N, hash); in indexOf()
105 for (end = index + 1; end < N && mHashes[end] == hash; end++) { in indexOf()
110 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) { in indexOf()
129 int index = ContainerHelpers.binarySearch(mHashes, N, 0); in indexOfNull()
143 for (end = index + 1; end < N && mHashes[end] == 0; end++) { in indexOfNull()
148 for (int i = index - 1; i >= 0 && mHashes[i] == 0; i--) { in indexOfNull()
167 mHashes = (int[]) array[1]; in allocArrays()
171 System.out.println(TAG + " Retrieving 2x cache " + mHashes + " now have " in allocArrays()
183 mHashes = (int[]) array[1]; in allocArrays()
[all …]
/frameworks/base/core/java/android/util/
DArraySet.java73 int[] mHashes; field in ArraySet
86 int index = ContainerHelpers.binarySearch(mHashes, N, hash); in indexOf()
100 for (end = index + 1; end < N && mHashes[end] == hash; end++) { in indexOf()
105 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) { in indexOf()
124 int index = ContainerHelpers.binarySearch(mHashes, N, 0); in indexOfNull()
138 for (end = index + 1; end < N && mHashes[end] == 0; end++) { in indexOfNull()
143 for (int i = index - 1; i >= 0 && mHashes[i] == 0; i--) { in indexOfNull()
162 mHashes = (int[]) array[1]; in allocArrays()
166 Log.d(TAG, "Retrieving 2x cache " + mHashes + " now have " in allocArrays()
187 mHashes = (int[]) array[1]; in allocArrays()
[all …]
DArrayMap.java97 int[] mHashes; field in ArrayMap
122 int index = binarySearchHashes(mHashes, N, hash); in indexOf()
136 for (end = index + 1; end < N && mHashes[end] == hash; end++) { in indexOf()
141 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) { in indexOf()
160 int index = binarySearchHashes(mHashes, N, 0); in indexOfNull()
174 for (end = index + 1; end < N && mHashes[end] == 0; end++) { in indexOfNull()
179 for (int i = index - 1; i >= 0 && mHashes[i] == 0; i--) { in indexOfNull()
191 if (mHashes == EMPTY_IMMUTABLE_INTS) { in allocArrays()
200 mHashes = (int[])array[1]; in allocArrays()
203 if (DEBUG) Log.d(TAG, "Retrieving 2x cache " + mHashes in allocArrays()
[all …]
/frameworks/base/config/
Dhiddenapi-light-greylist.txt5820 Landroid/util/ArrayMap;->mHashes:[I
5830 Landroid/util/ArraySet;->mHashes:[I