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 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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.
*/
package org.apache.catalina.util;
/**
* Utility class for string parsing that is higher performance than
* StringParser for simple delimited text cases. Parsing is performed
* by setting the string, and then using the <code>findXxxx()</code> and
* <code>skipXxxx()</code> families of methods to remember significant
* offsets. To retrieve the parsed substrings, call the <code>extract()</code>
* method with the appropriate saved offset values.
*
* @author Craig R. McClanahan
* @version $Revision: 467222 $ $Date: 2006-10-24 05:17:11 +0200 (mar., 24 oct. 2006) $
*/
public final class StringParser {
// ----------------------------------------------------------- Constructors
/**
* Construct a string parser with no preset string to be parsed.
*/
public StringParser() {
this(null);
}
/**
* Construct a string parser that is initialized to parse the specified
* string.
*
* @param string The string to be parsed
*/
public StringParser(String string) {
super();
setString(string);
}
// ----------------------------------------------------- Instance Variables
/**
* The characters of the current string, as a character array. Stored
* when the string is first specified to speed up access to characters
* being compared during parsing.
*/
private char chars[] = null;
/**
* The zero-relative index of the current point at which we are
* positioned within the string being parsed. <strong>NOTE</strong>:
* the value of this index can be one larger than the index of the last
* character of the string (i.e. equal to the string length) if you
* parse off the end of the string. This value is useful for extracting
* substrings that include the end of the string.
*/
private int index = 0;
/**
* The length of the String we are currently parsing. Stored when the
* string is first specified to avoid repeated recalculations.
*/
private int length = 0;
/**
* The String we are currently parsing.
*/
private String string = null;
// ------------------------------------------------------------- Properties
/**
* Return the zero-relative index of our current parsing position
* within the string being parsed.
*/
public int getIndex() {
return (this.index);
}
/**
* Return the length of the string we are parsing.
*/
public int getLength() {
return (this.length);
}
/**
* Return the String we are currently parsing.
*/
public String getString() {
return (this.string);
}
/**
* Set the String we are currently parsing. The parser state is also reset
* to begin at the start of this string.
*
* @param string The string to be parsed.
*/
public void setString(String string) {
this.string = string;
if (string != null) {
this.length = string.length();
chars = this.string.toCharArray();
} else {
this.length = 0;
chars = new char[0];
}
reset();
}
// --------------------------------------------------------- Public Methods
/**
* Advance the current parsing position by one, if we are not already
* past the end of the string.
*/
public void advance() {
if (index < length)
index++;
}
/**
* Extract and return a substring that starts at the specified position,
* and extends to the end of the string being parsed. If this is not
* possible, a zero-length string is returned.
*
* @param start Starting index, zero relative, inclusive
*/
public String extract(int start) {
if ((start < 0) || (start >= length))
return ("");
else
return (string.substring(start));
}
/**
* Extract and return a substring that starts at the specified position,
* and ends at the character before the specified position. If this is
* not possible, a zero-length string is returned.
*
* @param start Starting index, zero relative, inclusive
* @param end Ending index, zero relative, exclusive
*/
public String extract(int start, int end) {
if ((start < 0) || (start >= end) || (end > length))
return ("");
else
return (string.substring(start, end));
}
/**
* Return the index of the next occurrence of the specified character,
* or the index of the character after the last position of the string
* if no more occurrences of this character are found. The current
* parsing position is updated to the returned value.
*
* @param ch Character to be found
*/
public int findChar(char ch) {
while ((index < length) && (ch != chars[index]))
index++;
return (index);
}
/**
* Return the index of the next occurrence of a non-whitespace character,
* or the index of the character after the last position of the string
* if no more non-whitespace characters are found. The current
* parsing position is updated to the returned value.
*/
public int findText() {
while ((index < length) && isWhite(chars[index]))
index++;
return (index);
}
/**
* Return the index of the next occurrence of a whitespace character,
* or the index of the character after the last position of the string
* if no more whitespace characters are found. The current parsing
* position is updated to the returned value.
*/
public int findWhite() {
while ((index < length) && !isWhite(chars[index]))
index++;
return (index);
}
/**
* Reset the current state of the parser to the beginning of the
* current string being parsed.
*/
public void reset() {
index = 0;
}
/**
* Advance the current parsing position while it is pointing at the
* specified character, or until it moves past the end of the string.
* Return the final value.
*
* @param ch Character to be skipped
*/
public int skipChar(char ch) {
while ((index < length) && (ch == chars[index]))
index++;
return (index);
}
/**
* Advance the current parsing position while it is pointing at a
* non-whitespace character, or until it moves past the end of the string.
* Return the final value.
*/
public int skipText() {
while ((index < length) && !isWhite(chars[index]))
index++;
return (index);
}
/**
* Advance the current parsing position while it is pointing at a
* whitespace character, or until it moves past the end of the string.
* Return the final value.
*/
public int skipWhite() {
while ((index < length) && isWhite(chars[index]))
index++;
return (index);
}
// ------------------------------------------------------ Protected Methods
/**
* Is the specified character considered to be whitespace?
*
* @param ch Character to be checked
*/
protected boolean isWhite(char ch) {
if ((ch == ' ') || (ch == '\t') || (ch == '\r') || (ch == '\n'))
return (true);
else
return (false);
}
}
|