58 lines
1.9 KiB
Java
58 lines
1.9 KiB
Java
// collectiontopics/ListSortSearch.java
|
|
// (c)2020 MindView LLC: see Copyright.txt
|
|
// We make no guarantees that this code is fit for any purpose.
|
|
// Visit http://OnJava8.com for more book information.
|
|
// Sorting/searching Lists with Collections utilities
|
|
import java.util.*;
|
|
|
|
public class ListSortSearch {
|
|
public static void main(String[] args) {
|
|
List<String> list =
|
|
new ArrayList<>(Utilities.list);
|
|
list.addAll(Utilities.list);
|
|
System.out.println(list);
|
|
Collections.shuffle(list, new Random(47));
|
|
System.out.println("Shuffled: " + list);
|
|
// Use ListIterator to trim off last elements:
|
|
ListIterator<String> it = list.listIterator(10);
|
|
while(it.hasNext()) {
|
|
it.next();
|
|
it.remove();
|
|
}
|
|
System.out.println("Trimmed: " + list);
|
|
Collections.sort(list);
|
|
System.out.println("Sorted: " + list);
|
|
String key = list.get(7);
|
|
int index = Collections.binarySearch(list, key);
|
|
System.out.println(
|
|
"Location of " + key + " is " + index +
|
|
", list.get(" + index + ") = " +
|
|
list.get(index));
|
|
Collections.sort(list,
|
|
String.CASE_INSENSITIVE_ORDER);
|
|
System.out.println(
|
|
"Case-insensitive sorted: " + list);
|
|
key = list.get(7);
|
|
index = Collections.binarySearch(list, key,
|
|
String.CASE_INSENSITIVE_ORDER);
|
|
System.out.println(
|
|
"Location of " + key + " is " + index +
|
|
", list.get(" + index + ") = " +
|
|
list.get(index));
|
|
}
|
|
}
|
|
/* Output:
|
|
[one, Two, three, Four, five, six, one, one, Two,
|
|
three, Four, five, six, one]
|
|
Shuffled: [Four, five, one, one, Two, six, six, three,
|
|
three, five, Four, Two, one, one]
|
|
Trimmed: [Four, five, one, one, Two, six, six, three,
|
|
three, five]
|
|
Sorted: [Four, Two, five, five, one, one, six, six,
|
|
three, three]
|
|
Location of six is 7, list.get(7) = six
|
|
Case-insensitive sorted: [five, five, Four, one, one,
|
|
six, six, three, three, Two]
|
|
Location of three is 7, list.get(7) = three
|
|
*/
|