names = new Hashtable();
for (int i = 0; i < seqs.length; i++)
{
- // TODO: deal with ID collisions - SequenceI should be appended to list associated with this key.
+ // TODO: deal with ID collisions - SequenceI should be appended to list
+ // associated with this key.
names.put(new SeqIdName(seqs[i].getDisplayId(true)), seqs[i]);
// add in any interesting identifiers
if (seqs[i].getDBRef() != null)
*/
private SequenceI pickbestMatch(SeqIdName candName, Vector matches)
{
- SequenceI[] st= pickbestMatches(candName, matches);
- return st==null || st.length==0 ? null : st[0];
+ SequenceI[] st = pickbestMatches(candName, matches);
+ return st == null || st.length == 0 ? null : st[0];
}
+
/**
* returns the closest SequenceI in matches to SeqIdName and returns all the
* matches to the names hash.
* SeqIdName
* @param matches
* Vector of SequenceI objects
- * @return Object[] { SequenceI closest SequenceI to SeqIdName, SequenceI[] ties }
+ * @return Object[] { SequenceI closest SequenceI to SeqIdName, SequenceI[]
+ * ties }
*/
private SequenceI[] pickbestMatches(SeqIdName candName, Vector matches)
{
- ArrayList best=new ArrayList();
+ ArrayList best = new ArrayList();
SequenceI match = null;
if (candName == null || matches == null || matches.size() == 0)
{
SequenceI cand = (SequenceI) matches.elementAt(0);
matches.remove(0);
names.put(new SeqIdName(cand.getName()), cand);
- int q,w,candlen = cand.getName().length();
+ 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))
+ if ((q = Math.abs(matchlen - namlen)) > (w = Math.abs(candlen
+ - namlen))
&& candlen > matchlen)
{
best.clear();
matchlen = candlen;
best.add(match);
}
- if (q==w && candlen==matchlen)
+ if (q == w && candlen == matchlen)
{
// record any ties
best.add(cand);
}
}
- if (best.size()==0) { return null; };
+ if (best.size() == 0)
+ {
+ return null;
+ }
+ ;
return (SequenceI[]) best.toArray(new SequenceI[0]);
}
}
/**
- * Find all matches for a given sequence name.
- * @param seqnam string to query Matcher with.
+ * Find all matches for a given sequence name.
+ *
+ * @param seqnam
+ * string to query Matcher with.
*/
public SequenceI[] findAllIdMatches(String seqnam)
{
}
return pickbestMatch(nam, matches);
}
+
/**
* core findIdMatch search method for finding all equivalent matches
*
{
matches.addElement(names.remove(nam));
}
- SequenceI[] r=pickbestMatches(nam, matches);
+ SequenceI[] r = pickbestMatches(nam, matches);
return r;
}
-
private class SeqIdName
{
String id;
* arbritrarily extended sequence id's (like portions of an aligned set of
* repeats from one sequence)
*/
- private String WORD_SEP = "~. |#\\/<>!\""+((char)0x00A4)+"$%^*)}[@',?_";
+ private String WORD_SEP = "~. |#\\/<>!\"" + ((char) 0x00A4)
+ + "$%^*)}[@',?_";
/**
* matches if one ID properly contains another at a whitespace boundary.
*/
public boolean equals(SeqIdName s)
{
- // TODO: JAL-732 patch for cases when name includes a list of IDs, and the match contains one ID flanked
+ // TODO: JAL-732 patch for cases when name includes a list of IDs, and the
+ // match contains one ID flanked
if (id.length() > s.id.length())
{
return id.startsWith(s.id) ? (WORD_SEP.indexOf(id.charAt(s.id