-
Notifications
You must be signed in to change notification settings - Fork 1.8k
/
CollectionUtil.java
121 lines (99 loc) · 3.58 KB
/
CollectionUtil.java
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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
package liquibase.util;
import java.util.*;
public class CollectionUtil {
public static <T> Set<Set<T>> powerSet(Collection<T> originalSet) {
Set<Set<T>> sets = new HashSet<>();
if (originalSet.isEmpty()) {
sets.add(new HashSet<T>());
return sets;
}
List<T> list = new ArrayList<>(originalSet);
T head = list.get(0);
Collection<T> rest = list.subList(1, list.size());
for (Set<T> set : powerSet(rest)) {
Set<T> newSet = new HashSet<>();
newSet.add(head);
newSet.addAll(set);
sets.add(newSet);
sets.add(set);
}
return sets;
}
public static <T> List<Map<String, T>> permutations(Map<String, List<T>> parameterValues) {
List<Map<String, T>> list = new ArrayList<>();
if ((parameterValues == null) || parameterValues.isEmpty()) {
return list;
}
permute(new HashMap<String, T>(), new ArrayList<String>(parameterValues.keySet()), parameterValues, list);
return list;
}
private static <T> void permute(Map<String, T> basePermutation, List<String> remainingKeys, Map<String, List<T>> parameterValues, List<Map<String, T>> returnList) {
String thisKey = remainingKeys.get(0);
remainingKeys = remainingKeys.subList(1, remainingKeys.size());
for (T value : parameterValues.get(thisKey)) {
Map<String, T> permutation = new HashMap<>(basePermutation);
permutation.put(thisKey, value);
if (remainingKeys.isEmpty()) {
returnList.add(permutation);
} else {
permute(permutation, remainingKeys, parameterValues, returnList);
}
}
}
/**
* Returns passed currentValue if it is not null and creates a new ArrayList if it is null.
* <br><br>
* Example: values = createIfNull(values)
*/
public static <T> List<T> createIfNull(List<T> currentValue) {
if (currentValue == null) {
return new ArrayList<T>();
} else {
return currentValue;
}
}
/**
* Returns a new empty array if the passed array is null.
*/
public static <T> T[] createIfNull(T[] arguments) {
if (arguments == null) {
return (T[]) new Object[0];
} else {
return arguments;
}
}
/**
* Returns a new empty set if the passed array is null.
*/
public static <T> Set<T> createIfNull(Set<T> currentValue) {
if (currentValue == null) {
return new HashSet<>();
} else {
return currentValue;
}
}
/**
* Converts a set of nested maps (like from yaml/json) into a flat map with dot-separated properties
*/
public static Map<String, Object> flatten(Map<String, Object> map) {
if (map == null) {
return null;
}
return flatten(null, map);
}
private static Map<String, Object> flatten(String prefix, Map<String, Object> map) {
Map<String, Object> outMap = new HashMap<>();
for (Map.Entry<String, Object> entry : map.entrySet()) {
String propertyName = entry.getKey();
if (prefix != null) {
propertyName = prefix + "." + propertyName;
}
if (entry.getValue() instanceof Map) {
outMap.putAll(flatten(propertyName, (Map<String, Object>) entry.getValue()));
} else {
outMap.put(propertyName, entry.getValue());
}
}
return outMap;
}
}