*/
package jalview.analysis;
+import jalview.bin.Cache;
import jalview.datamodel.AlignmentView;
import jalview.datamodel.BinaryNode;
import jalview.datamodel.NodeTransformI;
* @param treefile
* NewickFile
*/
- public TreeModel(SequenceI[] seqs, AlignmentView odata, NewickFile treefile)
+ public TreeModel(SequenceI[] seqs, AlignmentView odata,
+ NewickFile treefile)
{
- this(seqs, treefile.getTree(), treefile.HasDistances(), treefile
- .HasBootstrap(), treefile.HasRootDistance());
+ this(seqs, treefile.getTree(), treefile.HasDistances(),
+ treefile.HasBootstrap(), treefile.HasRootDistance());
seqData = odata;
associateLeavesToSequences(seqs);
*/
public TreeModel(TreeBuilder tree)
{
- this(tree.getSequences(), tree.getTopNode(), tree.hasDistances(), tree
- .hasBootstrap(), tree.hasRootDistance());
+ this(tree.getSequences(), tree.getTopNode(), tree.hasDistances(),
+ tree.hasBootstrap(), tree.hasRootDistance());
seqData = tree.getOriginalData();
}
if (one2many.contains(nam))
{
// countOne2Many++;
- // if (jalview.bin.Cache.log.isDebugEnabled())
- // jalview.bin.Cache.log.debug("One 2 many relationship for
+ // if (Cache.isDebugEnabled())
+ // Cache.debug("One 2 many relationship for
// "+nam.getName());
}
else
j.setPlaceholder(true);
}
}
- // if (jalview.bin.Cache.log.isDebugEnabled() && countOne2Many>0) {
- // jalview.bin.Cache.log.debug("There were "+countOne2Many+" alignment
+ // if (Cache.isDebugEnabled() && countOne2Many>0) {
+ // Cache.debug("There were "+countOne2Many+" alignment
// sequence ids (out of "+one2many.size()+" unique ids) linked to two or
// more leaves.");
// }
{
NewickFile fout = new NewickFile(getTopNode());
- return fout.print(hasBootstrap(), hasDistances(),
- hasRootDistance()); // output all data available for tree
+ return fout.print(hasBootstrap(), hasDistances(), hasRootDistance()); // output
+ // all
+ // data
+ // available
+ // for
+ // tree
}
/**
if (!leaf.isPlaceholder())
{
// Construct a new placeholder sequence object for this leaf
- leaf.setElement(new Sequence(leaf.getName(),
- "THISISAPLACEHLDER"));
+ leaf.setElement(
+ new Sequence(leaf.getName(), "THISISAPLACEHLDER"));
}
leaf.setPlaceholder(true);
System.out.println(" name = " + ((SequenceI) nd.element()).getName());
}
- System.out.println(" dist = " + nd.dist + " " + nd.count + " "
- + nd.height);
+ System.out.println(
+ " dist = " + nd.dist + " " + nd.count + " " + nd.height);
}
/**
{
// if (_lycount<_lylimit)
// {
- // System.err.println("Warning: depth of _recount greater than number of nodes.");
+ // System.err.println("Warning: depth of _recount greater than number of
+ // nodes.");
// }
if (nd == null)
{
public void applyToNodes(NodeTransformI nodeTransformI)
{
for (Enumeration<SequenceNode> nodes = node.elements(); nodes
- .hasMoreElements(); nodeTransformI.transform(nodes
- .nextElement()))
+ .hasMoreElements(); nodeTransformI
+ .transform(nodes.nextElement()))
{
;
}