/*****************************************************************************
#   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.
#
#*****************************************************************************/
#include    "rwtvalorderedvector.h"
#include    "assert.h"


template <class TP>
RWTValOrderedVector<TP> :: RWTValOrderedVector( const RWTValOrderedVector<TP>& aArray ) {

   pArray_ = new TP[ aArray.nMaxLength_ ];
   nMaxLength_ = aArray.nMaxLength_;
   nCurrentLength_ = aArray.nCurrentLength_;

   for( int n = 0; n < nCurrentLength_; ++n )
     pArray_[ n ] = aArray.pArray_[ n ];
}


template <class TP>
void RWTValOrderedVector<TP> :: increaseCurrentLength( const size_t nNewLength,
                                                const TP& valDefault ) {

   if ( nMaxLength_ < nNewLength )
      resize( nNewLength );

   size_t nOldCurrentLength_ = nCurrentLength_;

   nCurrentLength_ = nNewLength;

   for( size_t n = nOldCurrentLength_; n < nCurrentLength_; ++n )
      pArray_[n] = valDefault;
}


template <class TP>
void RWTValOrderedVector<TP> :: increaseButNotDecreaseMaxLength(
        const size_t nNewMaxLength ) {

   if ( nNewMaxLength <= nMaxLength_ ) 
      return;

   resize( nNewMaxLength );
}



template <class TP>
void RWTValOrderedVector<TP> :: increaseMaxLengthIfNecessary( 
        const size_t nExtraRoomNeeded ) {

   int nMaxLengthNeeded = nCurrentLength_ + nExtraRoomNeeded;

   if ( nMaxLengthNeeded > nMaxLength_ ) 
      resize( nMaxLengthNeeded );


}
   

template <class TP>
void RWTValOrderedVector<TP> :: substring( const RWTValOrderedVector<TP>& aArray,
                                           const int nStart,
                                           const int nLength ) {


   // do some checks first:

   assert( 0 <= nStart );
   assert( nStart + nLength <= aArray.length() );

   int nNewSize = nLength; // just so code is the same as resize
   TP* pTemp = new TP[ nNewSize ];
   if ( !pTemp ) {
      PANIC_OST( ost ) <<
         "RWTValOrderedVector::substring() with nStart = " << nStart <<
         " nLength = " << nLength << " could not get enough memory" << ends;
      throw RWInternalError( ost.str().c_str() );
   }

   for( int nIndex = 0; nIndex < nLength; ++nIndex )
      pTemp[ nIndex ] = aArray.pArray_[ nStart + nIndex ];
   
   delete [] pArray_;
   pArray_ = pTemp;
   nMaxLength_ = nNewSize;

   nCurrentLength_ = nNewSize;
}

   
template <class TP>
void RWTValOrderedVector<TP> :: appendArray( const RWTValOrderedVector& aArrayToAppend ) {

   increaseMaxLengthIfNecessary( aArrayToAppend.length() );

   for( int n = 0; n < aArrayToAppend.length(); ++n ) {
      pArray_[ nCurrentLength_ + n ] = aArrayToAppend.pArray_[n];
   }

   nCurrentLength_ += aArrayToAppend.length();
}