Repository navigation
Expand file tree
/
Copy pathMain.java
More file actions
82 lines (66 loc) · 3.29 KB
/
Copy pathMain.java
File metadata and controls
82 lines (66 loc) · 3.29 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
package modern.challenge;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Random;
import java.util.Set;
import java.util.TreeSet;
import java.util.stream.Collectors;
public class Main {
public static void main(String[] args) {
List<Melon> melons = Arrays.asList(new Melon("Crenshaw", 2000),
new Melon("Hemi", 1600), new Melon("Gac", 3000),
new Melon("Apollo", 2000), new Melon("Horned", 1700),
new Melon("Gac", 3000), new Melon("Cantaloupe", 2600)
);
List<Integer> resultToList1 = melons.stream()
.map(Melon::getWeight)
.filter(x -> x >= 1000)
.collect(Collectors.toList());
List<Integer> resultToList2 = melons.stream()
.map(Melon::getWeight)
.filter(x -> x >= 1000)
.collect(Collectors.toCollection(ArrayList::new));
System.out.println("\nCollect via toList():\n" + resultToList1);
System.out.println("\nCollect via toCollection to ArrayList:\n" + resultToList2);
Set<Integer> resultToSet1 = melons.stream()
.map(Melon::getWeight)
.filter(x -> x >= 1000)
.collect(Collectors.toSet());
Set<Integer> resultToSet2 = melons.stream()
.map(Melon::getWeight)
.filter(x -> x >= 1000)
.collect(Collectors.toCollection(HashSet::new));
Set<Integer> resultToSet3 = melons.stream()
.map(Melon::getWeight)
.filter(x -> x >= 1000)
.collect(Collectors.toCollection(TreeSet::new));
System.out.println("\nCollect via toSet():\n" + resultToSet1);
System.out.println("\nCollect via toCollection() to HashSet:\n" + resultToSet2);
System.out.println("\nCollect via toCollection() to TreeSet:\n" + resultToSet3);
Map<String, Integer> resultToMap1 = melons.stream()
.distinct()
.collect(Collectors.toMap(Melon::getType, Melon::getWeight));
Map<Integer, Integer> resultToMap2 = melons.stream()
.distinct()
.map(x -> Map.entry(new Random().nextInt(Integer.MAX_VALUE), x.getWeight()))
.collect(Collectors.toMap(Entry::getKey, Entry::getValue));
Map<String, Integer> resultToMap3 = melons.stream()
.collect(Collectors.toMap(Melon::getType, Melon::getWeight,
(oldValue, newValue) -> oldValue));
Map<String, Integer> resultToMap4 = melons.stream()
.sorted(Comparator.comparingInt(Melon::getWeight))
.collect(Collectors.toMap(Melon::getType, Melon::getWeight,
(oldValue, newValue) -> oldValue,
LinkedHashMap::new));
System.out.println("\nCollect via toMap():\n" + resultToMap1);
System.out.println("\nCollect via toMap() with random keys:\n" + resultToMap2);
System.out.println("\nCollect via toMap() with old key in case of collision:\n" + resultToMap3);
System.out.println("\nCollect via toMap() sorted:\n" + resultToMap4);
}
}