forked from btraceio/btrace
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArgsMap.java
More file actions
159 lines (137 loc) · 4.76 KB
/
ArgsMap.java
File metadata and controls
159 lines (137 loc) · 4.76 KB
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
/*
* Copyright (c) 2018, Jaroslav Bachorik <j.bachorik@btrace.io>.
* All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Copyright owner designates
* this particular file as subject to the "Classpath" exception as provided
* by the owner in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*/
package com.sun.btrace;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
/**
* A simple argument map wrapper allowing indexed access
*/
public final class ArgsMap implements Iterable<Map.Entry<String, String>> {
private static final class PatternSingleton {
// lazy initialization trick
// do not compile the pattern until it is actually requested
private static final Pattern INSTANCE = Pattern.compile("\\$\\{(.*?)\\}");
}
private final LinkedHashMap<String, String> map;
private final DebugSupport debug;
public ArgsMap(Map<String, String> args, DebugSupport debug) {
this.map = args != null ? new LinkedHashMap<>(args) : new LinkedHashMap<String, String>();
this.debug = debug;
}
public ArgsMap(String[] argLine, DebugSupport debug) {
this.map = new LinkedHashMap<>();
if (argLine != null) {
for (String arg : argLine) {
String[] kv = arg.split("=");
if (kv.length != 2) {
this.map.put(arg, "");
} else {
this.map.put(kv[0], kv[1]);
}
}
}
this.debug = debug;
}
public ArgsMap() {
this((Map<String, String>)null, new DebugSupport(SharedSettings.GLOBAL));
}
public ArgsMap(int initialCapacity, DebugSupport debug) {
this.map = new LinkedHashMap<>(initialCapacity);
this.debug = debug;
}
public String get(String key) {
return map.get(key);
}
public String get(int idx) {
if (idx >= 0 && idx < map.size()) {
Iterator<Map.Entry<String, String>> argsIterator = map.entrySet().iterator();
for (int i = 0; i < idx; i++) {
argsIterator.next();
}
Map.Entry<String, String> e = argsIterator.next();
return e.getValue() != null ? e.getKey() + "=" + e.getValue() : e.getKey();
} else {
return null;
}
}
public void clear() {
map.clear();
}
public int size() {
return map.size();
}
public boolean isEmpty() {
return map.isEmpty();
}
public String put(String key, String value) {
return map.put(key, value);
}
@Override
public Iterator<Map.Entry<String, String>> iterator() {
return map.entrySet().iterator();
}
public boolean containsKey(String key) {
return map.containsKey(key);
}
@Override
public boolean equals(Object o) {
return map.equals(o);
}
@Override
public int hashCode() {
return map.hashCode();
}
@Override
public String toString() {
return "ArgsMap{" + "map=" + map + ", debug=" + debug + '}';
}
public static ArgsMap merge(ArgsMap ... maps) {
DebugSupport debug = null;
Map<String, String> propMap = new LinkedHashMap<>();
for (ArgsMap map : maps) {
if (debug == null) {
debug = map.debug;
}
propMap.putAll(map.map);
}
return new ArgsMap(propMap, debug);
}
public String template(String value) {
if (value == null) {
return null;
}
if (value.isEmpty()) {
return value;
}
Matcher matcher = PatternSingleton.INSTANCE.matcher(value);
StringBuffer buffer = new StringBuffer(value.length());
while (matcher.find()) {
String val = get(matcher.group(1));
matcher.appendReplacement(buffer, val != null ? val : "$0");
}
matcher.appendTail(buffer);
return buffer.toString();
}
}