| 1 |
import java.util.ArrayList; |
| 2 |
import java.util.HashSet; |
| 3 |
import java.util.List; |
| 4 |
import java.util.Set; |
| 5 |
|
| 6 |
public class ForEach { |
| 7 |
void m1() { |
| 8 |
Set<? extends CharSequence> s = new HashSet<CharSequence>(); |
| 9 |
for (CharSequence cs : s) { |
| 10 |
cs.toString(); |
| 11 |
} |
| 12 |
} |
| 13 |
|
| 14 |
void m2() { |
| 15 |
Set<CharSequence> s = new HashSet<>(); |
| 16 |
for (CharSequence cs : s) { |
| 17 |
cs.toString(); |
| 18 |
} |
| 19 |
} |
| 20 |
|
| 21 |
<T extends Object> void m3(T p) { |
| 22 |
Set<T> s = new HashSet<>(); |
| 23 |
for (T cs : s) { |
| 24 |
cs.toString(); |
| 25 |
} |
| 26 |
} |
| 27 |
|
| 28 |
<T extends Object> void m4(T p) { |
| 29 |
Set<T> s = new HashSet<>(); |
| 30 |
for (Object cs : s) { |
| 31 |
cs.toString(); |
| 32 |
} |
| 33 |
} |
| 34 |
|
| 35 |
public static <T extends Object> List<T> removeDuplicates(List<T> l) { |
| 36 |
// There are shorter solutions that do not maintain order. |
| 37 |
HashSet<T> hs = new HashSet<>(l.size()); |
| 38 |
List<T> result = new ArrayList<>(); |
| 39 |
for (T t : l) { |
| 40 |
if (hs.add(t)) { |
| 41 |
result.add(t); |
| 42 |
} |
| 43 |
} |
| 44 |
return result; |
| 45 |
} |
| 46 |
} |