names.put(new SeqIdName(cand.getName()), cand);
int q, w, candlen = cand.getName().length();
// keep the one with an id 'closer' to the given seqnam string
- if ((q = Math.abs(matchlen - namlen)) > (w = Math.abs(candlen
- - namlen))
- && candlen > matchlen)
+ if ((q = Math.abs(matchlen - namlen)) > (w = Math
+ .abs(candlen - namlen)) && candlen > matchlen)
{
best.clear();
match = cand;
@Override
public int hashCode()
{
- return ((id.length() >= 4) ? id.substring(0, 4).hashCode() : id
- .hashCode());
+ return ((id.length() >= 4) ? id.substring(0, 4).hashCode()
+ : id.hashCode());
}
@Override
{
if (id.length() > s.length())
{
- return id.startsWith(s) ? (WORD_SEP.indexOf(id.charAt(s.length())) > -1)
+ return id.startsWith(s)
+ ? (WORD_SEP.indexOf(id.charAt(s.length())) > -1)
: false;
}
else
{
- return s.startsWith(id) ? (s.equals(id) ? true : (WORD_SEP
- .indexOf(s.charAt(id.length())) > -1)) : false;
+ return s.startsWith(id)
+ ? (s.equals(id) ? true
+ : (WORD_SEP.indexOf(s.charAt(id.length())) > -1))
+ : false;
}
}