/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/core/java/android/util/ |
LongSparseLongArray.java | 31 private long[] mKeys; 50 mKeys = new long[initialCapacity]; 60 clone.mKeys = mKeys.clone(); 81 int i = Arrays.binarySearch(mKeys, 0, mSize, key); 94 int i = Arrays.binarySearch(mKeys, 0, mSize, key); 105 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1)); 116 int i = Arrays.binarySearch(mKeys, 0, mSize, key); 123 if (mSize >= mKeys.length) [all...] |
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.length + " to " + n) [all...] |
SparseIntArray.java | 28 private int[] mKeys; 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.length) [all...] |
SparseLongArray.java | 28 private int[] mKeys; 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.length) [all...] |
LongSparseArray.java | 30 private long[] mKeys; 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.length) [all...] |
SparseArray.java | 30 private int[] mKeys; 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.length) [all...] |
/external/smali/dexlib/src/main/java/org/jf/dexlib/Util/ |
SparseIntArray.java | 46 mKeys = new int[initialCapacity]; 64 int i = binarySearch(mKeys, 0, mSize, key); 78 int i = binarySearch(mKeys, 0, mSize, key); 95 int i = binarySearch(mKeys, 0, mSize, key); 106 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1)); 117 int i = binarySearch(mKeys, 0, mSize, key); 124 if (mSize >= mKeys.length) { 125 int n = Math.max(mSize + 1, mKeys.length * 2); 130 // Log.e("SparseIntArray", "grow " + mKeys.length + " to " + n) [all...] |
SparseArray.java | 53 mKeys = new int[initialCapacity]; 71 int i = binarySearch(mKeys, 0, mSize, key); 84 int i = binarySearch(mKeys, 0, mSize, key); 106 int[] keys = mKeys; 134 int i = binarySearch(mKeys, 0, mSize, key); 142 mKeys[i] = key; 147 if (mGarbage && mSize >= mKeys.length) { 151 i = ~binarySearch(mKeys, 0, mSize, key); 154 if (mSize >= mKeys.length) { 155 int n = Math.max(mSize + 1, mKeys.length * 2) [all...] |
/external/robolectric/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/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...] |
/frameworks/support/v4/java/android/support/v4/util/ |
LongSparseArray.java | 28 private long[] mKeys; 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.length) [all...] |
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.length + " to " + n) [all...] |
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/research/ |
LogStatement.java | 79 // mKeys stores the names that are the attributes in the output json objects 80 private final String[] mKeys; 88 mKeys = (keys == null) ? NULL_KEYS : keys; 104 return mKeys; 117 * @param values the values corresponding to mKeys 126 if (mKeys.length != values.length) { 129 final int length = mKeys.length; 131 if (mKeys[i].equals(queryKey) && values[i].equals(queryValue)) { 146 * @param values the array of values corresponding to mKeys 154 if (mKeys.length != values.length) [all...] |
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/ |
Keyboard.java | 72 public final Key[] mKeys; 95 mKeys = params.mKeys.toArray(new Key[params.mKeys.size()]); 103 mMostCommonKeyWidth, mMostCommonKeyHeight, mKeys, params.mTouchPositionCorrection); 133 for (final Key key : mKeys) { 149 for (final Key key : mKeys) {
|
MoreKeysDetector.java | 42 for (final Key key : getKeyboard().mKeys) {
|
ProximityInfo.java | 50 private final Key[] mKeys; 72 mKeys = keys; 145 final Key[] keys = mKeys; 243 final Key[] keys = mKeys;
|
/frameworks/base/core/java/android/app/backup/ |
WallpaperBackupHelper.java | 65 String[] mKeys; 81 mKeys = keys; 109 performBackup_checked(oldState, data, newState, mFiles, mKeys); 119 if (isKeyInList(key, mKeys)) {
|
/frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/tablet/ |
TabletTicker.java | 70 private IBinder[] mKeys = new IBinder[QUEUE_LENGTH]; 99 mKeys[mQueuePos] = key; 126 if (mKeys[i] == key) { 128 mKeys[i] = mKeys[i+1]; 131 mKeys[QUEUE_LENGTH-1] = null; 146 mKeys[i] = null; 195 mCurrentKey = mKeys[0]; 202 mKeys[i] = mKeys[i+1] [all...] |
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
KeyboardParams.java | 61 public final TreeSet<Key> mKeys = CollectionUtils.newTreeSet(); // ordered set 80 mKeys.clear(); 89 mKeys.add(key);
|
/frameworks/base/libs/androidfw/ |
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.indexOfKey(keyCode) [all...] |
/development/samples/ApiDemos/src/com/example/android/apis/view/ |
GameControllerInput.java | 206 private final SparseIntArray mKeys; 228 mKeys = new SparseIntArray(); 248 return mKeys.size(); 252 return mKeys.keyAt(keyIndex); 256 return mKeys.valueAt(keyIndex) != 0; 264 mKeys.put(keyCode, 1); 275 int index = mKeys.indexOfKey(keyCode); 278 mKeys.put(keyCode, 0);
|
/packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
KeyboardView.java | 161 private Key[] mKeys; 466 if ((mRepeatKeyIndex != NOT_A_KEY) && (mRepeatKeyIndex < mKeys.length)) { 467 oldRepeatKeyCode = mKeys[mRepeatKeyIndex].codes[0]; 473 mKeys = keys.toArray(new Key[keys.size()]); 483 && (keyIndex < mKeys.length) 484 && (oldRepeatKeyCode == mKeys[keyIndex].codes[0])) { 645 final Key[] keys = mKeys; 696 final Key[] keys = mKeys; 800 final Key[] keys = mKeys; 849 if (index != NOT_A_KEY && index < mKeys.length) [all...] |
Keyboard.java | 138 private List<Key> mKeys; 542 mKeys = new ArrayList<Key>(); 592 mKeys.add(key); 606 return mKeys; 705 int[] indices = new int[mKeys.size()]; 711 for (int i = 0; i < mKeys.size(); i++) { 712 final Key key = mKeys.get(i); 785 mKeys.add(key); 788 mShiftKeyIndex = mKeys.size()-1;
|
/frameworks/base/core/java/android/inputmethodservice/ |
Keyboard.java | 121 private List<Key> mKeys; 170 ArrayList<Key> mKeys = new ArrayList<Key>(); 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...] |