/
CustomCollectionUtils.java
72 lines (65 loc) · 2.73 KB
/
CustomCollectionUtils.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
/*
* Tencent is pleased to support the open source community by making BK-JOB蓝鲸智云作业平台 available.
*
* Copyright (C) 2021 THL A29 Limited, a Tencent company. All rights reserved.
*
* BK-JOB蓝鲸智云作业平台 is licensed under the MIT License.
*
* License for BK-JOB蓝鲸智云作业平台:
* --------------------------------------------------------------------
* Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
* documentation files (the "Software"), to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and
* to permit persons to whom the Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all copies or substantial portions of
* the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO
* THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
* CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
package com.tencent.bk.job.common.util;
import lombok.val;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
/**
* @Description
* @Date 2019/12/24
* @Version 1.0
*/
public class CustomCollectionUtils {
public static <T> List<T> mergeList(List<T> list1, List<T> list2) {
if (list1 == null || list1.isEmpty()) return list2;
if (list2 == null || list2.isEmpty()) return list1;
Set<T> set = new HashSet<>(list1);
List<T> resultList = new ArrayList<>(list1);
list2.forEach(it -> {
if (!set.contains(it)) {
resultList.add(it);
set.add(it);
}
});
return resultList;
}
public static List<String> getNoDuplicateList(String rawStr, String separator) {
if (rawStr == null || rawStr.isEmpty()) {
return new ArrayList<>();
}
val set = new HashSet<String>();
val arr = rawStr.split(separator);
for (int i = 0; i < arr.length; i++) {
set.add(arr[i]);
}
List<String> list = new ArrayList<>(set);
return list;
}
public static boolean isEmptyCollection(Collection collection) {
return collection == null || collection.isEmpty();
}
}