| /external/replicaisland/src/com/replica/replicaisland/ |
| InputKeyboard.java | 24 private InputButton[] mKeys;
28 mKeys = new InputButton[count];
30 mKeys[x] = new InputButton();
35 assert keycode >= 0 && keycode < mKeys.length;
36 if (keycode >= 0 && keycode < mKeys.length){
37 mKeys[keycode].press(currentTime, 1.0f);
42 assert keycode >= 0 && keycode < mKeys.length;
43 if (keycode >= 0 && keycode < mKeys.length){
44 mKeys[keycode].release();
49 final int count = mKeys.length
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/recents/model/ |
| TaskKeyLruCache.java | 42 private final SparseArray<Task.TaskKey> mKeys = new SparseArray<>();
57 mEvictionCallback.onEntryEvicted(mKeys.get(taskId));
59 mKeys.remove(taskId);
77 Task.TaskKey lastKey = mKeys.get(key.id);
98 mKeys.put(key.id, key);
106 mKeys.remove(key.id);
112 mKeys.clear();
124 writer.print(" numEntries="); writer.print(mKeys.size());
126 int keyCount = mKeys.size();
128 writer.print(innerPrefix); writer.println(mKeys.get(mKeys.keyAt(i)))
[all...] |
| /packages/inputmethods/LatinIME/tools/dicttool/compat/android/util/ |
| SparseArray.java | 23 private final ArrayList<Integer> mKeys;
31 mKeys = new ArrayList<>(initialCapacity);
36 return mKeys.size();
40 mKeys.clear();
45 final int index = Collections.binarySearch(mKeys, key);
51 mKeys.add(insertIndex, key);
60 final int index = Collections.binarySearch(mKeys, key);
68 return mKeys.indexOf(key);
76 return mKeys.get(index);
|
| /frameworks/base/core/java/android/service/notification/ |
| NotificationRankingUpdate.java | 27 private final String[] mKeys;
38 mKeys = keys;
48 mKeys = in.readStringArray();
52 mImportance = new int[mKeys.length];
65 out.writeStringArray(mKeys);
86 return mKeys;
|
| /frameworks/base/core/java/android/util/ |
| LongSparseLongArray.java | 48 private long[] mKeys;
68 mKeys = EmptyArray.LONG;
71 mKeys = ArrayUtils.newUnpaddedLongArray(initialCapacity);
72 mValues = new long[mKeys.length];
82 clone.mKeys = mKeys.clone();
103 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
116 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
127 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1))
[all...] |
| SparseIntArray.java | 48 private int[] mKeys;
68 mKeys = EmptyArray.INT;
71 mKeys = ArrayUtils.newUnpaddedIntArray(initialCapacity);
72 mValues = new int[mKeys.length];
82 clone.mKeys = mKeys.clone();
103 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
116 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
127 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1))
[all...] |
| SparseLongArray.java | 46 private int[] mKeys;
66 mKeys = EmptyArray.INT;
70 mKeys = new int[mValues.length];
80 clone.mKeys = mKeys.clone();
101 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
114 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
125 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
136 int i = ContainerHelpers.binarySearch(mKeys, mSize, key)
[all...] |
| LongSparseArray.java | 56 private long[] mKeys;
76 mKeys = EmptyArray.LONG;
79 mKeys = ArrayUtils.newUnpaddedLongArray(initialCapacity);
91 clone.mKeys = mKeys.clone();
113 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
126 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
158 long[] keys = mKeys;
187 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
195 mKeys[i] = key
[all...] |
| SparseArray.java | 56 private int[] mKeys;
76 mKeys = EmptyArray.INT;
80 mKeys = new int[mValues.length];
91 clone.mKeys = mKeys.clone();
113 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
126 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
141 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
195 int[] keys = mKeys;
224 int i = ContainerHelpers.binarySearch(mKeys, mSize, key)
[all...] |
| SparseBooleanArray.java | 63 mKeys = EmptyArray.INT;
66 mKeys = ArrayUtils.newUnpaddedIntArray(initialCapacity);
67 mValues = new boolean[mKeys.length];
77 clone.mKeys = mKeys.clone();
98 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
111 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
114 System.arraycopy(mKeys, i + 1, mKeys, i, mSize - (i + 1));
122 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1))
[all...] |
| /external/smali/util/src/main/java/org/jf/util/ |
| SparseArray.java | 60 mKeys = new int[initialCapacity];
78 int i = binarySearch(mKeys, 0, mSize, key);
91 int i = binarySearch(mKeys, 0, mSize, key);
113 int[] keys = mKeys;
141 int i = binarySearch(mKeys, 0, mSize, key);
149 mKeys[i] = key;
154 if (mGarbage && mSize >= mKeys.length) {
158 i = ~binarySearch(mKeys, 0, mSize, key);
161 if (mSize >= mKeys.length) {
162 int n = Math.max(mSize + 1, mKeys.length * 2)
[all...] |
| SparseIntArray.java | 53 mKeys = new int[initialCapacity];
71 int i = binarySearch(mKeys, 0, mSize, key);
85 int i = binarySearch(mKeys, 0, mSize, key);
102 int i = binarySearch(mKeys, 0, mSize, key);
113 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
124 int i = binarySearch(mKeys, 0, mSize, key);
131 if (mSize >= mKeys.length) {
132 int n = Math.max(mSize + 1, mKeys.length * 2);
137 // Log.e("SparseIntArray", "grow " + mKeys.length + " to " + n)
[all...] |
| /frameworks/base/core/java/android/view/inputmethod/ |
| SparseRectFArray.java | 41 private final int[] mKeys;
45 * {@code rects[mKeys[0]].left}, {@code rects[mKeys[0]].top},
46 * {@code rects[mKeys[0]].right}, {@code rects[mKeys[0]].bottom},
47 * {@code rects[mKeys[1]].left}, {@code rects[mKeys[1]].top},
48 * {@code rects[mKeys[1]].right}, {@code rects[mKeys[1]].bottom},
49 * {@code rects[mKeys[2]].left}, {@code rects[mKeys[2]].top}, ...
[all...] |
| /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/util/ |
| SparseWeakArray.java | 63 mKeys = ArrayUtils.newUnpaddedLongArray(initialCapacity);
64 mValues = new WeakReference[mKeys.length];
81 int i = binarySearch(mKeys, 0, mSize, key);
94 int i = binarySearch(mKeys, 0, mSize, key);
124 long[] keys = mKeys;
152 int i = binarySearch(mKeys, 0, mSize, key);
160 mKeys[i] = key;
165 if (mSize >= mKeys.length && (mGarbage || hasReclaimedRefs())) {
169 i = ~binarySearch(mKeys, 0, mSize, key);
172 mKeys = GrowingArrayUtils.insert(mKeys, mSize, i, key)
[all...] |
| /hardware/libhardware/tests/input/evdev/ |
| InputMocks.h | 55 virtual bool hasKey(int32_t key) const override { return mKeys.count(key); }
71 mKeys.insert(key);
114 std::set<int32_t> mKeys;
|
| /packages/apps/Messaging/src/com/android/messaging/ui/debug/ |
| DebugMmsConfigFragment.java | 99 private final List<String> mKeys;
105 mKeys = new ArrayList<>(mMmsConfig.keySet());
106 Collections.sort(mKeys);
118 final String key = mKeys.get(position);
134 return mKeys.size();
139 return mKeys.get(position);
|
| /packages/apps/UnifiedEmail/src/com/android/mail/utils/ |
| SparseLongArray.java | 29 private int[] mKeys;
46 mKeys = new int[initialCapacity];
56 clone.mKeys = mKeys.clone();
77 int i = binarySearch(mKeys, 0, mSize, key);
90 int i = binarySearch(mKeys, 0, mSize, key);
101 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
112 int i = binarySearch(mKeys, 0, mSize, key);
119 if (mSize >= mKeys.length)
[all...] |
| /packages/experimental/NotificationListenerSample/src/com/android/example/notificationlistener/ |
| NotificationListenerActivity.java | 182 private HashSet<String> mKeys;
190 mKeys = new HashSet<String>();
260 mKeys.clear();
262 mKeys.add(mNotifications.get(i).getKey());
264 mKeyToId.keySet().retainAll(mKeys);
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/bluetooth/ |
| BleScannerHardwareScanFilterActivity.java | 127 private ArrayList<String> mKeys;
130 mKeys = new ArrayList<>();
140 return mData.get(mKeys.get(position));
150 mKeys.add(key);
164 String key = mKeys.get(pos);
|
| /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowSparseArray.java | 60 mKeys = new int[initialCapacity];
82 int i = binarySearch(mKeys, 0, mSize, key);
97 int i = binarySearch(mKeys, 0, mSize, key);
120 int[] keys = mKeys;
149 int i = binarySearch(mKeys, 0, mSize, key);
157 mKeys[i] = key;
162 if (mGarbage && mSize >= mKeys.length) {
166 i = ~binarySearch(mKeys, 0, mSize, key);
169 if (mSize >= mKeys.length) {
175 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n)
[all...] |
| /frameworks/base/core/java/android/app/backup/ |
| WallpaperBackupHelper.java | 85 String[] mKeys;
101 mKeys = keys;
129 performBackup_checked(oldState, data, newState, mFiles, mKeys);
140 if (isKeyInList(key, mKeys)) {
|
| /frameworks/base/core/java/android/os/health/ |
| HealthKeys.java | 86 private final int[][] mKeys = new int[TYPE_COUNT][];
103 final SortedIntArray[] keys = new SortedIntArray[mKeys.length];
127 mKeys[i] = keys[i].getArray();
149 return mKeys[type].length;
163 final int index = Arrays.binarySearch(mKeys[type], key);
176 return mKeys[type];
|
| /frameworks/base/services/core/java/com/android/server/accounts/ |
| TokenCache.java | 86 private final List<Key> mKeys;
89 mKeys = new ArrayList<>();
93 mKeys.add(k);
97 for (Key k : mKeys) {
|
| /frameworks/native/include/input/ |
| KeyCharacterMap.h | 227 KeyedVector<int32_t, Key*> mKeys;
|
| /frameworks/support/compat/java/android/support/v4/util/ |
| LongSparseArray.java | 47 private long[] mKeys;
67 mKeys = ContainerHelpers.EMPTY_LONGS;
71 mKeys = new long[initialCapacity];
83 clone.mKeys = mKeys.clone();
105 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
118 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
150 long[] keys = mKeys;
179 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
187 mKeys[i] = key
[all...] |
