mirror of
https://gitflic.ru/project/openide/openide.git
synced 2026-09-06 21:55:38 +07:00
GitOrigin-RevId: bce3692127bd4115eb81e482ea177b1d2952e46f
57 lines
2.3 KiB
Java
57 lines
2.3 KiB
Java
// "Fix all 'Redundant 'Collection.addAll()' call' problems in file" "true"
|
|
import java.util.*;
|
|
import java.util.concurrent.ConcurrentSkipListMap;
|
|
import java.util.concurrent.PriorityBlockingQueue;
|
|
|
|
public class InheritComparator {
|
|
public static void main(String[] args) {
|
|
SortedSet<String> c1 = new TreeSet<>(Comparator.reverseOrder());
|
|
Collection<String> c2 = new TreeSet<>(Comparator.reverseOrder());
|
|
Collection<String> c3 = new HashSet<>();
|
|
Collection<String> c4 = new PriorityQueue<>();
|
|
Collection<String> c5 = new PriorityBlockingQueue<>();
|
|
|
|
Collection<String> hs1 = new HashSet<>(c1);
|
|
Collection<String> hs2 = new HashSet<>(c2);
|
|
Collection<String> hs3 = new HashSet<>(c3);
|
|
Collection<String> hs4 = new HashSet<>(c4);
|
|
Collection<String> hs5 = new HashSet<>(c5);
|
|
|
|
Collection<String> ts1 = new TreeSet<>();
|
|
ts1.addAll(c1);
|
|
Collection<String> ts2 = new TreeSet<>(c2);
|
|
Collection<String> ts3 = new TreeSet<>(c3);
|
|
Collection<String> ts4 = new TreeSet<>(c4);
|
|
Collection<String> ts5 = new TreeSet<>(c5);
|
|
|
|
Collection<String> pq1 = new PriorityQueue<>();
|
|
pq1.addAll(c1);
|
|
Collection<String> pq2 = new PriorityQueue<>();
|
|
pq2.addAll(c2);
|
|
Collection<String> pq3 = new PriorityQueue<>(c3);
|
|
Collection<String> pq4 = new PriorityQueue<>();
|
|
pq4.addAll(c4);
|
|
Collection<String> pq5 = new PriorityQueue<>(c5);
|
|
|
|
Collection<String> pbq1 = new PriorityBlockingQueue<>();
|
|
pbq1.addAll(c1);
|
|
Collection<String> pbq2 = new PriorityBlockingQueue<>();
|
|
pbq2.addAll(c2);
|
|
Collection<String> pbq3 = new PriorityBlockingQueue<>(c3);
|
|
Collection<String> pbq4 = new PriorityBlockingQueue<>(c4);
|
|
Collection<String> pbq5 = new PriorityBlockingQueue<>();
|
|
pbq5.addAll(c5);
|
|
|
|
SortedMap<String, String> m1 = new TreeMap<>(Comparator.reverseOrder());
|
|
Map<String, String> m2 = new TreeMap<>(Comparator.reverseOrder());
|
|
|
|
Map<String, String> tm1 = new TreeMap<>();
|
|
tm1.putAll(m1);
|
|
Map<String, String> tm2 = new TreeMap<>(m2);
|
|
|
|
Map<String, String> cslm1 = new ConcurrentSkipListMap<>();
|
|
cslm1.putAll(m1);
|
|
Map<String, String> cslm2 = new ConcurrentSkipListMap<>(m2);
|
|
}
|
|
}
|