/*****************************************************************************
#   Copyright (C) 1994-2008 by David Gordon.
#   All rights reserved.                           
#                                                                           
#   This software is part of a beta-test version of the Consed/Autofinish
#   package.  It should not be redistributed or
#   used for any commercial purpose, including commercially funded
#   sequencing, without written permission from the author and the
#   University of Washington.
#   
#   This software is provided ``AS IS'' and any express or implied
#   warranties, including, but not limited to, the implied warranties of
#   merchantability and fitness for a particular purpose, are disclaimed.
#   In no event shall the authors or the University of Washington be
#   liable for any direct, indirect, incidental, special, exemplary, or
#   consequential damages (including, but not limited to, procurement of
#   substitute goods or services; loss of use, data, or profits; or
#   business interruption) however caused and on any theory of liability,
#   whether in contract, strict liability, or tort (including negligence
#   or otherwise) arising in any way out of the use of this software, even
#   if advised of the possibility of such damage.
#
#   Building Consed from source is error prone and not simple which is
#   why I provide executables.  Due to time limitations I cannot
#   provide any assistance in building Consed.  Even if you do not
#   modify the source, you may introduce errors due to using a
#   different version of the compiler, a different version of motif,
#   different versions of other libraries than I used, etc.  For this
#   reason, if you discover Consed bugs, I can only offer help with
#   those bugs if you first reproduce those bugs with an executable
#   provided by me--not an executable you have built.
# 
#   Modifying Consed is also difficult.  Although Consed is modular,
#   some modules are used by many other modules.  Thus making a change
#   in one place can have unforeseen effects on many other features.
#   It may takes months for you to notice these other side-effects
#   which may not seen connected at all.  It is not feasable for me to
#   provide help with modifying Consed sources because of the
#   potentially huge amount of time involved.
#
#*****************************************************************************/
#ifndef soGetBranchNameWithoutTree_included
#define soGetBranchNameWithoutTree_included


static const int nOnBackbone = 1;
static const int nDownToRight = 2;



// internal node 0 is the top of the tree where MMul and PPyg come from
// internal node 3 is where PPan and PTro come from
// internal node -1 doesn't exist, but is used to refer to the branch
// from internal node 0 to MMul

static RWCString soGetBranchNameWithoutTree( const int nInternalNode,
                                   const int nOnBackboneOrDownToRight ) {

   assert( nOnBackboneOrDownToRight == nOnBackbone ||
           nOnBackboneOrDownToRight == nDownToRight );


   if ( nInternalNode == -1 ) {
      return( "MMul_ex" );
   }


   if ( nInternalNode == 3 ) {
      if ( nOnBackboneOrDownToRight == nOnBackbone ) {
         return( "PPan_ex" );
      }
      else {
         return( "PTro_ex" );
      }
   }


   RWCString soSpecies;

   switch( nInternalNode ) {
   case 0:
      soSpecies = "PPyg";
      break;
   case 1:
      soSpecies = "GGor";
      break;
   case 2:
      soSpecies = "HSap";
      break;
   default:
      cerr << "nInternalNode = " << nInternalNode << endl;
      cerr.flush();
      assert( false );
   }

   if ( nOnBackboneOrDownToRight == nOnBackbone ) {
      soSpecies += "_in";
   }
   else {
      soSpecies += "_ex";
   }

   return soSpecies;
}






#endif