diff options
| author | Dianne Hackborn <hackbod@google.com> | 2013-07-12 17:46:45 -0700 |
|---|---|---|
| committer | Dianne Hackborn <hackbod@google.com> | 2013-07-12 18:05:37 -0700 |
| commit | b993f41eb2f165425dfdf0f93ea0b1e354eca837 (patch) | |
| tree | 7d505884a332ae0974b2b8f10d6e091cb865c159 /core/java/android/util/ArrayMap.java | |
| parent | 46db67cf7f974d4918c5c73ffc41d7058b74ccf0 (diff) | |
Update SparseArray docs to be more informative.
Change-Id: I5d8d17d46a69ccdcf6b29f93be3d44addd80ab61
Diffstat (limited to 'core/java/android/util/ArrayMap.java')
| -rw-r--r-- | core/java/android/util/ArrayMap.java | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/core/java/android/util/ArrayMap.java b/core/java/android/util/ArrayMap.java index 26bcce499348..18534c6907b7 100644 --- a/core/java/android/util/ArrayMap.java +++ b/core/java/android/util/ArrayMap.java @@ -34,8 +34,7 @@ import java.util.Set; * that may contain large numbers of items. It is generally slower than a traditional * HashMap, since lookups require a binary search and adds and removes require inserting * and deleting entries in the array. For containers holding up to hundreds of items, - * the performance difference is not significant, less than 50%. For larger numbers of items - * this data structure should be avoided.</p> + * the performance difference is not significant, less than 50%.</p> * * <p><b>Note:</b> unlike {@link java.util.HashMap}, this container does not support * null keys.</p> @@ -44,7 +43,7 @@ import java.util.Set; * standard Java containers it will shrink its array as items are removed from it. Currently * you have no control over this shrinking -- if you set a capacity and then remove an * item, it may reduce the capacity to better match the current size. In the future an - * explicitly call to set the capacity should turn off this aggressive shrinking behavior.</p> + * explicit call to set the capacity should turn off this aggressive shrinking behavior.</p> * * @hide */ |