Lines Matching refs:keys
25 * auto-boxing keys and its data structure doesn't rely on an extra entry object
29 * using a binary search to find keys. The implementation is not intended to be appropriate for
37 * keys: instead of compacting its array immediately, it leaves the removed entry marked
44 * {@link #keyAt(int)} and {@link #valueAt(int)}. Iterating over the keys using
46 * keys in ascending order, or the values corresponding to the keys in ascending
169 int[] keys = mKeys;
177 keys[o] = keys[i];
261 * <p>The keys corresponding to indices in ascending order are guaranteed to
280 * to be associated with keys in ascending order, e.g.,
322 * specified key, or a negative number if no keys map to the
325 * and that multiple keys can map to the same value and this will
359 * the key is greater than all existing keys in the array.