@@ -57,7 +57,7 @@ enum TrieMatchingMode {
57
57
WILDCARD_NODES_ALLOWED
58
58
}
59
59
60
- static EnumSet <TrieMatchingMode > EXPLICIT_OR_ROOT_WILDCARD =
60
+ private static final EnumSet <TrieMatchingMode > EXPLICIT_OR_ROOT_WILDCARD =
61
61
EnumSet .of (TrieMatchingMode .EXPLICIT_NODES_ONLY , TrieMatchingMode .WILDCARD_ROOT_NODES_ALLOWED );
62
62
63
63
public interface Decoder {
@@ -79,17 +79,15 @@ public PathTrie(Decoder decoder) {
79
79
public class TrieNode {
80
80
private transient String key ;
81
81
private transient T value ;
82
- private boolean isWildcard ;
83
82
private final String wildcard ;
84
83
85
84
private transient String namedWildcard ;
86
85
87
86
private Map <String , TrieNode > children ;
88
87
89
- public TrieNode (String key , T value , String wildcard ) {
88
+ private TrieNode (String key , T value , String wildcard ) {
90
89
this .key = key ;
91
90
this .wildcard = wildcard ;
92
- this .isWildcard = (key .equals (wildcard ));
93
91
this .value = value ;
94
92
this .children = emptyMap ();
95
93
if (isNamedWildcard (key )) {
@@ -99,7 +97,7 @@ public TrieNode(String key, T value, String wildcard) {
99
97
}
100
98
}
101
99
102
- public void updateKeyWithNamedWildcard (String key ) {
100
+ private void updateKeyWithNamedWildcard (String key ) {
103
101
this .key = key ;
104
102
namedWildcard = key .substring (key .indexOf ('{' ) + 1 , key .indexOf ('}' ));
105
103
}
@@ -110,7 +108,7 @@ private void addInnerChild(String key, TrieNode child) {
110
108
children = unmodifiableMap (newChildren );
111
109
}
112
110
113
- public synchronized void insert (String [] path , int index , T value ) {
111
+ private synchronized void insert (String [] path , int index , T value ) {
114
112
if (index >= path .length )
115
113
return ;
116
114
@@ -145,7 +143,7 @@ public synchronized void insert(String[] path, int index, T value) {
145
143
node .insert (path , index + 1 , value );
146
144
}
147
145
148
- public synchronized void insertOrUpdate (String [] path , int index , T value , BiFunction <T , T , T > updater ) {
146
+ private synchronized void insertOrUpdate (String [] path , int index , T value , BiFunction <T , T , T > updater ) {
149
147
if (index >= path .length )
150
148
return ;
151
149
@@ -357,14 +355,14 @@ public Iterator<T> retrieveAll(String path, Supplier<Map<String, String>> paramS
357
355
return new PathTrieIterator <>(this , path , paramSupplier );
358
356
}
359
357
360
- class PathTrieIterator <T > implements Iterator <T > {
358
+ private static class PathTrieIterator <T > implements Iterator <T > {
361
359
362
360
private final List <TrieMatchingMode > modes ;
363
361
private final Supplier <Map <String , String >> paramSupplier ;
364
362
private final PathTrie <T > trie ;
365
363
private final String path ;
366
364
367
- PathTrieIterator (PathTrie trie , String path , Supplier <Map <String , String >> paramSupplier ) {
365
+ PathTrieIterator (PathTrie < T > trie , String path , Supplier <Map <String , String >> paramSupplier ) {
368
366
this .path = path ;
369
367
this .trie = trie ;
370
368
this .paramSupplier = paramSupplier ;
0 commit comments