SequenceI nam;
String realnam;
Vector one2many=new Vector();
-
+ int countOne2Many=0;
while (i < leaves.size())
{
j = (SequenceNode) leaves.elementAt(i++);
{
j.setElement(nam);
if (one2many.contains(nam)) {
+ countOne2Many++;
if (jalview.bin.Cache.log.isDebugEnabled())
jalview.bin.Cache.log.debug("One 2 many relationship for "+nam.getName());
} else {
j.setPlaceholder(true);
}
}
- if (jalview.bin.Cache.log.isDebugEnabled()) {
- jalview.bin.Cache.log.debug("There were "+one2many.size()+" alignment sequences linked to two or more leaves.");
+ if (jalview.bin.Cache.log.isDebugEnabled() && countOne2Many>0) {
+ jalview.bin.Cache.log.debug("There were "+countOne2Many+" alignment sequence ids (out of "+one2many.size()+" unique ids) linked to two or more leaves.");
}
one2many.clear();
}