public int matchInternal(int p, Pthings pt)
{
- return (p < pt.src.length() && pt.src.charAt(p) == c) ? nextMatch(
- p + 1, pt) : -1;
+ return (p < pt.src.length() && pt.src.charAt(p) == c)
+ ? nextMatch(p + 1, pt)
+ : -1;
}
Pattern clone1(Hashtable h)
n = RegOpt.opt(n, ignoreCase, dontMinQ);
}
n.setParent(this);
- set(new Character(o.c), n, ignoreCase, dontMinQ);
+ set(Character.valueOf(o.c), n, ignoreCase, dontMinQ);
if (ignoreCase)
{
if (o.c != o.altc)
{
- set(new Character(o.altc), n, ignoreCase, dontMinQ);
+ set(Character.valueOf(o.altc), n, ignoreCase, dontMinQ);
}
if (o.c != o.altc2 && o.altc != o.altc2)
{
- set(new Character(o.altc2), n, ignoreCase, dontMinQ);
+ set(Character.valueOf(o.altc2), n, ignoreCase, dontMinQ);
}
}
}
{
return -1;
}
- Pattern n = (Pattern) h.get(new Character(pt.src.charAt(pos)));
+ Pattern n = (Pattern) h.get(Character.valueOf(pt.src.charAt(pos)));
if (n == null)
{
return -1;
Pattern pp = (Pattern) v.elementAt(i);
// We want to have at least two oneChar's in
// the Or Object to consider making a Branch.
- if (pp instanceof oneChar
- && (b.h.size() >= 1 || (i + 1 < v.size() && v
- .elementAt(i + 1) instanceof oneChar)))
+ if (pp instanceof oneChar && (b.h.size() >= 1 || (i + 1 < v.size()
+ && v.elementAt(i + 1) instanceof oneChar)))
{
b.addc((oneChar) pp, ignoreCase, dontMinQ);
}