blob: 97fedffe9a2feb7a33d7330fa937e037148edac6 (
plain)
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
|
/*-
* ============LICENSE_START=======================================================
* SDC
* ================================================================================
* Copyright (C) 2019 AT&T Intellectual Property. All rights reserved.
* ================================================================================
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
* ============LICENSE_END=========================================================
*/
package org.openecomp.sdc.be.components.utils;
import org.apache.tinkerpop.shaded.minlog.Log;
import javax.validation.constraints.NotNull;
import java.security.SecureRandom;
import java.util.List;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Utils {
private static final Pattern COUNTER_PATTERN = Pattern.compile("\\d+$");
private static final SecureRandom random = new SecureRandom();
private Utils() {}
public static int getNextCounter(@NotNull List<String> existingValues) {
if (existingValues.isEmpty()) {
return 0;
}
int maxCurrentCounter = 0;
try {
maxCurrentCounter = existingValues.stream()
.map(COUNTER_PATTERN::matcher)
.filter(Matcher::find)
.map(matcher -> matcher.group(0))
.mapToInt(Integer::parseInt)
.max()
.orElse(0);
}
catch (Exception e) {
Log.warn("Failed in retrieivng counter from existing value: ", e);
maxCurrentCounter = random.nextInt(100) + 50;
}
return ++maxCurrentCounter;
}
}
|
