| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| TreeSetTest.java | 26 import java.util.TreeSet;
40 TreeSet ts;
45 * @tests java.util.TreeSet#TreeSet()
48 // Test for method java.util.TreeSet()
49 assertTrue("Did not construct correct TreeSet", new TreeSet().isEmpty());
53 * @tests java.util.TreeSet#TreeSet(java.util.Collection)
56 // Test for method java.util.TreeSet(java.util.Collection
[all...] |
| PriorityQueueTest.java | 28 import java.util.TreeSet;
333 TreeSet<Integer> treeSet = new TreeSet<Integer>(new MockComparator<Integer>());
335 treeSet.add(array[i]);
337 Collection<? extends Integer> c = treeSet;
339 assertEquals(treeSet.comparator(), queue.comparator());
340 Iterator<Integer> iter = treeSet.iterator();
385 TreeSet<Integer> treeSet = new TreeSet<Integer>()
[all...] |
| /development/tools/mkstubs/src/com/android/mkstubs/ |
| Filter.java | 19 import java.util.TreeSet;
33 private TreeSet<String> mIncludePrefix = new TreeSet<String>();
34 private TreeSet<String> mIncludeFull = new TreeSet<String>();
35 private TreeSet<String> mExcludePrefix = new TreeSet<String>();
36 private TreeSet<String> mExcludeFull = new TreeSet<String>();
41 public TreeSet<String> getIncludeFull()
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| TreeSetTest.java | 21 import java.util.TreeSet;
30 TreeSet<String> set = new TreeSet<String>();
31 new SerializationTester<TreeSet<String>>(set, s).test();
39 TreeSet<String> set = new TreeSet<String>(String.CASE_INSENSITIVE_ORDER);
54 TreeSet<String> set = new TreeSet<String>(String.CASE_INSENSITIVE_ORDER);
72 TreeSet<String> set = new TreeSet<String>(String.CASE_INSENSITIVE_ORDER)
[all...] |
| OldTreeSetTest.java | 27 import java.util.TreeSet;
31 TreeSet ts;
36 // Test for method java.util.TreeSet(java.util.Collection)
37 TreeSet myTreeSet = new TreeSet(Arrays.asList(objArray));
38 assertTrue("TreeSet incorrect size",
41 assertTrue("TreeSet does not contain correct elements", myTreeSet
49 new TreeSet(hm.values());
56 new TreeSet((Collection)null);
65 new TreeSet((SortedSet)null)
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| TreeSet.java | 26 * TreeSet is an implementation of SortedSet. All optional operations (adding
33 public class TreeSet<E> extends AbstractSet<E> implements NavigableSet<E>,
43 TreeSet(NavigableMap<E, Object> map) {
48 * Constructs a new empty instance of {@code TreeSet} which uses natural
51 public TreeSet() {
56 * Constructs a new instance of {@code TreeSet} which uses natural ordering
66 public TreeSet(Collection<? extends E> collection) {
72 * Constructs a new empty instance of {@code TreeSet} which uses the
78 public TreeSet(Comparator<? super E> comparator) {
83 * Constructs a new instance of {@code TreeSet} containing the elements o
[all...] |
| /frameworks/base/docs/html/sdk/api_diff/9/changes/ |
| java.util.TreeSet.html | 10 java.util.TreeSet
74 Class java.util.<A HREF="../../../../reference/java/util/TreeSet.html" target="_top"><font size="+2"><code>TreeSet</code></font></A>
87 <A NAME="java.util.TreeSet.ceiling_added(E)"></A>
88 <nobr><code>E</code> <A HREF="../../../../reference/java/util/TreeSet.html#ceiling(E)" target="_top"><code>ceiling</code></A>(<code>E</code>)</nobr>
94 <A NAME="java.util.TreeSet.descendingIterator_added()"></A>
95 <nobr><code>Iterator<E></code> <A HREF="../../../../reference/java/util/TreeSet.html#descendingIterator()" target="_top"><code>descendingIterator</code></A>()</nobr>
101 <A NAME="java.util.TreeSet.descendingSet_added()"></A>
102 <nobr><code>NavigableSet<E></code> <A HREF="../../../../reference/java/util/TreeSet.html#descendingSet()" target="_top"><code>descendingSet</code></A>()</nobr>
108 <A NAME="java.util.TreeSet.floor_added(E)"></A
[all...] |
| /external/doclava/src/com/google/doclava/ |
| Hierarchy.java | 22 import java.util.TreeSet;
27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>();
32 TreeSet<String> me = nodes.get(name);
34 me = new TreeSet<String>();
41 TreeSet<String> s = nodes.get(sname);
43 s = new TreeSet<String>();
53 * TreeSet<String> values = nodes.get(n); for (String v: values) {
76 private static int depth(HashMap<String, TreeSet<String>> nodes, String name) {
78 TreeSet<String> derived = nodes.get(name)
[all...] |
| SampleCode.java | 72 TreeSet<String> dirs = new TreeSet<String>();
73 TreeSet<String> files = new TreeSet<String>();
|
| /packages/apps/Settings/src/com/android/settings/inputmethod/ |
| UserDictionaryList.java | 32 import java.util.TreeSet;
45 static TreeSet<String> getUserDictionaryLocalesSet(Activity activity) {
50 final TreeSet<String> localeList = new TreeSet<String>();
72 final TreeSet<String> localeList =
|
| /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| AttributedStringTest.java | 24 import java.util.TreeSet;
146 as.addAttribute(null, new TreeSet(), 0, 1);
153 as.addAttribute(null, new TreeSet(), -1, 1);
167 as.addAttribute(null, new TreeSet());
|
| /external/libphonenumber/java/src/com/android/i18n/phonenumbers/geocoding/ |
| AreaCodeMapStorageStrategy.java | 23 import java.util.TreeSet;
34 protected final TreeSet<Integer> possibleLengths = new TreeSet<Integer>();
91 public TreeSet<Integer> getPossibleLengths() {
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| SafeTreeSet.java | 25 import java.util.TreeSet;
28 * A wrapper around {@code TreeSet} that aggressively checks to see if elements
44 this(new TreeSet<E>());
48 this(new TreeSet<E>(collection));
52 this(new TreeSet<E>(comparator));
56 this(new TreeSet<E>(set));
|
| TestsForSetsInJavaUtil.java | 37 import java.util.TreeSet;
191 return new TreeSet<String>(MinimalCollection.of(elements));
194 .named("TreeSet, natural")
208 = new TreeSet<String>(arbitraryNullFriendlyComparator());
213 .named("TreeSet, with comparator")
|
| /frameworks/base/core/java/com/google/android/collect/ |
| Sets.java | 23 import java.util.TreeSet;
77 return new TreeSet<E>();
88 SortedSet<E> set = new TreeSet<E>();
|
| /development/tools/idegen/src/ |
| Main.java | 29 import java.util.TreeSet;
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeMultimap.java | 28 import java.util.TreeSet;
124 * <p>Creates an empty {@code TreeSet} for a collection of values for one key.
126 * @return a new {@code TreeSet} containing a collection of values for one
130 return new TreeSet<V>(valueComparator);
|
| /frameworks/base/tools/preload/ |
| PrintHtmlDiff.java | 22 import java.util.TreeSet;
52 Set<LoadedClass> removed = new TreeSet<LoadedClass>();
53 Set<LoadedClass> added = new TreeSet<LoadedClass>();
106 Set<String> procNames = new TreeSet<String>();
|
| PrintCsv.java | 25 import java.util.TreeSet;
82 Set<String> procNames = new TreeSet<String>();
|
| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/cert/ |
| X509CRLSelectorTest.java | 27 import java.util.TreeSet;
124 selector.setIssuerNames(new TreeSet() {
|
| /external/apache-harmony/support/src/test/java/tests/support/ |
| Support_CollectionTest.java | 21 import java.util.TreeSet;
44 Collection<Integer> myCollection = new TreeSet<Integer>();
|
| Support_UnmodifiableCollectionTest.java | 24 import java.util.TreeSet;
73 SortedSet<Integer> ss = new TreeSet<Integer>();
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| ContiguousSetNonGwtTest.java | 37 import java.util.TreeSet;
56 SortedSet<Integer> set = new TreeSet<Integer>();
|
| /libcore/luni/src/test/java/tests/security/cert/ |
| X509CRLSelectorTest.java | 30 import java.util.TreeSet;
119 selector.setIssuerNames(new TreeSet<Comparable>() {
|
| /libcore/support/src/test/java/tests/support/ |
| Support_CollectionTest.java | 21 import java.util.TreeSet;
43 Collection<Integer> myCollection = new TreeSet<Integer>();
|
