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
|
// --- BEGIN COPYRIGHT BLOCK ---
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; version 2 of the License.
//
// This program 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 for more details.
//
// You should have received a copy of the GNU General Public License along
// with this program; if not, write to the Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
//
// (C) 2007 Red Hat, Inc.
// All rights reserved.
// --- END COPYRIGHT BLOCK ---
package com.netscape.certsrv.common;
import java.util.LinkedHashMap;
import java.util.StringTokenizer;
/**
* A class represents an ordered list of name
* value pairs.
*
* @version $Revision$, $Date$
*/
public class NameValuePairs extends LinkedHashMap<String, String> {
private static final long serialVersionUID = 1494507857048437440L;
/**
* Constructs name value pairs.
*/
public NameValuePairs() {
}
/**
* Show the content of this name value container as
* string representation.
*
* @return string representation
*/
public String toString() {
StringBuffer buf = new StringBuffer();
for (String name : keySet()) {
String value = get(name);
buf.append(name + "=" + value);
buf.append("\n");
}
return buf.toString();
}
/**
* Parses a string into name value pairs.
*
* @param s string
* @param nvp name value pairs
* @return true if successful
*/
public static boolean parseInto(String s, NameValuePairs nvp) {
StringTokenizer st = new StringTokenizer(s, "&");
while (st.hasMoreTokens()) {
String t = st.nextToken();
int i = t.indexOf("=");
if (i == -1) {
return false;
}
String n = t.substring(0, i);
String v = t.substring(i + 1);
nvp.put(n, v);
}
return true;
}
}
|
