Home
last modified time | relevance | path

Searched refs:TreeSet (Results 1 – 25 of 69) sorted by relevance

123

/libcore/luni/src/test/java/libcore/java/util/
DTreeSetTest.java23 import java.util.TreeSet;
32 TreeSet<String> set = new TreeSet<String>(); in testEmptySetSerialization()
33 new SerializationTester<TreeSet<String>>(set, s).test(); in testEmptySetSerialization()
41 TreeSet<String> set = new TreeSet<String>(String.CASE_INSENSITIVE_ORDER); in testSerializationWithComparator()
56 TreeSet<String> set = new TreeSet<String>(String.CASE_INSENSITIVE_ORDER); in testSubSetSerialization()
74 TreeSet<String> set = new TreeSet<String>(String.CASE_INSENSITIVE_ORDER); in testNavigableSubSetSerialization()
113 TreeSet<String> set = new TreeSet<String>(); in testDescendingSetSerialization()
129 TreeSet<String> set = new TreeSet<String>(String.CASE_INSENSITIVE_ORDER); in testJava5SerializationWithComparator()
132 new SerializationTester<TreeSet<String>>(set, s) { in testJava5SerializationWithComparator()
133 @Override protected void verify(TreeSet<String> deserialized) { in testJava5SerializationWithComparator()
[all …]
DOldTreeSetTest.java27 import java.util.TreeSet;
31 TreeSet ts;
37 TreeSet myTreeSet = new TreeSet(Arrays.asList(objArray)); in test_ConstructorLjava_util_Collection()
49 new TreeSet(hm.values()); in test_ConstructorLjava_util_Collection()
56 new TreeSet((Collection)null); in test_ConstructorLjava_util_Collection()
65 new TreeSet((SortedSet)null); in test_ConstructorLjava_util_SortedSet()
94 TreeSet s = new TreeSet(); in test_addAllLjava_util_Collection()
125 ts = new TreeSet(); in test_first()
170 ts = new TreeSet(); in test_last()
257 ts = new TreeSet(); in setUp()
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DTreeSetTest.java32 import java.util.TreeSet;
46 TreeSet ts;
55 assertTrue("Did not construct correct TreeSet", new TreeSet().isEmpty()); in test_Constructor()
63 TreeSet myTreeSet = new TreeSet(Arrays.asList(objArray)); in test_ConstructorLjava_util_Collection()
76 TreeSet myTreeSet = new TreeSet(new ReversedIntegerComparator()); in test_ConstructorLjava_util_Comparator()
94 TreeSet myTreeSet = new TreeSet(comp); in test_ConstructorLjava_util_SortedSet()
97 TreeSet anotherTreeSet = new TreeSet(myTreeSet); in test_ConstructorLjava_util_SortedSet()
127 TreeSet s = new TreeSet(); in test_addAllLjava_util_Collection()
151 TreeSet s = (TreeSet) ts.clone(); in test_clone()
164 TreeSet myTreeSet = new TreeSet(comp); in test_comparator()
[all …]
/libcore/ojluni/src/test/java/util/concurrent/tck/
DTreeSetTest.java45 import java.util.TreeSet;
73 private TreeSet<Integer> populatedSet(int n) { in populatedSet()
74 TreeSet<Integer> q = new TreeSet<>(); in populatedSet()
88 private TreeSet set5() { in set5()
89 TreeSet q = new TreeSet(); in set5()
104 assertEquals(0, new TreeSet().size()); in testConstructor1()
112 new TreeSet((Collection)null); in testConstructor3()
122 new TreeSet(Arrays.asList(new Integer[SIZE])); in testConstructor4()
135 new TreeSet(Arrays.asList(ints)); in testConstructor5()
147 TreeSet q = new TreeSet(Arrays.asList(ints)); in testConstructor6()
[all …]
/libcore/jsr166-tests/src/test/java/jsr166/
DTreeSetTest.java19 import java.util.TreeSet;
50 private TreeSet<Integer> populatedSet(int n) { in populatedSet()
51 TreeSet<Integer> q = new TreeSet<Integer>(); in populatedSet()
65 private TreeSet set5() { in set5()
66 TreeSet q = new TreeSet(); in set5()
81 assertEquals(0, new TreeSet().size()); in testConstructor1()
89 new TreeSet((Collection)null); in testConstructor3()
99 new TreeSet(Arrays.asList(new Integer[SIZE])); in testConstructor4()
112 new TreeSet(Arrays.asList(ints)); in testConstructor5()
124 TreeSet q = new TreeSet(Arrays.asList(ints)); in testConstructor6()
[all …]
/libcore/ojluni/src/main/java/java/util/
DTreeSet.java96 public class TreeSet<E> extends AbstractSet<E> class
110 TreeSet(NavigableMap<E,Object> m) { in TreeSet() method in TreeSet
127 public TreeSet() { in TreeSet() method in TreeSet
144 public TreeSet(Comparator<? super E> comparator) { in TreeSet() method in TreeSet
162 public TreeSet(Collection<? extends E> c) { in TreeSet() method in TreeSet
174 public TreeSet(SortedSet<E> s) { in TreeSet() method in TreeSet
202 return new TreeSet<>(m.descendingMap()); in descendingSet()
326 return new TreeSet<>(m.subMap(fromElement, fromInclusive, in subSet()
339 return new TreeSet<>(m.headMap(toElement, inclusive)); in headSet()
351 return new TreeSet<>(m.tailMap(fromElement, inclusive)); in tailSet()
[all …]
/libcore/ojluni/src/test/java/util/Collections/
DSyncSubMutexes.java184 instances.add(new Object[] {Collections.synchronizedSet(new TreeSet<>(BASE_COLLECTION))}); in makeSets()
191 … instances.add(new Object[] {Collections.synchronizedSortedSet(new TreeSet<>(BASE_COLLECTION))}); in makeSortedSets()
192 …instances.add(new Object[] {Collections.synchronizedSortedSet(new TreeSet<>(BASE_COLLECTION)).head… in makeSortedSets()
193 …instances.add(new Object[] {Collections.synchronizedSortedSet(new TreeSet<>(BASE_COLLECTION)).tail… in makeSortedSets()
194 …instances.add(new Object[] {Collections.synchronizedSortedSet(new TreeSet<>(BASE_COLLECTION)).subS… in makeSortedSets()
203 …instances.add(new Object[] {Collections.synchronizedNavigableSet(new TreeSet<>(BASE_COLLECTION))}); in makeNavigableSets()
204 …instances.add(new Object[] {Collections.synchronizedNavigableSet(new TreeSet<>(BASE_COLLECTION)).d… in makeNavigableSets()
205 …instances.add(new Object[] {Collections.synchronizedNavigableSet(new TreeSet<>(BASE_COLLECTION)).h… in makeNavigableSets()
206 …instances.add(new Object[] {Collections.synchronizedNavigableSet(new TreeSet<>(BASE_COLLECTION)).h… in makeNavigableSets()
207 …instances.add(new Object[] {Collections.synchronizedNavigableSet(new TreeSet<>(BASE_COLLECTION)).t… in makeNavigableSets()
[all …]
DCheckedSetBash.java47 import java.util.TreeSet;
170 … (Supplier) () -> Collections.checkedSet(new TreeSet(Collections.reverseOrder()), Integer.class)}, in makeCheckedSets()
172 (Supplier) () -> Collections.checkedSet(new TreeSet().descendingSet(), Integer.class)}, in makeCheckedSets()
174 (Supplier) () -> Collections.checkedNavigableSet(new TreeSet(), Integer.class)}, in makeCheckedSets()
176 …(Supplier) () -> Collections.checkedNavigableSet(new TreeSet(Collections.reverseOrder()), Integer.… in makeCheckedSets()
178 … (Supplier) () -> Collections.checkedNavigableSet(new TreeSet().descendingSet(), Integer.class)}, in makeCheckedSets()
DWrappedUnmodifiableCollections.java67 List<Set<?>> sets = List.of(new TreeSet<>(), in testUnmodifiableSetsDontWrap()
75 TreeSet<?> treeSet = new TreeSet<>(); in testUnmodifiableSetsDontWrap()
DWrappedNull.java42 import java.util.TreeSet;
183 SortedSet ss = Collections.unmodifiableSortedSet(new TreeSet()); in main()
190 ss = Collections.synchronizedSortedSet(new TreeSet()); in main()
DEmptyNavigableSet.java47 import java.util.TreeSet;
156 TreeSet treeSet = new TreeSet(); in testContainsAll()
385 …Object[]{"UnmodifiableNavigableSet(TreeSet)", Collections.unmodifiableNavigableSet(new TreeSet())}, in makeNavigableSets()
386 …leSet(TreeSet.descendingSet()", Collections.unmodifiableNavigableSet(new TreeSet().descendingSet()… in makeNavigableSets()
387 …scendingSet().descendingSet()", Collections.unmodifiableNavigableSet(new TreeSet().descendingSet()… in makeNavigableSets()
/libcore/ojluni/annotations/flagged_api/java/util/
DTreeSet.annotated.java30 public class TreeSet<E> extends java.util.AbstractSet<E> implements java.util.NavigableSet<E>, java… class
32 public TreeSet() { throw new RuntimeException("Stub!"); } in TreeSet() method in TreeSet
34 public TreeSet(java.util.Comparator<? super E> comparator) { throw new RuntimeException("Stub!"); } in TreeSet() method in TreeSet
36 public TreeSet(java.util.Collection<? extends E> c) { throw new RuntimeException("Stub!"); } in TreeSet() method in TreeSet
38 public TreeSet(java.util.SortedSet<E> s) { throw new RuntimeException("Stub!"); } in TreeSet() method in TreeSet
/libcore/tools/docs/crypto/src/java/libcore/java/security/
DListProviders.java27 import java.util.TreeSet;
50 private static final Set<String> KNOWN_ALIASES = new TreeSet<>(Arrays.asList(
61 private static final Set<String> CIPHER_MODES = new TreeSet<>(Arrays.asList("CBC",
69 private static final Set<String> CIPHER_PADDINGS = new TreeSet<>(Arrays.asList("NoPadding",
87 Set<Provider.Service> services = new TreeSet<>( in main()
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/
DAttributedStringTest.java24 import java.util.TreeSet;
146 as.addAttribute(null, new TreeSet(), 0, 1); in test_addAttributeLjava_text_AttributedCharacterIterator$AttributeLjava_lang_ObjectII()
153 as.addAttribute(null, new TreeSet(), -1, 1); in test_addAttributeLjava_text_AttributedCharacterIterator$AttributeLjava_lang_ObjectII()
167 as.addAttribute(null, new TreeSet()); in test_addAttributeLjava_text_AttributedCharacterIterator$AttributeLjava_lang_Object()
/libcore/ojluni/src/test/java/util/SequencedCollection/
DSimpleSortedSet.java37 set = new TreeSet<E>(); in SimpleSortedSet()
41 set = new TreeSet<>(c); in SimpleSortedSet()
45 set = new TreeSet<>(comparator); in SimpleSortedSet()
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
DCollectorExample.java86 Collector<Widget, ?, TreeSet<Widget>> intoSet = in testSnippet2()
87 Collector.of(TreeSet::new, TreeSet::add, in testSnippet2()
DIntPrimitiveOpsTests.java32 import java.util.TreeSet;
164 TreeSet<Long> longs = new TreeSet<>(); in testSortDistinct()
170 TreeSet<Double> doubles = new TreeSet<>(); in testSortDistinct()
DConcatTest.java38 import java.util.TreeSet;
60 TreeSet<Integer> sortedP1 = new TreeSet<>(part1);
61 TreeSet<Integer> sortedP2 = new TreeSet<>(part2);
/libcore/ojluni/src/test/java/lang/StringBuilder/
DComparison.java28 import java.util.TreeSet;
111 Set<String> sSet = new TreeSet<>(); in constructStringSet()
119 Set<StringBuilder> sbSet = new TreeSet<>(); in constructSBSet()
/libcore/ojluni/src/test/java/lang/StringBuffer/
DComparison.java28 import java.util.TreeSet;
111 Set<String> sSet = new TreeSet<>(); in constructStringSet()
119 Set<StringBuffer> sbSet = new TreeSet<>(); in constructSBSet()
/libcore/tools/crypto/src/java/libcore/java/security/
DProviderOverlap.java25 import java.util.TreeSet;
38 SortedSet<String> overlap = new TreeSet<>(conscrypt); in main()
/libcore/luni/src/test/java/tests/security/cert/
DX509CRLSelectorTest.java30 import java.util.TreeSet;
119 selector.setIssuerNames(new TreeSet<Comparable>() { in test_setIssuerNamesLjava_util_Collection01()
/libcore/luni/src/test/java/libcore/java/util/concurrent/
DConcurrentSkipListSetTest.java28 import java.util.TreeSet;
52 TreeSet treeSet = new TreeSet(); in testConstructorFromSortedSet()
/libcore/support/src/test/java/tests/support/
DSupport_CollectionTest.java21 import java.util.TreeSet;
43 Collection<Integer> myCollection = new TreeSet<Integer>(); in runTest()
DSupport_UnmodifiableCollectionTest.java24 import java.util.TreeSet;
73 SortedSet<Integer> ss = new TreeSet<Integer>(); in runTest()

123