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
122
123
124
125
126
|
/*-
* ============LICENSE_START=======================================================
* Copyright (C) 2019-2020 Nordix Foundation.
* ================================================================================
* 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.
*
* SPDX-License-Identifier: Apache-2.0
* ============LICENSE_END=========================================================
*/
package org.onap.policy.models.base;
import java.util.NavigableMap;
import java.util.Set;
import java.util.TreeSet;
import org.onap.policy.common.utils.validation.Assertions;
/**
* Implements concept getting from navigable maps.
*
* @param <C> the type of concept on which the interface implementation is applied.
*/
public class PfConceptGetterImpl<C> implements PfConceptGetter<C> {
// The map from which to get concepts
private final NavigableMap<PfConceptKey, C> conceptMap;
/**
* Constructor that sets the concept map on which the getter methods in the interface will operate..
*
* @param conceptMap the concept map on which the method will operate
*/
public PfConceptGetterImpl(final NavigableMap<PfConceptKey, C> conceptMap) {
this.conceptMap = conceptMap;
}
@Override
public C get(final PfConceptKey conceptKey) {
return conceptMap.get(conceptKey);
}
@Override
public C get(final String conceptKeyName) {
Assertions.argumentNotNull(conceptKeyName, "conceptKeyName may not be null");
// The very fist key that could have this name
final PfConceptKey lowestArtifactKey = new PfConceptKey(conceptKeyName, PfKey.NULL_KEY_VERSION);
// Check if we found a key for our name
PfConceptKey foundKey = conceptMap.ceilingKey(lowestArtifactKey);
if (foundKey == null || !foundKey.getName().equals(conceptKeyName)) {
return null;
}
// Look for higher versions of the key
do {
final PfConceptKey nextkey = conceptMap.higherKey(foundKey);
if (nextkey == null || !nextkey.getName().equals(conceptKeyName)) {
break;
}
foundKey = nextkey;
} while (true);
return conceptMap.get(foundKey);
}
@Override
public C get(final String conceptKeyName, final String conceptKeyVersion) {
Assertions.argumentNotNull(conceptKeyName, "conceptKeyName may not be null");
if (conceptKeyVersion != null) {
return conceptMap.get(new PfConceptKey(conceptKeyName, conceptKeyVersion));
} else {
return this.get(conceptKeyName);
}
}
@Override
public Set<C> getAll(final String conceptKeyName) {
return getAll(conceptKeyName, null);
}
@Override
public Set<C> getAll(final String conceptKeyName, final String conceptKeyVersion) {
final Set<C> returnSet = new TreeSet<>();
if (conceptKeyName == null) {
returnSet.addAll(conceptMap.values());
return returnSet;
}
// The very fist key that could have this name
final PfConceptKey lowestArtifactKey = new PfConceptKey(conceptKeyName, PfKey.NULL_KEY_VERSION);
if (conceptKeyVersion != null) {
lowestArtifactKey.setVersion(conceptKeyVersion);
}
// Check if we found a key for our name
PfConceptKey foundKey = conceptMap.ceilingKey(lowestArtifactKey);
if (foundKey == null || !foundKey.getName().equals(conceptKeyName)) {
return returnSet;
}
returnSet.add(conceptMap.get(foundKey));
// Look for higher versions of the key
do {
foundKey = conceptMap.higherKey(foundKey);
if (foundKey == null || !foundKey.getName().equals(conceptKeyName)) {
break;
}
returnSet.add(conceptMap.get(foundKey));
} while (true);
return returnSet;
}
}
|
