X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=forester%2Fjava%2Fsrc%2Forg%2Fforester%2Fphylogeny%2FPhylogenyNode.java;h=da0ab5d957e0d188009dda59fc2d1c75fd65d826;hb=5cad5dbd4f9e8cf09a123d4ee490cf314c05fd2f;hp=979fafe6093860a569a6fa01833ddb8d04567510;hpb=dc91a2ae1088da367adffb2401b18d285d328b47;p=jalview.git diff --git a/forester/java/src/org/forester/phylogeny/PhylogenyNode.java b/forester/java/src/org/forester/phylogeny/PhylogenyNode.java index 979fafe..da0ab5d 100644 --- a/forester/java/src/org/forester/phylogeny/PhylogenyNode.java +++ b/forester/java/src/org/forester/phylogeny/PhylogenyNode.java @@ -42,7 +42,7 @@ import org.forester.phylogeny.iterators.PreorderTreeIterator; import org.forester.util.ForesterUtil; /** - * Warning. Implementation of method 'compareTo' only looks at + * Warning. Implementation of method 'compareTo' only looks at * node name. Thus, use of this class in SortedSets might lead * to unexpected behavior. * @@ -95,7 +95,7 @@ public final class PhylogenyNode implements Comparable { /** * Adds PhylogenyNode n to the list of child nodes and sets the _parent of n * to this. - * + * * @param n * the PhylogenyNode to add */ @@ -141,8 +141,8 @@ public final class PhylogenyNode implements Comparable { * Returns a new PhylogenyNode which has its data copied from this * PhylogenyNode. Links to the other Nodes in the same Phylogeny are NOT * copied (e.g. _link to _parent). Field "_link" IS copied. - * - * @see #getLink() + * + * @see #getLink() */ final public PhylogenyNode copyNodeData() { final PhylogenyNode node = new PhylogenyNode(); @@ -168,8 +168,8 @@ public final class PhylogenyNode implements Comparable { * Returns a new PhylogenyNode which has the same data as this * PhylogenyNode. Links to the other Nodes in the same Phylogeny are NOT * copied (e.g. _link to _parent). Field "_link" IS copied. - * - * @see #getLink() + * + * @see #getLink() */ final public PhylogenyNode copyNodeDataShallow() { final PhylogenyNode node = new PhylogenyNode(); @@ -190,8 +190,8 @@ public final class PhylogenyNode implements Comparable { @Override /** * Based on node name, sequence, and taxonomy. - * - * + * + * */ final public boolean equals( final Object o ) { if ( this == o ) { @@ -239,7 +239,7 @@ public final class PhylogenyNode implements Comparable { /** * Returns a List containing references to all external children of this * PhylogenyNode. - * + * * @return List of references to external Nodes */ final public List getAllExternalDescendants() { @@ -267,7 +267,7 @@ public final class PhylogenyNode implements Comparable { /** * Returns a List containing references to all names of the external * children of this PhylogenyNode. - * + * * @return List of references to names of external Nodes */ final public List getAllExternalDescendantsNames() { @@ -288,7 +288,7 @@ public final class PhylogenyNode implements Comparable { /** * This return child node n of this node. - * + * * @param n * the index of the child to get * @return the child node with index n @@ -327,7 +327,7 @@ public final class PhylogenyNode implements Comparable { /** * This gets the child node index of this node. *

- * + * * @return the child node index of this node * @throws UnsupportedOperationException * if this node is a root node @@ -341,7 +341,7 @@ public final class PhylogenyNode implements Comparable { * parent *

* [last modified Aug 14, 2006 by CMZ] - * + * * @return the child node index of this node * @throws UnsupportedOperationException * if this node is a root node @@ -377,7 +377,7 @@ public final class PhylogenyNode implements Comparable { * Convenience method. Returns the first child node of this node. *

* [last modified May 18, 2005 by CMZ] - * + * * @return the first child node of this node */ public final PhylogenyNode getFirstChildNode() { @@ -402,7 +402,7 @@ public final class PhylogenyNode implements Comparable { * Convenience method. Returns the last child node of this node. *

* [last modified May 18, 2005 by CMZ] - * + * * @return the last child node of this node */ public final PhylogenyNode getLastChildNode() { @@ -616,7 +616,7 @@ public final class PhylogenyNode implements Comparable { /** * Checks whether this PhylogenyNode is external (tip). - * + * * @return true if this PhylogenyNode is external, false otherwise */ final public boolean isExternal() { @@ -663,7 +663,7 @@ public final class PhylogenyNode implements Comparable { /** * Checks whether this PhylogenyNode is internal (tip). - * + * * @return true if this PhylogenyNode is external, false otherwise */ final public boolean isInternal() { @@ -674,7 +674,7 @@ public final class PhylogenyNode implements Comparable { * Returns true if this node is the last child node of its _parent. *

* [last modified June 01, 2005 by CMZ] - * + * * @return true if this node is the last child node of its _parent, false * otherwise */ @@ -701,7 +701,7 @@ public final class PhylogenyNode implements Comparable { /** * Checks whether this PhylogenyNode is a root. - * + * * @return true if this PhylogenyNode is the root, false otherwise */ final public boolean isRoot() { @@ -772,7 +772,7 @@ public final class PhylogenyNode implements Comparable { * child nodes. This does not allow null slots in the list of child nodes: * If i is larger than the number of child nodes, n is just added to the * list, not place at index i. - * + * * @param i * the index of position where to add the child * @param n @@ -876,7 +876,7 @@ public final class PhylogenyNode implements Comparable { } if ( getNumberOfDescendants() != 2 ) { throw new RuntimeException( "attempt to swap descendants of node with " + getNumberOfDescendants() - + " descendants" ); + + " descendants" ); } final PhylogenyNode a = getChildNode( 0 ); final PhylogenyNode b = getChildNode( 1 ); @@ -894,8 +894,8 @@ public final class PhylogenyNode implements Comparable { if ( getBranchData().isHasConfidences() && ( getBranchData().getConfidence( 0 ).getValue() != Confidence.CONFIDENCE_DEFAULT_VALUE ) ) { data = Confidence.FORMATTER.format( ForesterUtil - .round( getBranchData().getConfidence( 0 ).getValue(), - PhyloXmlUtil.ROUNDING_DIGITS_FOR_PHYLOXML_DOUBLE_OUTPUT ) ); + .round( getBranchData().getConfidence( 0 ).getValue(), + PhyloXmlUtil.ROUNDING_DIGITS_FOR_PHYLOXML_DOUBLE_OUTPUT ) ); } } else if ( !ForesterUtil.isEmpty( getName() ) ) { @@ -933,8 +933,8 @@ public final class PhylogenyNode implements Comparable { && ( getBranchData().getConfidence( 0 ).getValue() != Confidence.CONFIDENCE_DEFAULT_VALUE ) ) { sb.append( "[" ); sb.append( Confidence.FORMATTER.format( ForesterUtil - .round( getBranchData().getConfidence( 0 ).getValue(), - PhyloXmlUtil.ROUNDING_DIGITS_FOR_PHYLOXML_DOUBLE_OUTPUT ) ) ); + .round( getBranchData().getConfidence( 0 ).getValue(), + PhyloXmlUtil.ROUNDING_DIGITS_FOR_PHYLOXML_DOUBLE_OUTPUT ) ) ); sb.append( "]" ); } return sb.toString(); @@ -971,12 +971,10 @@ public final class PhylogenyNode implements Comparable { @Override final public String toString() { final StringBuilder sb = new StringBuilder(); - if ( !ForesterUtil.isEmpty( getName() ) ) { sb.append( getName() ); sb.append( " " ); } - if ( getNodeData().isHasTaxonomy() ) { if ( !ForesterUtil.isEmpty( getNodeData().getTaxonomy().getScientificName() ) ) { sb.append( getNodeData().getTaxonomy().getScientificName() ); @@ -1008,8 +1006,11 @@ public final class PhylogenyNode implements Comparable { sb.append( getNodeData().getSequence().getAccession().toString() ); sb.append( " " ); } + if ( !ForesterUtil.isEmpty( getNodeData().getSequence().getMolecularSequence() ) ) { + sb.append( getNodeData().getSequence().getMolecularSequence() ); + sb.append( " " ); + } } - if ( sb.length() <= 1 ) { sb.append( "[" ); sb.append( getId() ); @@ -1059,7 +1060,7 @@ public final class PhylogenyNode implements Comparable { /** * Adds PhylogenyNode n to the list of child nodes. But does NOT set the * _parent of n to this. - * + * * @see addAsChild( PhylogenyNode n ) * @param n * the PhylogenyNode to add @@ -1069,26 +1070,26 @@ public final class PhylogenyNode implements Comparable { } public static PhylogenyNode createInstanceFromNhxString( final String nhx ) throws NHXFormatException, - PhyloXmlDataFormatException { + PhyloXmlDataFormatException { return new PhylogenyNode( nhx, NHXParser.TAXONOMY_EXTRACTION.NO, false ); } public static PhylogenyNode createInstanceFromNhxString( final String nhx, final NHXParser.TAXONOMY_EXTRACTION taxonomy_extraction ) - throws NHXFormatException, PhyloXmlDataFormatException { + throws NHXFormatException, PhyloXmlDataFormatException { return new PhylogenyNode( nhx, taxonomy_extraction, false ); } public static PhylogenyNode createInstanceFromNhxString( final String nhx, final NHXParser.TAXONOMY_EXTRACTION taxonomy_extraction, final boolean replace_underscores ) - throws NHXFormatException, PhyloXmlDataFormatException { + throws NHXFormatException, PhyloXmlDataFormatException { return new PhylogenyNode( nhx, taxonomy_extraction, replace_underscores ); } /** * Returns the total number of all Nodes created so far. - * + * * @return total number of Nodes (long) */ synchronized final public static long getNodeCount() {