Home
last modified time | relevance | path

Searched refs:mKeys (Results 1 – 4 of 4) sorted by relevance

/external/smali/util/src/main/java/org/jf/util/
DSparseArray.java60 mKeys = new int[initialCapacity]; in SparseArray()
78 int i = binarySearch(mKeys, 0, mSize, key); in get()
91 int i = binarySearch(mKeys, 0, mSize, key); in delete()
113 int[] keys = mKeys; in gc()
141 int i = binarySearch(mKeys, 0, mSize, key); in put()
149 mKeys[i] = key; in put()
154 if (mGarbage && mSize >= mKeys.length) { in put()
158 i = ~binarySearch(mKeys, 0, mSize, key); in put()
161 if (mSize >= mKeys.length) { in put()
162 int n = Math.max(mSize + 1, mKeys.length * 2); in put()
[all …]
DSparseIntArray.java53 mKeys = new int[initialCapacity]; in SparseIntArray()
71 int i = binarySearch(mKeys, 0, mSize, key); in get()
85 int i = binarySearch(mKeys, 0, mSize, key); in getClosestSmaller()
102 int i = binarySearch(mKeys, 0, mSize, key); in delete()
113 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1)); in removeAt()
124 int i = binarySearch(mKeys, 0, mSize, key); in put()
131 if (mSize >= mKeys.length) { in put()
132 int n = Math.max(mSize + 1, mKeys.length * 2); in put()
138 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length); in put()
141 mKeys = nkeys; in put()
[all …]
/external/replicaisland/src/com/replica/replicaisland/
DInputKeyboard.java24 private InputButton[] mKeys; field in InputKeyboard
28 mKeys = new InputButton[count]; in InputKeyboard()
30 mKeys[x] = new InputButton(); in InputKeyboard()
35 assert keycode >= 0 && keycode < mKeys.length; in press()
36 if (keycode >= 0 && keycode < mKeys.length){ in press()
37 mKeys[keycode].press(currentTime, 1.0f); in press()
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 …]
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/
DShadowSparseArray.java60 mKeys = new int[initialCapacity]; in __constructor__()
82 int i = binarySearch(mKeys, 0, mSize, key); in get()
97 int i = binarySearch(mKeys, 0, mSize, key); in delete()
120 int[] keys = mKeys; in gc()
149 int i = binarySearch(mKeys, 0, mSize, key); in put()
157 mKeys[i] = key; in put()
162 if (mGarbage && mSize >= mKeys.length) { in put()
166 i = ~binarySearch(mKeys, 0, mSize, key); in put()
169 if (mSize >= mKeys.length) { in put()
176 System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length); in put()
[all …]