HomeSort by relevance Sort by last modified time
    Searched refs:mKeys (Results 1 - 13 of 13) sorted by null

  /frameworks/base/core/java/android/util/
SparseBooleanArray.java 43 mKeys = new int[initialCapacity];
61 int i = binarySearch(mKeys, 0, mSize, key);
74 int i = binarySearch(mKeys, 0, mSize, key);
77 System.arraycopy(mKeys, i + 1, mKeys, i, mSize - (i + 1));
89 int i = binarySearch(mKeys, 0, mSize, key);
96 if (mSize >= mKeys.length) {
102 // Log.e("SparseBooleanArray", "grow " + mKeys.length + " to " + n);
103 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length)
    [all...]
SparseIntArray.java 42 mKeys = new int[initialCapacity];
60 int i = binarySearch(mKeys, 0, mSize, key);
73 int i = binarySearch(mKeys, 0, mSize, key);
84 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
95 int i = binarySearch(mKeys, 0, mSize, key);
102 if (mSize >= mKeys.length) {
108 // Log.e("SparseIntArray", "grow " + mKeys.length + " to " + n);
109 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length)
    [all...]
LongSparseArray.java 47 mKeys = new long[initialCapacity];
56 int length = mKeys.length;
58 System.arraycopy(mKeys, 0, result, 0, length);
87 int i = binarySearch(mKeys, 0, mSize, key);
100 int i = binarySearch(mKeys, 0, mSize, key);
122 long[] keys = mKeys;
150 int i = binarySearch(mKeys, 0, mSize, key);
158 mKeys[i] = key;
163 if (mGarbage && mSize >= mKeys.length) {
167 i = ~binarySearch(mKeys, 0, mSize, key)
    [all...]
SparseArray.java 45 mKeys = new int[initialCapacity];
63 int i = binarySearch(mKeys, 0, mSize, key);
76 int i = binarySearch(mKeys, 0, mSize, key);
109 int[] keys = mKeys;
137 int i = binarySearch(mKeys, 0, mSize, key);
145 mKeys[i] = key;
150 if (mGarbage && mSize >= mKeys.length) {
154 i = ~binarySearch(mKeys, 0, mSize, key);
157 if (mSize >= mKeys.length) {
163 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n)
    [all...]
  /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/util/
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.length && (mGarbage || hasReclaimedRefs()))
    [all...]
  /packages/apps/Gallery3D/src/com/cooliris/media/
LongSparseArray.java 51 mKeys = new long[initialCapacity];
70 int i = binarySearch(mKeys, 0, mSize, key);
83 int i = binarySearch(mKeys, 0, mSize, key);
105 long[] keys = mKeys;
132 int i = binarySearch(mKeys, 0, mSize, key);
140 mKeys[i] = key;
145 if (mGarbage && mSize >= mKeys.length) {
149 i = ~binarySearch(mKeys, 0, mSize, key);
152 if (mSize >= mKeys.length) {
158 // Log.e("SparseArray", "grow " + mKeys.length + " to " + n)
    [all...]
  /frameworks/base/tests/CoreTests/android/core/
HashMapPerformanceTest.java 29 public String[] mKeys;
36 mKeys = new String[ITERATIONS];
39 mKeys[i] = Integer.toString(i, 16);
40 mMap.put(mKeys[i], i);
53 num = (Integer) mMap.get(mKeys[i]);
54 num = (Integer) mMap.get(mKeys[i]);
55 num = (Integer) mMap.get(mKeys[i]);
56 num = (Integer) mMap.get(mKeys[i]);
57 num = (Integer) mMap.get(mKeys[i]);
58 num = (Integer) mMap.get(mKeys[i])
    [all...]
PerformanceTests.java 159 private String[] mKeys;
165 mKeys = new String[ITERATIONS];
168 mKeys[i] = Integer.toString(i, 16);
169 mList.add(mKeys[i]);
279 private String[] mKeys;
284 mKeys = new String[ITERATIONS];
287 mKeys[i] = Integer.toString(i, 16);
288 mMap.put(mKeys[i], i);
302 mMap.containsKey(mKeys[i]);
317 String[] keys = mKeys;
    [all...]
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
KeyDetector.java 28 private Key[] mKeys;
46 mKeys = array;
59 if (mKeys == null)
61 // mKeyboard is guaranteed not to be null at setKeybaord() method if mKeys is not null
62 return mKeys;
PointerTracker.java 57 private Key[] mKeys;
193 mKeys = keys;
204 return keyIndex >= 0 && keyIndex < mKeys.length;
208 return isValidKeyIndex(keyIndex) ? mKeys[keyIndex] : null;
242 mKeys[oldKeyIndex].onReleased(inside);
243 mProxy.invalidateKey(mKeys[oldKeyIndex]);
246 mKeys[keyIndex].onPressed();
247 mProxy.invalidateKey(mKeys[keyIndex]);
286 mListener.onPress(mKeys[keyIndex].codes[0]);
297 if (mKeys[keyIndex].repeatable)
    [all...]
LatinKeyboardBaseView.java 185 private Key[] mKeys;
600 mKeys = mKeyDetector.setKeyboard(keyboard, -getPaddingLeft(),
604 tracker.setKeyboard(mKeys, mKeyHysteresisDistance);
749 final Key[] keys = mKeys;
801 final Key[] keys = mKeys;
    [all...]
  /frameworks/base/core/java/android/inputmethodservice/
KeyboardView.java 156 private Key[] mKeys;
452 mKeys = keys.toArray(new Key[keys.size()]);
592 final Key[] keys = mKeys;
645 final Key[] keys = mKeys;
736 final Key[] keys = mKeys;
787 if (index != NOT_A_KEY && index < mKeys.length) {
788 final Key key = mKeys[index];
835 final Key[] keys = mKeys;
    [all...]
Keyboard.java 121 private List<Key> mKeys;
525 mKeys = new ArrayList<Key>();
575 mKeys.add(key);
584 return mKeys;
659 int[] indices = new int[mKeys.size()];
665 for (int i = 0; i < mKeys.size(); i++) {
666 final Key key = mKeys.get(i);
738 mKeys.add(key);
741 mShiftKeyIndex = mKeys.size()-1;

Completed in 636 milliseconds