return -1;
}
char c = s.charAt(from);
- return !(Prop.isAlphabetic(c) || Prop.isDecimalDigit(c) || c == '_') ? to
+ return !(Prop.isAlphabetic(c) || Prop.isDecimalDigit(c) || c == '_')
+ ? to
: -1;
}
}
* small differences as well. I will either make my package conform or note them
* as I become aware of them.
* <p>
- * This package supports additional patterns not in perl5: <center>
- * <table * border=1>
+ * This package supports additional patterns not in perl5: <center> <table *
+ * border=1>
* <tr>
* <td>(?@())</td>
* <td>Group</td>
* beginning of the string. "x(?<1)" is equivalent to "(?=x)". The number, 1
* in this example, is the number of characters to move backwards.</td>
* </table>
- * </center> </dl>
+ * </center>
+ * </dl>
*
* @author Steven R. Brandt
* @version package com.stevesoft.pat, release 1.5.3
{
pt.lastPos = 0;
}
- if ((s == null ? null : s.unwrap()) != (src == null ? null : s.unwrap()))
+ if ((s == null ? null : s.unwrap()) != (src == null ? null
+ : s.unwrap()))
{
pt.lastPos = 0;
}
{
if (s == null)
{
- throw new NullPointerException(
- MessageManager
- .getString("exception.null_string_given_to_regex_search"));
+ throw new NullPointerException(MessageManager
+ .getString("exception.null_string_given_to_regex_search"));
}
return _search(s, 0, s.length());
}
{
if (sl == null)
{
- throw new NullPointerException(
- MessageManager
- .getString("exception.null_string_like_given_to_regex_search"));
+ throw new NullPointerException(MessageManager.getString(
+ "exception.null_string_like_given_to_regex_search"));
}
return _search(sl, 0, sl.length());
}
{
if (s == null)
{
- throw new NullPointerException(
- MessageManager
- .getString("exception.null_string_given_to_regex_reverse_search"));
+ throw new NullPointerException(MessageManager.getString(
+ "exception.null_string_given_to_regex_reverse_search"));
}
return _reverseSearch(s, 0, s.length());
}
{
if (sl == null)
{
- throw new NullPointerException(
- MessageManager
- .getString("exception.null_string_like_given_to_regex_reverse_search"));
+ throw new NullPointerException(MessageManager.getString(
+ "exception.null_string_like_given_to_regex_reverse_search"));
}
return _reverseSearch(sl, 0, sl.length());
}
{
if (s == null)
{
- throw new NullPointerException(
- MessageManager
- .getString("exception.null_string_like_given_to_regex_search_from"));
+ throw new NullPointerException(MessageManager.getString(
+ "exception.null_string_like_given_to_regex_search_from"));
}
return _search(s, start, s.length());
}
{
if (s == null)
{
- throw new NullPointerException(
- MessageManager
- .getString("exception.null_string_like_given_to_regex_search_from"));
+ throw new NullPointerException(MessageManager.getString(
+ "exception.null_string_like_given_to_regex_search_from"));
}
return _search(s, start, s.length());
}
{
if (s == null)
{
- throw new NullPointerException(
- MessageManager
- .getString("exception.null_string_like_given_to_regex_search_region"));
+ throw new NullPointerException(MessageManager.getString(
+ "exception.null_string_like_given_to_regex_search_region"));
}
return _search(s, start, end);
}
* optimized() method.
* <p>
* This method will attempt to rewrite your pattern in a way that makes it
- * faster (not all patterns execute at the same speed). In general,
- * "(?: ... )" will be faster than "( ... )" so if you don't need the
- * backreference, you should group using the former pattern.
+ * faster (not all patterns execute at the same speed). In general, "(?: ...
+ * )" will be faster than "( ... )" so if you don't need the backreference,
+ * you should group using the former pattern.
* <p>
* It will also introduce new pattern elements that you can't get to
* otherwise, for example if you have a large table of strings, i.e. the
boolean isHexDigit(StrPos sp)
{
- boolean r = !sp.eos
- && !sp.dontMatch
- && ((sp.c >= '0' && sp.c <= '9')
- || (sp.c >= 'a' && sp.c <= 'f') || (sp.c >= 'A' && sp.c <= 'F'));
+ boolean r = !sp.eos && !sp.dontMatch
+ && ((sp.c >= '0' && sp.c <= '9') || (sp.c >= 'a' && sp.c <= 'f')
+ || (sp.c >= 'A' && sp.c <= 'F'));
return r;
}