diff options
Diffstat (limited to 'core/java/android/util/SparseArray.java')
| -rw-r--r-- | core/java/android/util/SparseArray.java | 34 |
1 files changed, 32 insertions, 2 deletions
diff --git a/core/java/android/util/SparseArray.java b/core/java/android/util/SparseArray.java index 34e6f04f0404..c76666069d18 100644 --- a/core/java/android/util/SparseArray.java +++ b/core/java/android/util/SparseArray.java @@ -346,10 +346,40 @@ public class SparseArray<E> implements Cloneable { gc(); } - for (int i = 0; i < mSize; i++) - if (mValues[i] == value) + for (int i = 0; i < mSize; i++) { + if (mValues[i] == value) { return i; + } + } + + return -1; + } + + /** + * Returns an index for which {@link #valueAt} would return the + * specified key, or a negative number if no keys map to the + * specified value. + * <p>Beware that this is a linear search, unlike lookups by key, + * and that multiple keys can map to the same value and this will + * find only one of them. + * <p>Note also that this method uses {@code equals} unlike {@code indexOfValue}. + */ + public int indexOfValueByValue(E value) { + if (mGarbage) { + gc(); + } + for (int i = 0; i < mSize; i++) { + if (value == null) { + if (mValues[i] == null) { + return i; + } + } else { + if (value.equals(mValues[i])) { + return i; + } + } + } return -1; } |
