/frameworks/base/core/java/android/util/ |
H A D | SparseBooleanArray.java | 43 mKeys = new int[initialCapacity]; 53 clone.mKeys = mKeys.clone(); 74 int i = binarySearch(mKeys, 0, mSize, key); 87 int i = binarySearch(mKeys, 0, mSize, key); 90 System.arraycopy(mKeys, i + 1, mKeys, i, mSize - (i + 1)); 102 int i = binarySearch(mKeys, 0, mSize, key); 109 if (mSize >= mKeys.length) { 115 // Log.e("SparseBooleanArray", "grow " + mKeys 243 private int[] mKeys; field in class:SparseBooleanArray [all...] |
H A D | SparseIntArray.java | 28 private int[] mKeys; field in class:SparseIntArray 47 mKeys = new int[initialCapacity]; 57 clone.mKeys = mKeys.clone(); 78 int i = binarySearch(mKeys, 0, mSize, key); 91 int i = binarySearch(mKeys, 0, mSize, key); 102 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1)); 113 int i = binarySearch(mKeys, 0, mSize, key); 120 if (mSize >= mKeys [all...] |
H A D | SparseLongArray.java | 30 private int[] mKeys; field in class:SparseLongArray 49 mKeys = new int[initialCapacity]; 59 clone.mKeys = mKeys.clone(); 80 int i = binarySearch(mKeys, 0, mSize, key); 93 int i = binarySearch(mKeys, 0, mSize, key); 104 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1)); 115 int i = binarySearch(mKeys, 0, mSize, key); 122 if (mSize >= mKeys [all...] |
H A D | LongSparseArray.java | 30 private long[] mKeys; field in class:LongSparseArray 49 mKeys = new long[initialCapacity]; 60 clone.mKeys = mKeys.clone(); 82 int i = binarySearch(mKeys, 0, mSize, key); 95 int i = binarySearch(mKeys, 0, mSize, key); 127 long[] keys = mKeys; 156 int i = binarySearch(mKeys, 0, mSize, key); 164 mKeys[i] = key; 169 if (mGarbage && mSize >= mKeys [all...] |
H A D | SparseArray.java | 30 private int[] mKeys; field in class:SparseArray 49 mKeys = new int[initialCapacity]; 60 clone.mKeys = mKeys.clone(); 82 int i = binarySearch(mKeys, 0, mSize, key); 95 int i = binarySearch(mKeys, 0, mSize, key); 127 int[] keys = mKeys; 156 int i = binarySearch(mKeys, 0, mSize, key); 164 mKeys[i] = key; 169 if (mGarbage && mSize >= mKeys [all...] |
/frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/util/ |
H A D | SparseWeakArray.java | 63 mKeys = new int[initialCapacity]; 81 int i = binarySearch(mKeys, 0, mSize, key); 94 int i = binarySearch(mKeys, 0, mSize, key); 124 int[] keys = mKeys; 146 if (newSize < mKeys.length) { 150 System.arraycopy(mKeys, 0, nkeys, 0, newSize); 153 mKeys = nkeys; 164 int i = binarySearch(mKeys, 0, mSize, key); 172 mKeys[i] = key; 177 if (mSize >= mKeys 373 private int[] mKeys; field in class:SparseWeakArray [all...] |
/frameworks/support/v4/java/android/support/v4/util/ |
H A D | LongSparseArray.java | 28 private long[] mKeys; field in class:LongSparseArray 47 mKeys = new long[initialCapacity]; 58 clone.mKeys = mKeys.clone(); 80 int i = binarySearch(mKeys, 0, mSize, key); 93 int i = binarySearch(mKeys, 0, mSize, key); 125 long[] keys = mKeys; 154 int i = binarySearch(mKeys, 0, mSize, key); 162 mKeys[i] = key; 167 if (mGarbage && mSize >= mKeys [all...] |
H A D | SparseArrayCompat.java | 42 mKeys = new int[initialCapacity]; 60 int i = binarySearch(mKeys, 0, mSize, key); 73 int i = binarySearch(mKeys, 0, mSize, key); 118 int[] keys = mKeys; 146 int i = binarySearch(mKeys, 0, mSize, key); 154 mKeys[i] = key; 159 if (mGarbage && mSize >= mKeys.length) { 163 i = ~binarySearch(mKeys, 0, mSize, key); 166 if (mSize >= mKeys.length) { 172 // Log.e("SparseArray", "grow " + mKeys 357 private int[] mKeys; field in class:SparseArrayCompat [all...] |
/frameworks/base/core/java/android/app/backup/ |
H A D | WallpaperBackupHelper.java | 57 String[] mKeys; field in class:WallpaperBackupHelper 73 mKeys = keys; 101 performBackup_checked(oldState, data, newState, mFiles, mKeys); 111 if (isKeyInList(key, mKeys)) {
|
/frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/tablet/ |
H A D | TabletTicker.java | 72 private IBinder[] mKeys = new IBinder[QUEUE_LENGTH]; field in class:TabletTicker 100 mKeys[mQueuePos] = key; 127 if (mKeys[i] == key) { 129 mKeys[i] = mKeys[i+1]; 132 mKeys[QUEUE_LENGTH-1] = null; 147 mKeys[i] = null; 196 mCurrentKey = mKeys[0]; 203 mKeys[i] = mKeys[ [all...] |
/frameworks/base/libs/androidfw/ |
H A D | KeyCharacterMap.cpp | 95 for (size_t i = 0; i < other.mKeys.size(); i++) { 96 mKeys.add(other.mKeys.keyAt(i), new Key(*other.mKeys.valueAt(i))); 101 for (size_t i = 0; i < mKeys.size(); i++) { 102 Key* key = mKeys.editValueAt(i); 173 for (size_t i = 0; i < overlay->mKeys.size(); i++) { 174 int32_t keyCode = overlay->mKeys.keyAt(i); 175 Key* key = overlay->mKeys.valueAt(i); 176 ssize_t oldIndex = map->mKeys [all...] |
/frameworks/base/core/java/android/inputmethodservice/ |
H A D | Keyboard.java | 121 private List<Key> mKeys; field in class:Keyboard 170 ArrayList<Key> mKeys = new ArrayList<Key>(); field in class:Keyboard.Row 530 mKeys = new ArrayList<Key>(); 553 mKeys = new ArrayList<Key>(); 603 mKeys.add(key); 604 row.mKeys.add(key); 617 int numKeys = row.mKeys.size(); 621 Key key = row.mKeys.get(keyIndex); 631 Key key = row.mKeys.get(keyIndex); 645 return mKeys; [all...] |
H A D | KeyboardView.java | 160 private Key[] mKeys; field in class:KeyboardView 466 mKeys = keys.toArray(new Key[keys.size()]); 606 final Key[] keys = mKeys; 662 final Key[] keys = mKeys; 753 final Key[] keys = mKeys; 804 if (index != NOT_A_KEY && index < mKeys.length) { 805 final Key key = mKeys[index]; 852 final Key[] keys = mKeys; 902 final Key[] keys = mKeys; 903 if (keyIndex < 0 || keyIndex >= mKeys [all...] |
/frameworks/base/include/androidfw/ |
H A D | KeyCharacterMap.h | 216 KeyedVector<int32_t, Key*> mKeys; member in class:android::KeyCharacterMap
|