2 // FORESTER -- software libraries and applications
3 // for evolutionary biology research and applications.
5 // Copyright (C) 2008-2009 Christian M. Zmasek
6 // Copyright (C) 2008-2009 Burnham Institute for Medical Research
7 // Copyright (C) 2000-2001 Washington University School of Medicine
8 // and Howard Hughes Medical Institute
11 // This library is free software; you can redistribute it and/or
12 // modify it under the terms of the GNU Lesser General Public
13 // License as published by the Free Software Foundation; either
14 // version 2.1 of the License, or (at your option) any later version.
16 // This library is distributed in the hope that it will be useful,
17 // but WITHOUT ANY WARRANTY; without even the implied warranty of
18 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 // Lesser General Public License for more details.
21 // You should have received a copy of the GNU Lesser General Public
22 // License along with this library; if not, write to the Free Software
23 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
25 // Contact: phylosoft @ gmail . com
26 // WWW: https://sites.google.com/site/cmzmasek/home/software/forester
28 package org.forester.phylogeny;
30 import java.util.ArrayList;
31 import java.util.List;
33 import org.forester.io.parsers.nhx.NHXFormatException;
34 import org.forester.io.parsers.nhx.NHXParser;
35 import org.forester.io.parsers.phyloxml.PhyloXmlDataFormatException;
36 import org.forester.io.parsers.phyloxml.PhyloXmlUtil;
37 import org.forester.phylogeny.data.BranchData;
38 import org.forester.phylogeny.data.Confidence;
39 import org.forester.phylogeny.data.NodeData;
40 import org.forester.phylogeny.data.PhylogenyDataUtil;
41 import org.forester.phylogeny.iterators.PreorderTreeIterator;
42 import org.forester.util.ForesterUtil;
45 * Warning. Implementation of method 'compareTo' only looks at
46 * node name. Thus, use of this class in SortedSets might lead
47 * to unexpected behavior.
50 public final class PhylogenyNode implements Comparable<PhylogenyNode> {
52 public enum NH_CONVERSION_SUPPORT_VALUE_STYLE {
53 NONE, IN_SQUARE_BRACKETS, AS_INTERNAL_NODE_NAMES;
55 private static long NODE_COUNT = 0;
56 private byte _indicator;
58 private int _sum_ext_nodes;
61 private double _distance_parent = PhylogenyDataUtil.BRANCH_LENGTH_DEFAULT;
62 private boolean _collapse;
63 private PhylogenyNode _parent;
64 private PhylogenyNode _link;
65 private ArrayList<PhylogenyNode> _descendants;
66 private NodeData _node_data;
67 private BranchData _branch_data;
68 private float _x_secondary;
69 private float _y_secondary;
72 * Default constructor for PhylogenyNode.
74 public PhylogenyNode() {
75 setId( PhylogenyNode.getNodeCount() );
76 PhylogenyNode.increaseNodeCount();
77 setSumExtNodes( 1 ); // For ext node, this number is 1 (not 0!!)
80 public void removeConnections() {
86 public boolean isEmpty() {
90 * Adds PhylogenyNode n to the list of child nodes and sets the _parent of n
94 * the PhylogenyNode to add
96 final public void addAsChild( final PhylogenyNode node ) {
97 final PhylogenyNode n = node;
103 * Adds PhylogenyNode n to the list of child nodes. But does NOT set the
104 * _parent of n to this.
106 * @see addAsChild( PhylogenyNode n )
108 * the PhylogenyNode to add
110 final private void addChildNode( final PhylogenyNode child ) {
111 getDescendants().add( child );
115 // this is poor, as it only compares on names!
116 final public int compareTo( final PhylogenyNode o ) {
117 final PhylogenyNode n = o;
118 if ( ( getName() == null ) || ( n.getName() == null ) ) {
121 return getName().compareTo( n.getName() );
124 // ---------------------------------------------------------
125 // Copy and delete Nodes, copy subtress
126 // ---------------------------------------------------------
128 * Returns a new PhylogenyNode which has its data copied from this
129 * PhylogenyNode. Links to the other Nodes in the same Phylogeny are NOT
130 * copied (e.g. _link to _parent). Field "_link" IS copied.
134 final public PhylogenyNode copyNodeData() {
135 final PhylogenyNode node = new PhylogenyNode();
136 PhylogenyNode.decreaseNodeCount();
138 node._sum_ext_nodes = _sum_ext_nodes;
139 node._indicator = _indicator;
142 node._distance_parent = _distance_parent;
143 node._collapse = _collapse;
145 if ( _node_data != null ) {
146 node._node_data = ( NodeData ) _node_data.copy();
148 if ( _branch_data != null ) {
149 node._branch_data = ( BranchData ) _branch_data.copy();
155 * Returns a new PhylogenyNode which has the same data as this
156 * PhylogenyNode. Links to the other Nodes in the same Phylogeny are NOT
157 * copied (e.g. _link to _parent). Field "_link" IS copied.
161 final public PhylogenyNode copyNodeDataShallow() {
162 final PhylogenyNode node = new PhylogenyNode();
163 PhylogenyNode.decreaseNodeCount();
165 node._sum_ext_nodes = _sum_ext_nodes;
166 node._indicator = _indicator;
169 node._distance_parent = _distance_parent;
170 node._collapse = _collapse;
172 node._node_data = _node_data;
173 node._branch_data = _branch_data;
179 * Based on node name, sequence, and taxonomy.
183 final public boolean equals( final Object o ) {
187 else if ( o == null ) {
190 else if ( o.getClass() != this.getClass() ) {
191 throw new IllegalArgumentException( "attempt to check [" + this.getClass() + "] equality to " + o + " ["
192 + o.getClass() + "]" );
195 final PhylogenyNode other = ( PhylogenyNode ) o;
196 if ( !getName().equals( other.getName() ) ) {
199 final NodeData this_data = getNodeData();
200 final NodeData other_data = other.getNodeData();
201 if ( ( this_data.isHasSequence() && other_data.isHasSequence() )
202 && ( this_data.isHasTaxonomy() && other_data.isHasTaxonomy() ) ) {
203 return ( this_data.getTaxonomy().isEqual( other_data.getTaxonomy() ) && this_data.getSequence()
204 .isEqual( other_data.getSequence() ) );
206 else if ( this_data.isHasTaxonomy() && other_data.isHasTaxonomy() ) {
207 return ( this_data.getTaxonomy().isEqual( other_data.getTaxonomy() ) );
209 else if ( this_data.isHasSequence() && other_data.isHasSequence() ) {
210 return ( this_data.getSequence().isEqual( other_data.getSequence() ) );
212 else if ( getName().length() > 0 ) {
213 // Node name is not empty, and equal.
222 // ---------------------------------------------------------
223 // Obtaining of Nodes
224 // ---------------------------------------------------------
226 * Returns a List containing references to all external children of this
229 * @return List of references to external Nodes
231 final public List<PhylogenyNode> getAllExternalDescendants() {
232 final List<PhylogenyNode> nodes = new ArrayList<PhylogenyNode>();
233 if ( isExternal() ) {
237 PhylogenyNode node1 = this;
238 while ( !node1.isExternal() ) {
239 node1 = node1.getFirstChildNode();
241 PhylogenyNode node2 = this;
242 while ( !node2.isExternal() ) {
243 node2 = node2.getLastChildNode();
245 while ( node1 != node2 ) {
247 node1 = node1.getNextExternalNode();
254 * Returns a List containing references to all names of the external
255 * children of this PhylogenyNode.
257 * @return List of references to names of external Nodes
259 final public List<String> getAllExternalDescendantsNames() {
260 final List<PhylogenyNode> c = getAllExternalDescendants();
261 final List<String> n = new ArrayList<String>( c.size() );
262 for( final PhylogenyNode phylogenyNode : c ) {
263 n.add( phylogenyNode.getName() );
268 final public BranchData getBranchData() {
269 if ( _branch_data == null ) {
270 _branch_data = new BranchData();
275 final BranchData getBranchDataDirectly() {
280 * This return child node n of this node.
283 * the index of the child to get
284 * @return the child node with index n
285 * @throws IllegalArgumentException
286 * if n is out of bounds
288 final public PhylogenyNode getChildNode( final int i ) {
289 if ( isExternal() ) {
290 throw new UnsupportedOperationException( "attempt to get the child node of an external node." );
292 if ( ( i >= getNumberOfDescendants() ) || ( i < 0 ) ) {
293 throw new IllegalArgumentException( "attempt to get child node " + i + " of a node with "
294 + getNumberOfDescendants() + " child nodes" );
296 return getDescendants().get( i );
300 * Convenience method. Returns the first child PhylogenyNode of this
303 final public PhylogenyNode getChildNode1() {
304 return getChildNode( 0 );
308 * Convenience method. Returns the second child PhylogenyNode of this
311 * [last modified May 18, 2005 by CMZ]
313 final public PhylogenyNode getChildNode2() {
314 return getChildNode( 1 );
318 * This gets the child node index of this node.
321 * @return the child node index of this node
322 * @throws UnsupportedOperationException
323 * if this node is a root node
325 final public int getChildNodeIndex() {
326 return getChildNodeIndex( getParent() );
330 * This gets the child node index of this node, given that parent is its
333 * [last modified Aug 14, 2006 by CMZ]
335 * @return the child node index of this node
336 * @throws UnsupportedOperationException
337 * if this node is a root node
339 final public int getChildNodeIndex( final PhylogenyNode parent ) {
341 throw new UnsupportedOperationException( "Cannot get the child index for a root node." );
343 for( int i = 0; i < parent.getNumberOfDescendants(); ++i ) {
344 if ( parent.getChildNode( i ) == this ) {
348 throw new RuntimeException( "Unexpected exception: Could not determine the child index for node: " + this );
351 final public List<PhylogenyNode> getDescendants() {
352 if ( _descendants == null ) {
353 _descendants = new ArrayList<PhylogenyNode>();
359 * Returns the length of the branch leading to the _parent of this
360 * PhylogenyNode (double).
362 final public double getDistanceToParent() {
363 return _distance_parent;
367 * Convenience method. Returns the first child node of this node.
369 * [last modified May 18, 2005 by CMZ]
371 * @return the first child node of this node
373 public final PhylogenyNode getFirstChildNode() {
374 return getChildNode( 0 );
378 * Returns the _indicator value of this PhylogenyNode.
380 public final byte getIndicator() {
385 * Convenience method. Returns the last child node of this node.
387 * [last modified May 18, 2005 by CMZ]
389 * @return the last child node of this node
391 public final PhylogenyNode getLastChildNode() {
392 return getChildNode( getNumberOfDescendants() - 1 );
396 * Returns a refernce to the linked PhylogenyNode of this PhylogenyNode.
397 * Currently, this method is only used for the speciation-_duplication
398 * assignment algorithms.
400 public final PhylogenyNode getLink() {
405 * Returns a refernce to the next external PhylogenyNode of this
406 * PhylogenyNode. TODO should be in Phylogeny. Returns null if no next
407 * external node is available.
409 public final PhylogenyNode getNextExternalNode() {
410 if ( isInternal() ) {
411 throw new UnsupportedOperationException( "attempt to get next external node of an internal node" );
413 else if ( isLastExternalNode() ) {
416 int index = getChildNodeIndex();
417 PhylogenyNode previous_node = this;
418 PhylogenyNode current_node = getParent();
419 while ( !current_node.isRoot()
420 && ( ( current_node.getNumberOfDescendants() == 1 ) || previous_node.isLastChildNode() ) ) {
421 index = current_node.getChildNodeIndex();
422 previous_node = current_node;
423 current_node = current_node.getParent();
425 current_node = current_node.getChildNode( index + 1 );
426 while ( current_node.isInternal() ) {
427 current_node = current_node.getFirstChildNode();
432 public final PhylogenyNode getNextExternalNodeWhileTakingIntoAccountCollapsedNodes() {
434 if ( isInternal() && !isCollapse() ) {
435 throw new UnsupportedOperationException( "attempt to get next external node of an uncollapsed internal node" );
440 if ( getParent().isCollapse() ) {
441 throw new UnsupportedOperationException( "attempt to get next external node of node with a collapsed parent" );
443 // This checks if last node.
444 PhylogenyNode n = this;
446 while ( !n.isRoot() ) {
447 if ( !n.isLastChildNode() ) {
456 int index = getChildNodeIndex();
457 PhylogenyNode previous_node = this;
458 PhylogenyNode current_node = getParent();
459 while ( !current_node.isRoot()
460 && ( current_node.isCollapse() || ( current_node.getNumberOfDescendants() == 1 ) || previous_node
461 .isLastChildNode() ) ) {
462 index = current_node.getChildNodeIndex();
463 previous_node = current_node;
464 current_node = current_node.getParent();
466 if ( index < ( current_node.getNumberOfDescendants() - 1 ) ) {
467 current_node = current_node.getChildNode( index + 1 );
469 while ( current_node.isInternal() && !current_node.isCollapse() ) {
470 current_node = current_node.getFirstChildNode();
475 public final NodeData getNodeData() {
476 if ( _node_data == null ) {
477 _node_data = new NodeData();
482 final NodeData getNodeDataDirectly() {
486 // ---------------------------------------------------------
487 // Set and get methods for Nodes
488 // ---------------------------------------------------------
490 * Returns the ID (int) of this PhylogenyNode.
492 final public long getId() {
496 final public String getName() {
497 return getNodeData().getNodeName();
500 final public List<PhylogenyNode> getAllDescendants() {
504 final public int getNumberOfDescendants() {
505 if ( _descendants == null ) {
508 return _descendants.size();
512 * Returns the total number of external Nodes originating from this
513 * PhylogenyNode (int).
515 final public int getNumberOfExternalNodes() {
516 return _sum_ext_nodes;
519 final public int getNumberOfParents() {
524 * Returns a refernce to the parent PhylogenyNode of this PhylogenyNode.
526 final public PhylogenyNode getParent() {
531 * Returns a refernce to the next external PhylogenyNode of this
532 * PhylogenyNode. TODO should be in Phylogeny. Returns null if no next
533 * external node is available.
535 final public PhylogenyNode getPreviousExternalNode() {
536 if ( isInternal() ) {
537 throw new UnsupportedOperationException( "Cannot get the previous external node for an internal node." );
539 else if ( isRoot() /* TODO && tree is rooted */) {
540 throw new UnsupportedOperationException( "Cannot get the previous external node for a root node." );
542 else if ( isFirstExternalNode() ) {
543 throw new UnsupportedOperationException( "Attempt to get previous external node of the first external node." );
545 int index = getChildNodeIndex();
546 PhylogenyNode previous_node = this;
547 PhylogenyNode current_node = getParent();
548 while ( !current_node.isRoot()
549 && ( ( current_node.getNumberOfDescendants() == 1 ) || previous_node.isFirstChildNode() ) ) {
550 index = current_node.getChildNodeIndex();
551 previous_node = current_node;
552 current_node = current_node.getParent();
554 current_node = current_node.getChildNode( index - 1 );
555 while ( current_node.isInternal() ) {
556 current_node = current_node.getLastChildNode();
562 * Used for drawing of Trees.
564 final public float getXcoord() {
568 final public float getXSecondary() {
573 * Used for drawing of Trees.
575 final public float getYcoord() {
579 final public float getYSecondary() {
584 final public int hashCode() {
585 final NodeData data = getNodeData();
586 if ( ( getName().length() < 1 ) && !data.isHasSequence() && !data.isHasTaxonomy() ) {
587 return super.hashCode();
589 int result = getName().hashCode();
590 if ( data.isHasSequence() ) {
591 result ^= data.getSequence().hashCode();
593 if ( data.isHasTaxonomy() ) {
594 result ^= data.getTaxonomy().hashCode();
599 // final private void init() {
600 //_descendants = new ArrayList<PhylogenyNode>();
601 // _parent = null; //TODO not needed?
602 // _id = 0; //TODO not needed?
603 //initializeData(); //TODO not needed?
606 * Deletes data of this PhylogenyNode. Links to the other Nodes in the
607 * Phylogeny, the ID and the sum of external nodes are NOT deleted. Field
608 * "_link" (_link to Nodes in other Phylogeny) IS deleted.
610 * @see #getLink() (Last modified: 12/20/03)
612 // final private void initializeData() {
616 // //_node_name = "";
617 // _distance_parent = PhylogenyDataUtil.BRANCH_LENGTH_DEFAULT;
618 // _collapse = false;
620 // _branch_data = null;
621 // _node_data = null;
624 * Returns whether this PhylogenyNode should be drawn as collapsed.
626 final public boolean isCollapse() {
631 * Returns true if this PhylogenyNode represents a _duplication event, false
634 final public boolean isDuplication() {
635 return getNodeData().isHasEvent() && getNodeData().getEvent().isDuplication();
639 * Checks whether this PhylogenyNode is external (tip).
641 * @return true if this PhylogenyNode is external, false otherwise
643 final public boolean isExternal() {
644 if ( _descendants == null ) {
647 return ( getNumberOfDescendants() < 1 );
653 * @return DOCUMENT ME!
655 final public boolean isFirstChildNode() {
656 if ( isRoot() /* and tree is rooted TODO */) {
657 throw new UnsupportedOperationException( "Cannot determine whether the root is the first child node of its _parent." );
659 return ( getChildNodeIndex() == 0 );
665 * @return DOCUMENT ME!
667 final public boolean isFirstExternalNode() {
668 if ( isInternal() ) {
671 PhylogenyNode node = this;
672 while ( !node.isRoot() ) {
673 if ( !node.isFirstChildNode() ) {
676 node = node.getParent();
682 * Returns whether a _duplication or speciation event has been assigned for
683 * this PhylogenyNode.
685 final public boolean isHasAssignedEvent() {
686 if ( !getNodeData().isHasEvent() ) {
689 if ( ( getNodeData().getEvent() ).isUnassigned() ) {
696 * Checks whether this PhylogenyNode is internal (tip).
698 * @return true if this PhylogenyNode is external, false otherwise
700 final public boolean isInternal() {
701 return ( !isExternal() );
705 * Returns true if this node is the last child node of its _parent.
707 * [last modified June 01, 2005 by CMZ]
709 * @return true if this node is the last child node of its _parent, false
712 final public boolean isLastChildNode() {
713 if ( isRoot() /* and tree is rooted TODO */) {
714 throw new UnsupportedOperationException( "Cannot determine whether the root is the last child node of its _parent." );
716 return ( getChildNodeIndex() == ( getParent().getNumberOfDescendants() - 1 ) );
722 * @return DOCUMENT ME!
724 final public boolean isLastExternalNode() {
725 if ( isInternal() ) {
728 PhylogenyNode node = this;
729 while ( !node.isRoot() ) {
730 if ( !node.isLastChildNode() ) {
733 node = node.getParent();
738 public final int calculateDepth() {
739 PhylogenyNode n = this;
741 while ( n._parent != null ) {
748 public final double calculateDistanceToRoot() {
749 PhylogenyNode n = this;
751 while ( n._parent != null ) {
752 if ( n._distance_parent > 0.0 ) {
753 d += n._distance_parent;
761 * Checks whether this PhylogenyNode is a root.
763 * @return true if this PhylogenyNode is the root, false otherwise
765 final public boolean isRoot() {
766 return _parent == null;
769 final public boolean isSpeciation() {
770 return getNodeData().isHasEvent() && getNodeData().getEvent().isSpeciation();
773 // ---------------------------------------------------------
775 // ---------------------------------------------------------
777 * Prints to the console the subtree originating from this PhylogenyNode in
780 public void preorderPrint() {
781 System.out.println( this + "\n" );
782 if ( isInternal() ) {
783 for( int i = 0; i < getNumberOfDescendants(); ++i ) {
784 getChildNode( i ).preorderPrint();
789 final public void removeChildNode( final int i ) {
790 if ( isExternal() ) {
791 throw new UnsupportedOperationException( "cannot get the child node for a external node." );
793 if ( ( i >= getNumberOfDescendants() ) || ( i < 0 ) ) {
794 throw new IllegalArgumentException( "attempt to get child node " + i + " of a node with "
795 + getNumberOfDescendants() + " child nodes." );
797 getDescendants().remove( i );
800 final public void removeChildNode( final PhylogenyNode remove_me ) {
801 removeChildNode( remove_me.getChildNodeIndex() );
804 final public void setBranchData( final BranchData branch_data ) {
805 _branch_data = branch_data;
809 * Sets the first child PhylogenyNode of this PhylogenyNode to n.
811 final public void setChild1( final PhylogenyNode n ) {
812 setChildNode( 0, n );
816 * Sets the second child PhylogenyNode of this PhylogenyNode to n.
818 final public void setChild2( final PhylogenyNode n ) {
819 setChildNode( 1, n );
823 * Inserts PhylogenyNode n at the specified position i into the list of
824 * child nodes. This does not allow null slots in the list of child nodes:
825 * If i is larger than the number of child nodes, n is just added to the
826 * list, not place at index i.
829 * the index of position where to add the child
831 * the PhylogenyNode to add
833 final public void setChildNode( final int i, final PhylogenyNode node ) {
834 node.setParent( this );
835 if ( getNumberOfDescendants() <= i ) {
836 addChildNode( node );
839 getDescendants().set( i, node );
843 final void setChildNodeOnly( final int i, final PhylogenyNode node ) {
844 if ( getNumberOfDescendants() <= i ) {
845 addChildNode( node );
848 getDescendants().set( i, node );
853 * Sets whether this PhylogenyNode should be drawn as collapsed.
855 final public void setCollapse( final boolean b ) {
860 * Sets the length of the branch leading to the _parent of this
861 * PhylogenyNode to double d.
863 final public void setDistanceToParent( final double d ) {
864 _distance_parent = d;
868 * Sets the _indicator value of this PhylogenyNode to i.
870 final public void setIndicator( final byte i ) {
874 // --------------------------------------------------------------------
875 // Adjust methods (related to Phylogeny construction and
876 // Phylogeny modification)
877 // --------------------------------------------------------------------
879 * Sets the indicators of all the children of this PhylogenyNode to zero.
881 final void setIndicatorsToZero() {
882 for( final PreorderTreeIterator it = new PreorderTreeIterator( this ); it.hasNext(); ) {
883 it.next().setIndicator( ( byte ) 0 );
888 * Sets the linked PhylogenyNode of this PhylogenyNode to n. Currently, this
889 * method is only used for the speciation-_duplication assignment
892 final public void setLink( final PhylogenyNode n ) {
897 * Sets the name of this node.
899 final public void setName( final String node_name ) {
900 getNodeData().setNodeName( node_name );
904 * Sets the Id of this PhylogenyNode to i. In most cases, this number
905 * should not be set to values lower than getNodeCount() -- which this method
908 synchronized final protected void setId( final long i ) {
909 if ( i < getNodeCount() ) {
910 throw new IllegalArgumentException( "attempt to set node id to a value less than total node count (thus violating the uniqueness of node ids)" );
916 * Sets the _parent PhylogenyNode of this PhylogenyNode to n.
918 final public void setParent( final PhylogenyNode n ) {
923 * Sets the total number of external Nodes originating from this
924 * PhylogenyNode to i (int).
926 final public void setSumExtNodes( final int i ) {
928 throw new IllegalArgumentException( "attempt to set sum of external nodes to less than one" );
934 * Used for drawing of Trees.
936 final public void setXcoord( final float x ) {
940 final public void setXSecondary( final float x_secondary ) {
941 _x_secondary = x_secondary;
946 * Used for drawing of Trees.
948 final public void setYcoord( final float y ) {
952 final public void setYSecondary( final float y_secondary ) {
953 _y_secondary = y_secondary;
956 // ---------------------------------------------------------
957 // Writing of Nodes to Strings
958 // ---------------------------------------------------------
959 final public String toNewHampshire( final boolean simple_nh,
960 final boolean write_distance_to_parent,
961 final NH_CONVERSION_SUPPORT_VALUE_STYLE svs ) {
962 final StringBuilder sb = new StringBuilder();
964 if ( ( svs == NH_CONVERSION_SUPPORT_VALUE_STYLE.AS_INTERNAL_NODE_NAMES ) && !isExternal() ) {
965 if ( getBranchData().isHasConfidences()
966 && ( getBranchData().getConfidence( 0 ).getValue() != Confidence.CONFIDENCE_DEFAULT_VALUE ) ) {
967 data = Confidence.FORMATTER.format( ForesterUtil
968 .round( getBranchData().getConfidence( 0 ).getValue(),
969 PhyloXmlUtil.ROUNDING_DIGITS_FOR_PHYLOXML_DOUBLE_OUTPUT ) );
972 else if ( !ForesterUtil.isEmpty( getName() ) ) {
975 else if ( getNodeData().isHasTaxonomy() ) {
976 if ( !ForesterUtil.isEmpty( getNodeData().getTaxonomy().getTaxonomyCode() ) ) {
977 data = getNodeData().getTaxonomy().getTaxonomyCode();
979 else if ( !ForesterUtil.isEmpty( getNodeData().getTaxonomy().getScientificName() ) ) {
980 data = getNodeData().getTaxonomy().getScientificName();
982 else if ( !ForesterUtil.isEmpty( getNodeData().getTaxonomy().getCommonName() ) ) {
983 data = getNodeData().getTaxonomy().getCommonName();
985 else if ( getNodeData().getTaxonomy().getTaxonomyCode() != null ) {
986 data = getNodeData().getTaxonomy().getTaxonomyCode();
989 else if ( getNodeData().isHasSequence() ) {
990 if ( !ForesterUtil.isEmpty( getNodeData().getSequence().getName() ) ) {
991 data = getNodeData().getSequence().getName();
994 if ( data.length() > 0 ) {
995 data = ForesterUtil.replaceIllegalNhCharacters( data );
996 if ( simple_nh && ( data.length() > 10 ) ) {
997 data = data.substring( 0, 11 );
999 if ( ForesterUtil.isContainsParanthesesableNhCharacter( data ) ) {
1008 if ( write_distance_to_parent && ( getDistanceToParent() != PhylogenyDataUtil.BRANCH_LENGTH_DEFAULT ) ) {
1010 sb.append( getDistanceToParent() );
1012 if ( ( svs == NH_CONVERSION_SUPPORT_VALUE_STYLE.IN_SQUARE_BRACKETS ) && !isExternal()
1013 && getBranchData().isHasConfidences()
1014 && ( getBranchData().getConfidence( 0 ).getValue() != Confidence.CONFIDENCE_DEFAULT_VALUE ) ) {
1016 sb.append( Confidence.FORMATTER.format( ForesterUtil
1017 .round( getBranchData().getConfidence( 0 ).getValue(),
1018 PhyloXmlUtil.ROUNDING_DIGITS_FOR_PHYLOXML_DOUBLE_OUTPUT ) ) );
1021 return sb.toString();
1025 * Swaps the the two childern of a PhylogenyNode node of this Phylogeny.
1027 public final void swapChildren() throws RuntimeException {
1028 if ( isExternal() ) {
1029 throw new RuntimeException( "attempt to swap descendants of external node" );
1031 if ( getNumberOfDescendants() != 2 ) {
1032 throw new RuntimeException( "attempt to swap descendants of node with " + getNumberOfDescendants()
1035 final PhylogenyNode a = getChildNode( 0 );
1036 final PhylogenyNode b = getChildNode( 1 );
1037 setChildNode( 0, b );
1038 setChildNode( 1, a );
1042 * Converts this PhylogenyNode to a New Hampshire X (NHX) String
1045 final public String toNewHampshireX() {
1046 final StringBuffer sb = new StringBuffer();
1047 final StringBuffer s_nhx = new StringBuffer();
1048 if ( !ForesterUtil.isEmpty( getName() ) ) {
1049 final String name = ForesterUtil.replaceIllegalNhCharacters( getName() );
1050 if ( ForesterUtil.isContainsParanthesesableNhCharacter( name ) ) {
1059 if ( getDistanceToParent() != PhylogenyDataUtil.BRANCH_LENGTH_DEFAULT ) {
1061 sb.append( getDistanceToParent() );
1063 if ( getNodeDataDirectly() != null ) {
1064 s_nhx.append( getNodeDataDirectly().toNHX() );
1066 if ( getBranchDataDirectly() != null ) {
1067 s_nhx.append( getBranchDataDirectly().toNHX() );
1069 if ( s_nhx.length() > 0 ) {
1070 sb.append( "[&&NHX" );
1074 return sb.toString();
1078 final public String toString() {
1079 final StringBuilder sb = new StringBuilder();
1080 if ( getNodeData().isHasTaxonomy() ) {
1081 if ( !ForesterUtil.isEmpty( getNodeData().getTaxonomy().getScientificName() ) ) {
1082 sb.append( getNodeData().getTaxonomy().getScientificName() );
1085 else if ( ( sb.length() <= 1 ) && !ForesterUtil.isEmpty( getNodeData().getTaxonomy().getTaxonomyCode() ) ) {
1086 sb.append( getNodeData().getTaxonomy().getTaxonomyCode() );
1089 else if ( getNodeData().getTaxonomy().getIdentifier() != null ) {
1090 sb.append( getNodeData().getTaxonomy().getIdentifier().toString() );
1094 if ( getNodeData().isHasSequence() ) {
1095 if ( !ForesterUtil.isEmpty( getNodeData().getSequence().getName() ) ) {
1096 sb.append( getNodeData().getSequence().getName() );
1099 if ( !ForesterUtil.isEmpty( getNodeData().getSequence().getSymbol() ) ) {
1100 sb.append( getNodeData().getSequence().getSymbol() );
1103 if ( !ForesterUtil.isEmpty( getNodeData().getSequence().getGeneName() ) ) {
1104 sb.append( getNodeData().getSequence().getGeneName() );
1107 if ( getNodeData().getSequence().getAccession() != null ) {
1108 sb.append( getNodeData().getSequence().getAccession().toString() );
1112 if ( ( sb.length() <= 1 ) && !ForesterUtil.isEmpty( getName() ) ) {
1113 sb.append( getName() );
1116 if ( sb.length() <= 1 ) {
1118 sb.append( getId() );
1121 return sb.toString().trim();
1125 * Decreases the total number of all Nodes created so far by one.
1127 final static synchronized void decreaseNodeCount() {
1132 * Returns the total number of all Nodes created so far.
1134 * @return total number of Nodes (long)
1136 synchronized final public static long getNodeCount() {
1141 * Increases the total number of all Nodes created so far by one.
1143 synchronized final private static void increaseNodeCount() {
1148 * Sets the total number of all Nodes created so far to i.
1150 synchronized final static void setNodeCount( final long i ) {
1151 PhylogenyNode.NODE_COUNT = i;
1154 public static PhylogenyNode createInstanceFromNhxString( final String nhx ) throws NHXFormatException,
1155 PhyloXmlDataFormatException {
1156 return new PhylogenyNode( nhx, NHXParser.TAXONOMY_EXTRACTION.NO, false );
1159 public static PhylogenyNode createInstanceFromNhxString( final String nhx,
1160 final NHXParser.TAXONOMY_EXTRACTION taxonomy_extraction )
1161 throws NHXFormatException, PhyloXmlDataFormatException {
1162 return new PhylogenyNode( nhx, taxonomy_extraction, false );
1165 public static PhylogenyNode createInstanceFromNhxString( final String nhx,
1166 final NHXParser.TAXONOMY_EXTRACTION taxonomy_extraction,
1167 final boolean replace_underscores )
1168 throws NHXFormatException, PhyloXmlDataFormatException {
1169 return new PhylogenyNode( nhx, taxonomy_extraction, replace_underscores );
1172 private PhylogenyNode( final String nhx,
1173 final NHXParser.TAXONOMY_EXTRACTION taxonomy_extraction,
1174 final boolean replace_underscores ) throws NHXFormatException, PhyloXmlDataFormatException {
1175 NHXParser.parseNHX( nhx, this, taxonomy_extraction, replace_underscores );
1176 setId( PhylogenyNode.getNodeCount() );
1177 PhylogenyNode.increaseNodeCount();
1178 setSumExtNodes( 1 ); // For ext node, this number is 1 (not 0!!).