Lines Matching defs:array
42 * Maximum number of entries to have in array caches.
47 * Caches of small array objects to avoid spamming garbage. The cache
48 * Object[] variable is a pointer to a linked list of array objects.
49 * The first entry in the array is a pointer to the next array in the
50 * list; the second entry is a pointer to the int[] hash code array for it.
94 // hash chain to reduce the number of array entries that will
132 // hash chain to reduce the number of array entries that will
141 final Object[] array = mTwiceBaseCache;
142 mArray = array;
143 mTwiceBaseCache = (Object[])array[0];
144 mHashes = (int[])array[1];
145 array[0] = array[1] = null;
155 final Object[] array = mBaseCache;
156 mArray = array;
157 mBaseCache = (Object[])array[0];
158 mHashes = (int[])array[1];
159 array[0] = array[1] = null;
172 private static void freeArrays(final int[] hashes, final Object[] array, final int size) {
176 array[0] = mTwiceBaseCache;
177 array[1] = hashes;
179 array[i] = null;
181 mTwiceBaseCache = array;
183 if (DEBUG) Log.d(TAG, "Storing 2x cache " + array
190 array[0] = mBaseCache;
191 array[1] = hashes;
193 array[i] = null;
195 mBaseCache = array;
197 if (DEBUG) Log.d(TAG, "Storing 1x cache " + array
205 * Create a new empty ArrayMap. The default capacity of an array map is 0, and
238 * Make the array map empty. All storage is released.
250 * Ensure the array map can hold at least <var>minimumCapacity</var>
267 * Check whether a key exists in the array.
288 final Object[] array = mArray;
291 if (array[i] == null) {
297 if (value.equals(array[i])) {
306 * Check whether a value exists in the array. This requires a linear search
307 * through the entire array.
317 * Retrieve a value from the array.
328 * Return the key at the given index in the array.
337 * Return the value at the given index in the array.
346 * Set the value at a given index in the array.
359 * Return true if the array map contains no items.
366 * Add a new value to the array map.
368 * this key already exists in the array, its value will be replaced.
425 * Perform a {@link #put(Object, Object)} of all key/value pairs in <var>array</var>
426 * @param array The array whose contents are to be retrieved.
428 public void putAll(SimpleArrayMap<? extends K, ? extends V> array) {
429 final int N = array.mSize;
433 System.arraycopy(array.mHashes, 0, mHashes, 0, N);
434 System.arraycopy(array.mArray, 0, mArray, 0, N<<1);
439 put(array.keyAt(i), array.valueAt(i));
445 * Remove an existing key from the array map.
516 * Return the number of items in this array map.
570 final Object[] array = mArray;
573 Object value = array[v];