2 * ============LICENSE_START=======================================================
3 * Copyright (C) 2019-2020 Nordix Foundation.
4 * Modifications Copyright (C) 2021 AT&T Intellectual Property. All rights reserved.
5 * ================================================================================
6 * Licensed under the Apache License, Version 2.0 (the "License");
7 * you may not use this file except in compliance with the License.
8 * You may obtain a copy of the License at
10 * http://www.apache.org/licenses/LICENSE-2.0
12 * Unless required by applicable law or agreed to in writing, software
13 * distributed under the License is distributed on an "AS IS" BASIS,
14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15 * See the License for the specific language governing permissions and
16 * limitations under the License.
18 * SPDX-License-Identifier: Apache-2.0
19 * ============LICENSE_END=========================================================
22 package org.onap.policy.models.base;
24 import java.util.NavigableMap;
26 import java.util.TreeSet;
27 import lombok.AllArgsConstructor;
28 import org.onap.policy.common.utils.validation.Assertions;
31 * Implements concept getting from navigable maps.
33 * @param <C> the type of concept on which the interface implementation is applied.
36 public class PfConceptGetterImpl<C> implements PfConceptGetter<C> {
38 // The map from which to get concepts
39 private final NavigableMap<PfConceptKey, C> conceptMap;
43 public C get(final PfConceptKey conceptKey) {
44 return conceptMap.get(conceptKey);
48 public C get(final String conceptKeyName) {
49 Assertions.argumentNotNull(conceptKeyName, "conceptKeyName may not be null");
51 // The very fist key that could have this name
52 final var lowestArtifactKey = new PfConceptKey(conceptKeyName, PfKey.NULL_KEY_VERSION);
54 // Check if we found a key for our name
55 PfConceptKey foundKey = conceptMap.ceilingKey(lowestArtifactKey);
56 if (foundKey == null || !foundKey.getName().equals(conceptKeyName)) {
60 // Look for higher versions of the key
62 final PfConceptKey nextkey = conceptMap.higherKey(foundKey);
63 if (nextkey == null || !nextkey.getName().equals(conceptKeyName)) {
69 return conceptMap.get(foundKey);
73 public C get(final String conceptKeyName, final String conceptKeyVersion) {
74 Assertions.argumentNotNull(conceptKeyName, "conceptKeyName may not be null");
76 if (conceptKeyVersion != null) {
77 return conceptMap.get(new PfConceptKey(conceptKeyName, conceptKeyVersion));
79 return this.get(conceptKeyName);
84 public Set<C> getAll(final String conceptKeyName) {
85 return getAll(conceptKeyName, null);
89 public Set<C> getAll(final String conceptKeyName, final String conceptKeyVersion) {
90 final Set<C> returnSet = new TreeSet<>();
92 if (conceptKeyName == null) {
93 returnSet.addAll(conceptMap.values());
97 // The very fist key that could have this name
98 final var lowestArtifactKey = new PfConceptKey(conceptKeyName, PfKey.NULL_KEY_VERSION);
99 if (conceptKeyVersion != null) {
100 lowestArtifactKey.setVersion(conceptKeyVersion);
103 // Check if we found a key for our name
104 PfConceptKey foundKey = conceptMap.ceilingKey(lowestArtifactKey);
105 if (foundKey == null || !foundKey.getName().equals(conceptKeyName)) {
108 returnSet.add(conceptMap.get(foundKey));
110 // Look for higher versions of the key
112 foundKey = conceptMap.higherKey(foundKey);
113 if (foundKey == null || !foundKey.getName().equals(conceptKeyName)) {
116 returnSet.add(conceptMap.get(foundKey));