Vector<SequenceNode> leaves = findLeaves(top);
- int i = 0;
int namesleft = seqs.length;
- SequenceNode j;
- SequenceI nam;
- String realnam;
+ SequenceI nodeSequence;
+ String nodeSequenceName;
Vector<SequenceI> one2many = new Vector<>();
// int countOne2Many = 0;
- while (i < leaves.size())
+
+ for (SequenceNode sn : leaves)
{
- j = leaves.elementAt(i++);
- realnam = j.getName();
- nam = null;
+ nodeSequenceName = sn.getName();
+ nodeSequence = null;
if (namesleft > -1)
{
- nam = algnIds.findIdMatch(realnam);
+ nodeSequence = algnIds.findIdMatch(nodeSequenceName);
}
- if (nam != null)
+ if (nodeSequence != null)
{
- j.setElement(nam);
- if (one2many.contains(nam))
+ sn.setElement(nodeSequence);
+ if (one2many.contains(nodeSequence))
{
// countOne2Many++;
// if (jalview.bin.Cache.log.isDebugEnabled())
}
else
{
- one2many.addElement(nam);
+ one2many.addElement(nodeSequence);
namesleft--;
}
}
else
{
- j.setElement(new Sequence(realnam, "THISISAPLACEHLDER"));
- j.setPlaceholder(true);
+ sn.setElement(new Sequence(nodeSequenceName, "THISISAPLACEHLDER"));
+ sn.setPlaceholder(true);
}
}
// if (jalview.bin.Cache.log.isDebugEnabled() && countOne2Many>0) {