40 lines
1.0 KiB
Java
40 lines
1.0 KiB
Java
|
//: containersindepth/SortedSetDemo.java
|
|||
|
|
// <20>2015 MindView LLC: see Copyright.txt
|
|||
|
|
// What you can do with a TreeSet.
|
|||
|
|
import java.util.*;
|
|||
|
|
import static com.mindviewinc.util.Print.*;
|
|||
|
|
|
|||
|
|
public class SortedSetDemo {
|
|||
|
|
public static void main(String[] args) {
|
|||
|
|
SortedSet<String> sortedSet = new TreeSet<>();
|
|||
|
|
Collections.addAll(sortedSet,
|
|||
|
|
"one two three four five six seven eight"
|
|||
|
|
.split(" "));
|
|||
|
|
print(sortedSet);
|
|||
|
|
String low = sortedSet.first();
|
|||
|
|
String high = sortedSet.last();
|
|||
|
|
print(low);
|
|||
|
|
print(high);
|
|||
|
|
Iterator<String> it = sortedSet.iterator();
|
|||
|
|
for(int i = 0; i <= 6; i++) {
|
|||
|
|
if(i == 3) low = it.next();
|
|||
|
|
if(i == 6) high = it.next();
|
|||
|
|
else it.next();
|
|||
|
|
}
|
|||
|
|
print(low);
|
|||
|
|
print(high);
|
|||
|
|
print(sortedSet.subSet(low, high));
|
|||
|
|
print(sortedSet.headSet(high));
|
|||
|
|
print(sortedSet.tailSet(low));
|
|||
|
|
}
|
|||
|
|
} /* Output:
|
|||
|
|
[eight, five, four, one, seven, six, three, two]
|
|||
|
|
eight
|
|||
|
|
two
|
|||
|
|
one
|
|||
|
|
two
|
|||
|
|
[one, seven, six, three]
|
|||
|
|
[eight, five, four, one, seven, six, three]
|
|||
|
|
[one, seven, six, three, two]
|
|||
|
|
*///:~
|