/*****************************************************************************
#   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 templatesSortedByLibrary_included
#define templatesSortedByLibrary_included

#include    "rwtptrorderedvector.h"
#include    "subcloneTTemplate.h"


class templatesSortedByLibrary : public RWTPtrOrderedVector<subcloneTTemplate> {
public:

   
   static int cmp2( const subcloneTTemplate** ppSub1, 
                    const subcloneTTemplate** ppSub2 ) {
      
      if ( (*ppSub1)->soLibrary_ < (*ppSub2)->soLibrary_ )
         return( -1 );
      else if ( (*ppSub2)->soLibrary_ < (*ppSub1)->soLibrary_ )
         return( 1 );
      else {
         return( 0 );
      }
   }


   void resort2() {
      void* pArray = (void*) data();
      size_t nNumberOfElementsInArray = entries();
      size_t nSizeOfAnElement = sizeof( subcloneTTemplate* );

      qsort( pArray, nNumberOfElementsInArray, nSizeOfAnElement,
             ( ( int(*) ( const void*, const void*) ) cmp2 ));

      
      if ( ! bIsSorted2() ) {
         PANIC_OST( ost ) << "templatesSortedByName::resort2 didn't work" << 
            endl << ends;
         throw ProgramLogicError( ost.str().c_str() );
      }

   }


   bool bIsSorted2() {
      
      int nNumberOfEntries = entries();
      bool bSorted = true;
      if ( nNumberOfEntries >=2 ) {
         for( int nElement = 0; 
              nElement <= nNumberOfEntries - 2;
              ++nElement ) {
            if (
                (operator[]( nElement + 1 ))->soLibrary_ <
                (operator[]( nElement ) )->soLibrary_ ) {
               bSorted = false;
               cerr << "Elements " << nElement << " with value " <<
                  (operator[]( nElement ))->soLibrary_ <<
                  " and " << nElement + 1 << " with value " <<
                  (operator[]( nElement + 1 ))->soLibrary_ <<
                  " are out of order " << endl;
            }
         }
      }
      return( bSorted );
   }

};

#endif