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
|
/*
* ============LICENSE_START=======================================================
* Copyright (C) 2016-2018 Ericsson. 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.
*
* SPDX-License-Identifier: Apache-2.0
* ============LICENSE_END=========================================================
*/
package org.onap.policy.apex.model.utilities;
import java.util.AbstractMap.SimpleEntry;
import java.util.ArrayList;
import java.util.List;
import java.util.Map.Entry;
import java.util.TreeMap;
/**
* This class provides utility functions for tree maps. A function to find the nearest match in the tree map to an input string is provided.
*
* @author Liam Fallon (liam.fallon@ericsson.com)
*/
public abstract class TreeMapUtils {
/**
* This class is a utility class that can't be instantiated.
*/
private TreeMapUtils() {
}
/**
* Find the list of entries that matches a given word, for example "p" will match "put", "policy", and "push".
*
* @param <T> the generic type for the value of the tree map
* @param searchMap the map that the method operates on
* @param word the word to search for
* @return the list of entries in the {@code searchMap} that match the {@code word}
*/
public static <T> List<Entry<String, T>> findMatchingEntries(final TreeMap<String, T> searchMap, final String word) {
final List<Entry<String, T>> foundNodes = new ArrayList<>();
// A straight match check
if (searchMap.containsKey(word)) {
foundNodes.add(new SimpleEntry<>(word, searchMap.get(word)));
return foundNodes;
}
// Set up the beginning point for our search for a list of near matches
String foundKeyword = searchMap.floorKey(word);
if (foundKeyword == null) {
foundKeyword = searchMap.firstKey();
}
else {
foundKeyword = searchMap.higherKey(foundKeyword);
}
// Find all the nodes that start with the word we are searching for
while (foundKeyword != null) {
if (foundKeyword.startsWith(word)) {
foundNodes.add(new SimpleEntry<>(foundKeyword, searchMap.get(foundKeyword)));
foundKeyword = searchMap.higherKey(foundKeyword);
}
else {
break;
}
}
return foundNodes;
}
}
|
