Searched defs:mHashes (Results 1 - 5 of 5) sorted by relevance

/frameworks/base/packages/Osu/src/com/android/hotspot2/osu/
H A DSPVerifier.java87 private final List<HashAlgAndValue> mHashes = new ArrayList<>(); field in class:SPVerifier.LogoTypeImage
103 mHashes.add(new HashAlgAndValue(castObject(hash, Asn1Constructed.class)));
160 for (HashAlgAndValue hash : mHashes) {
179 ", hashes=" + mHashes +
/frameworks/base/core/java/android/util/
H A DArraySet.java73 int[] mHashes; field in class:ArraySet
86 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
100 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
105 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
124 int index = ContainerHelpers.binarySearch(mHashes, N, 0);
138 for (end = index + 1; end < N && mHashes[end] == 0; end++) {
143 for (int i = index - 1; i >= 0 && mHashes[i] == 0; i--) {
162 mHashes = (int[]) array[1];
166 Log.d(TAG, "Retrieving 2x cache " + mHashes + " now have "
187 mHashes
[all...]
H A DArrayMap.java97 int[] mHashes; field in class:ArrayMap
122 int index = binarySearchHashes(mHashes, N, hash);
136 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
141 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
160 int index = binarySearchHashes(mHashes, N, 0);
174 for (end = index + 1; end < N && mHashes[end] == 0; end++) {
179 for (int i = index - 1; i >= 0 && mHashes[i] == 0; i--) {
191 if (mHashes == EMPTY_IMMUTABLE_INTS) {
200 mHashes = (int[])array[1];
203 if (DEBUG) Log.d(TAG, "Retrieving 2x cache " + mHashes
[all...]
/frameworks/support/compat/java/android/support/v4/util/
H A DArraySet.java78 int[] mHashes; field in class:ArraySet
91 int index = ContainerHelpers.binarySearch(mHashes, N, hash);
105 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
110 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
129 int index = ContainerHelpers.binarySearch(mHashes, N, 0);
143 for (end = index + 1; end < N && mHashes[end] == 0; end++) {
148 for (int i = index - 1; i >= 0 && mHashes[i] == 0; i--) {
167 mHashes = (int[]) array[1];
171 Log.d(TAG, "Retrieving 2x cache " + mHashes + " now have "
183 mHashes
[all...]
H A DSimpleArrayMap.java70 int[] mHashes; field in class:SimpleArrayMap
94 int index = binarySearchHashes(mHashes, N, hash);
108 for (end = index + 1; end < N && mHashes[end] == hash; end++) {
113 for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
132 int index = binarySearchHashes(mHashes, N, 0);
146 for (end = index + 1; end < N && mHashes[end] == 0; end++) {
151 for (int i = index - 1; i >= 0 && mHashes[i] == 0; i--) {
170 mHashes = (int[])array[1];
173 if (DEBUG) Log.d(TAG, "Retrieving 2x cache " + mHashes
184 mHashes
[all...]

Completed in 154 milliseconds