|
| 1 | +import java.util.ArrayDeque; |
| 2 | +import java.util.ArrayList; |
| 3 | +import java.util.Deque; |
| 4 | +import java.util.LinkedHashMap; |
| 5 | +import java.util.LinkedHashSet; |
| 6 | +import java.util.List; |
| 7 | +import java.util.SequencedCollection; |
| 8 | +import java.util.TreeSet; |
| 9 | +import java.util.function.Consumer; |
| 10 | + |
| 11 | +/** |
| 12 | + * @author https://www.wdbyte.com |
| 13 | + * @date 2023/10/12 |
| 14 | + */ |
| 15 | +public class Jep431SequencedCollection { |
| 16 | + public static void main(String[] args) { |
| 17 | + // JDK 21 之后,为所有元素插入有序集合提供了一致的操作 API |
| 18 | + List<Integer> listTemp = List.of(1, 2, 3, 4, 5); |
| 19 | + |
| 20 | + ArrayList<Integer> list = new ArrayList(listTemp); |
| 21 | + Deque<Integer> deque = new ArrayDeque<>(listTemp); |
| 22 | + LinkedHashSet<Integer> linkedHashSet = new LinkedHashSet<>(listTemp); |
| 23 | + TreeSet<Integer> sortedSet = new TreeSet<>(listTemp); |
| 24 | + LinkedHashMap<Integer, Integer> linkedHashMap = new LinkedHashMap<>(); |
| 25 | + for (int i = 1; i <= 5; i++) { |
| 26 | + linkedHashMap.put(i, i); |
| 27 | + } |
| 28 | + |
| 29 | + // 输出第一个元素 |
| 30 | + System.out.println(list.getFirst()); |
| 31 | + System.out.println(deque.getFirst()); |
| 32 | + System.out.println(linkedHashSet.getFirst()); |
| 33 | + System.out.println(sortedSet.getFirst()); |
| 34 | + System.out.println(linkedHashMap.firstEntry()); |
| 35 | + System.out.println("-----------------------"); |
| 36 | + |
| 37 | + // 输出最后一个元素 |
| 38 | + System.out.println(list.getLast()); |
| 39 | + System.out.println(list.getLast()); |
| 40 | + System.out.println(deque.getLast()); |
| 41 | + System.out.println(sortedSet.getLast()); |
| 42 | + System.out.println(linkedHashMap.lastEntry()); |
| 43 | + System.out.println("-----------------------"); |
| 44 | + |
| 45 | + // 逆序遍历 |
| 46 | + Consumer<SequencedCollection> printFn = s -> { |
| 47 | + // reversed 逆序元素 |
| 48 | + s.reversed().forEach(System.out::print); |
| 49 | + System.out.println(); |
| 50 | + }; |
| 51 | + printFn.accept(list); |
| 52 | + printFn.accept(deque); |
| 53 | + printFn.accept(linkedHashSet); |
| 54 | + printFn.accept(sortedSet); |
| 55 | + // 有序 map 接口是 SequencedMap,上面的 consume类型不适用 |
| 56 | + linkedHashMap.reversed().forEach((k, v) -> { |
| 57 | + System.out.print(k); |
| 58 | + }); |
| 59 | + } |
| 60 | +} |
0 commit comments