1 |
|
|
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
|
17 |
|
|
18 |
|
|
19 |
|
|
20 |
|
package org.xwiki.velocity.tools; |
21 |
|
|
22 |
|
import java.util.ArrayList; |
23 |
|
import java.util.Collection; |
24 |
|
import java.util.Collections; |
25 |
|
import java.util.HashMap; |
26 |
|
import java.util.HashSet; |
27 |
|
import java.util.LinkedHashMap; |
28 |
|
import java.util.LinkedHashSet; |
29 |
|
import java.util.LinkedList; |
30 |
|
import java.util.List; |
31 |
|
import java.util.Map; |
32 |
|
import java.util.PriorityQueue; |
33 |
|
import java.util.Queue; |
34 |
|
import java.util.Set; |
35 |
|
import java.util.SortedMap; |
36 |
|
import java.util.SortedSet; |
37 |
|
import java.util.TreeMap; |
38 |
|
import java.util.TreeSet; |
39 |
|
import java.util.concurrent.BlockingQueue; |
40 |
|
import java.util.concurrent.LinkedBlockingQueue; |
41 |
|
|
42 |
|
import org.apache.commons.collections4.CollectionUtils; |
43 |
|
|
44 |
|
|
45 |
|
|
46 |
|
|
47 |
|
@version |
48 |
|
@since |
49 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (94) |
Complexity: 34 |
Complexity Density: 0.68 |
|
50 |
|
public class CollectionsTool |
51 |
|
{ |
52 |
|
|
53 |
|
@link |
54 |
|
|
55 |
|
|
56 |
|
|
57 |
|
@param |
58 |
|
@return@link |
59 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
60 |
4 |
public <E> List<E> getArrayList()... |
61 |
|
{ |
62 |
4 |
return new ArrayList<E>(); |
63 |
|
} |
64 |
|
|
65 |
|
|
66 |
|
@link |
67 |
|
|
68 |
|
|
69 |
|
@param |
70 |
|
@return@link |
71 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
72 |
10 |
public <E> List<E> getLinkedList()... |
73 |
|
{ |
74 |
10 |
return new LinkedList<E>(); |
75 |
|
} |
76 |
|
|
77 |
|
|
78 |
|
@link |
79 |
|
|
80 |
|
|
81 |
|
@param |
82 |
|
@param |
83 |
|
@return@link |
84 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
85 |
2 |
public <K, V> Map<K, V> getMap()... |
86 |
|
{ |
87 |
2 |
return new HashMap<K, V>(); |
88 |
|
} |
89 |
|
|
90 |
|
|
91 |
|
@link |
92 |
|
|
93 |
|
|
94 |
|
@param |
95 |
|
@param |
96 |
|
@return@link |
97 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
98 |
1 |
public <K extends Comparable<K>, V> SortedMap<K, V> getSortedMap()... |
99 |
|
{ |
100 |
1 |
return new TreeMap<K, V>(); |
101 |
|
} |
102 |
|
|
103 |
|
|
104 |
|
@link |
105 |
|
|
106 |
|
|
107 |
|
@param |
108 |
|
@param |
109 |
|
@return@link |
110 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
111 |
1 |
public <K, V> Map<K, V> getOrderedMap()... |
112 |
|
{ |
113 |
1 |
return new LinkedHashMap<K, V>(); |
114 |
|
} |
115 |
|
|
116 |
|
|
117 |
|
@link |
118 |
|
|
119 |
|
|
120 |
|
@param |
121 |
|
@return@link |
122 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
123 |
3021 |
public <E> Set<E> getSet()... |
124 |
|
{ |
125 |
3021 |
return new HashSet<E>(); |
126 |
|
} |
127 |
|
|
128 |
|
|
129 |
|
@link |
130 |
|
|
131 |
|
|
132 |
|
@param |
133 |
|
@return@link |
134 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
135 |
2 |
public <E extends Comparable<E>> SortedSet<E> getSortedSet()... |
136 |
|
{ |
137 |
2 |
return new TreeSet<E>(); |
138 |
|
} |
139 |
|
|
140 |
|
|
141 |
|
@link |
142 |
|
|
143 |
|
|
144 |
|
@param |
145 |
|
@return@link |
146 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
147 |
1 |
public <E> Set<E> getOrderedSet()... |
148 |
|
{ |
149 |
1 |
return new LinkedHashSet<E>(); |
150 |
|
} |
151 |
|
|
152 |
|
|
153 |
|
@link |
154 |
|
|
155 |
|
|
156 |
|
@param |
157 |
|
@return@link |
158 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
159 |
1 |
public <E> Queue<E> getQueue()... |
160 |
|
{ |
161 |
1 |
return new LinkedList<E>(); |
162 |
|
} |
163 |
|
|
164 |
|
|
165 |
|
@link |
166 |
|
|
167 |
|
|
168 |
|
@param |
169 |
|
@return@link |
170 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
171 |
1 |
public <E> BlockingQueue<E> getBlockingQueue()... |
172 |
|
{ |
173 |
1 |
return new LinkedBlockingQueue<E>(); |
174 |
|
} |
175 |
|
|
176 |
|
|
177 |
|
@link |
178 |
|
|
179 |
|
|
180 |
|
|
181 |
|
@param |
182 |
|
@return@link |
183 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
184 |
2 |
public <E extends Comparable<E>> Queue<E> getPriorityQueue()... |
185 |
|
{ |
186 |
2 |
return new PriorityQueue<E>(); |
187 |
|
} |
188 |
|
|
189 |
|
|
190 |
|
|
191 |
|
|
192 |
|
@param |
193 |
|
@param |
194 |
|
@return |
195 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 2 |
Complexity Density: 0.67 |
|
196 |
4 |
public <E> List<E> unmodifiable(List<E> input)... |
197 |
|
{ |
198 |
4 |
if (input == null) { |
199 |
1 |
return null; |
200 |
|
} |
201 |
3 |
return Collections.unmodifiableList(input); |
202 |
|
} |
203 |
|
|
204 |
|
|
205 |
|
|
206 |
|
|
207 |
|
@param |
208 |
|
@param |
209 |
|
@param |
210 |
|
@return |
211 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 2 |
Complexity Density: 0.67 |
|
212 |
2 |
public <K, V> Map<K, V> unmodifiable(Map<K, V> input)... |
213 |
|
{ |
214 |
2 |
if (input == null) { |
215 |
1 |
return null; |
216 |
|
} |
217 |
1 |
return Collections.unmodifiableMap(input); |
218 |
|
} |
219 |
|
|
220 |
|
|
221 |
|
|
222 |
|
|
223 |
|
@param |
224 |
|
@param |
225 |
|
@return |
226 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 2 |
Complexity Density: 0.67 |
|
227 |
2 |
public <E> Set<E> unmodifiable(Set<E> input)... |
228 |
|
{ |
229 |
2 |
if (input == null) { |
230 |
1 |
return null; |
231 |
|
} |
232 |
1 |
return Collections.unmodifiableSet(input); |
233 |
|
} |
234 |
|
|
235 |
|
|
236 |
|
|
237 |
|
|
238 |
|
@param |
239 |
|
@param |
240 |
|
@return |
241 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 2 |
Complexity Density: 0.67 |
|
242 |
2 |
public <E> Collection<E> unmodifiable(Collection<E> input)... |
243 |
|
{ |
244 |
2 |
if (input == null) { |
245 |
1 |
return null; |
246 |
|
} |
247 |
1 |
return Collections.unmodifiableCollection(input); |
248 |
|
} |
249 |
|
|
250 |
|
|
251 |
|
@link@link |
252 |
|
|
253 |
|
@param |
254 |
|
@param |
255 |
|
@param |
256 |
|
@return |
257 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 3 |
Complexity Density: 0.6 |
|
258 |
5 |
public <E> Collection<E> union(Collection<E> a, Collection<E> b)... |
259 |
|
{ |
260 |
5 |
if (a == null) { |
261 |
2 |
return b; |
262 |
3 |
} else if (b == null) { |
263 |
1 |
return a; |
264 |
|
} |
265 |
2 |
return CollectionUtils.union(a, b); |
266 |
|
} |
267 |
|
|
268 |
|
|
269 |
|
@link@link |
270 |
|
|
271 |
|
@param |
272 |
|
@param |
273 |
|
@param |
274 |
|
@return |
275 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 3 |
Complexity Density: 0.6 |
|
276 |
5 |
public <E> Collection<E> intersection(Collection<E> a, Collection<E> b)... |
277 |
|
{ |
278 |
5 |
if (a == null) { |
279 |
2 |
return b; |
280 |
3 |
} else if (b == null) { |
281 |
1 |
return a; |
282 |
|
} |
283 |
2 |
return CollectionUtils.intersection(a, b); |
284 |
|
} |
285 |
|
|
286 |
|
|
287 |
|
@link |
288 |
|
@link |
289 |
|
|
290 |
|
@param |
291 |
|
@param |
292 |
|
@param |
293 |
|
@return |
294 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 3 |
Complexity Density: 0.6 |
|
295 |
5 |
public <E> Collection<E> disjunction(Collection<E> a, Collection<E> b)... |
296 |
|
{ |
297 |
5 |
if (a == null) { |
298 |
2 |
return b; |
299 |
3 |
} else if (b == null) { |
300 |
1 |
return a; |
301 |
|
} |
302 |
2 |
return CollectionUtils.disjunction(a, b); |
303 |
|
} |
304 |
|
|
305 |
|
|
306 |
|
|
307 |
|
|
308 |
|
|
309 |
|
|
310 |
|
@param |
311 |
|
@param |
312 |
|
@return |
313 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (8) |
Complexity: 3 |
Complexity Density: 0.5 |
|
314 |
359 |
public <E> boolean reverse(List<E> input)... |
315 |
|
{ |
316 |
359 |
if (input == null) { |
317 |
1 |
return false; |
318 |
|
} |
319 |
358 |
try { |
320 |
358 |
Collections.reverse(input); |
321 |
357 |
return true; |
322 |
|
} catch (UnsupportedOperationException ex) { |
323 |
1 |
return false; |
324 |
|
} |
325 |
|
} |
326 |
|
|
327 |
|
|
328 |
|
|
329 |
|
|
330 |
|
|
331 |
|
@param |
332 |
|
@param |
333 |
|
@return |
334 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (8) |
Complexity: 3 |
Complexity Density: 0.5 |
|
335 |
3 |
public <E extends Comparable<E>> boolean sort(List<E> input)... |
336 |
|
{ |
337 |
3 |
if (input == null) { |
338 |
1 |
return false; |
339 |
|
} |
340 |
2 |
try { |
341 |
2 |
Collections.sort(input); |
342 |
1 |
return true; |
343 |
|
} catch (UnsupportedOperationException ex) { |
344 |
1 |
return false; |
345 |
|
} |
346 |
|
} |
347 |
|
} |