org.jboss.resteasy.util.GroupParameterParser Maven / Gradle / Ivy
The newest version!
package org.jboss.resteasy.util;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
/**
* A simple parser intended to parse sequences of name/value pairs.
* Parameter values are exptected to be enclosed in quotes if they
* contain unsafe characters, such as '=' characters or separators.
* Parameter values are optional and can be omitted.
*
* param1 = value; param2 = "anything goes; really"; param3
*
*
* @author Oleg Kalnichevski
*/
public class GroupParameterParser
{
/**
* String to be parsed.
*/
private char[] chars = null;
/**
* Current position in the string.
*/
private int pos = 0;
/**
* Maximum position in the string.
*/
private int len = 0;
/**
* Start of a token.
*/
private int i1 = 0;
/**
* End of a token.
*/
private int i2 = 0;
/**
* Whether names stored in the map should be converted to lower case.
*/
private boolean lowerCaseNames = false;
/**
* Default ParameterParser constructor.
*/
public GroupParameterParser()
{
super();
}
/**
* Are there any characters left to parse?
*
* @return true if there are unparsed characters,
* false otherwise.
*/
private boolean hasChar()
{
return this.pos < this.len;
}
/**
* A helper method to process the parsed token. This method removes
* leading and trailing blanks as well as enclosing quotation marks,
* when necessary.
*
* @param quoted true if quotation marks are expected,
* false otherwise.
* @return the token
*/
private String getToken(boolean quoted)
{
// Trim leading white spaces
while ((i1 < i2) && (Character.isWhitespace(chars[i1])))
{
i1++;
}
// Trim trailing white spaces
while ((i2 > i1) && (Character.isWhitespace(chars[i2 - 1])))
{
i2--;
}
// Strip away quotation marks if necessary
if (quoted)
{
if (((i2 - i1) >= 2)
&& (chars[i1] == '"')
&& (chars[i2 - 1] == '"'))
{
i1++;
i2--;
}
}
String result = null;
if (i2 > i1)
{
result = new String(chars, i1, i2 - i1);
}
return result;
}
/**
* Tests if the given character is present in the array of characters.
*
* @param ch the character to test for presense in the array of characters
* @param charray the array of characters to test against
* @return true if the character is present in the array of
* characters, false otherwise.
*/
private boolean isOneOf(char ch, final char[] charray)
{
boolean result = false;
for (int i = 0; i < charray.length; i++)
{
if (ch == charray[i])
{
result = true;
break;
}
}
return result;
}
/**
* Parses out a token until any of the given terminators
* is encountered.
*
* @param terminators the array of terminating characters. Any of these
* characters when encountered signify the end of the token
* @return the token
*/
private String parseToken(final char[] terminators)
{
char ch;
i1 = pos;
i2 = pos;
while (hasChar())
{
ch = chars[pos];
if (isOneOf(ch, terminators))
{
break;
}
i2++;
pos++;
}
return getToken(false);
}
/**
* Parses out a token until any of the given terminators
* is encountered outside the quotation marks.
*
* @param terminators the array of terminating characters. Any of these
* characters when encountered outside the quotation marks signify the end
* of the token
* @return the token
*/
private String parseQuotedToken(final char[] terminators)
{
char ch;
i1 = pos;
i2 = pos;
boolean quoted = false;
boolean charEscaped = false;
while (hasChar())
{
ch = chars[pos];
if (!quoted && isOneOf(ch, terminators))
{
break;
}
if (!charEscaped && ch == '"')
{
quoted = !quoted;
}
charEscaped = (!charEscaped && ch == '\\');
i2++;
pos++;
}
return getToken(true);
}
/**
* Returns true if parameter names are to be converted to lower
* case when name/value pairs are parsed.
*
* @return true if parameter names are to be
* converted to lower case when name/value pairs are parsed.
* Otherwise returns false
*/
public boolean isLowerCaseNames()
{
return this.lowerCaseNames;
}
/**
* Sets the flag if parameter names are to be converted to lower case when
* name/value pairs are parsed.
*
* @param b true if parameter names are to be
* converted to lower case when name/value pairs are parsed.
* false otherwise.
*/
public void setLowerCaseNames(boolean b)
{
this.lowerCaseNames = b;
}
/**
* Extracts a map of name/value pairs from the given string. Names are
* expected to be unique.
*
* @param str the string that contains a sequence of name/value pairs
* @param separator the name/value pairs separator
* @param groupSeparator group separator
* @return a map of name/value pairs
*/
public List