AccumulatingSort< T > Class Template Reference

#include <AccumulatingSort.h>

Public Member Functions
	AccumulatingSort (const uint32_t &aSize)
void	Merge (const std::vector< T > &aInput, std::vector< T > &aOutput)

Private Member Functions
void	AccumulatorUnit (const std::list< T > &aInput, T &aAcc, std::list< T > &aTail)

Private Attributes
uint32_t	mSize
std::vector< std::list< T > >	mSortArrays

Detailed Description

template<typename T>
class AccumulatingSort< T >

Definition at line 7 of file AccumulatingSort.h.

Constructor & Destructor Documentation

template<typename T>

AccumulatingSort< T >::AccumulatingSort ( const uint32_t &  aSize )

inline

Definition at line 36 of file AccumulatingSort.h.

                                              : mSortArrays( aSize+1 , std::list < T >( aSize ) ), mSize( aSize )
    {}

Member Function Documentation

template<typename T>

void AccumulatingSort< T >::AccumulatorUnit ( const std::list< T > &  aInput, T &  aAcc, std::list< T > &  aTail  )

inlineprivate

Definition at line 15 of file AccumulatingSort.h.

Referenced by AccumulatingSort< T >::Merge().

    {
        aTail.clear();

        bool lAccInserted( false );

        for( typename std::list< T >::const_iterator lIt( aInput.begin() ) ; lIt != aInput.end() ; ++lIt )
        {
            if ( !lAccInserted and !( *lIt > aAcc ) ) // Accumulator greater than or equal to new entry and not previously inserted -> Reinsert accumulator
            {
                aTail.push_back( aAcc );
                lAccInserted = true;
            }       
            aTail.push_back( *lIt );
        }

        aAcc = *aTail.begin();
        aTail.erase( aTail.begin() );
    }

template<typename T>

void AccumulatingSort< T >::Merge ( const std::vector< T > &  aInput, std::vector< T > &  aOutput  )

inline

Definition at line 39 of file AccumulatingSort.h.

References AccumulatingSort< T >::AccumulatorUnit(), begin, i, AccumulatingSort< T >::mSize, and AccumulatingSort< T >::mSortArrays.

Referenced by l1t::Stage2Layer2JetAlgorithmFirmwareImp1::accuSort(), l1t::Stage2Layer2TauAlgorithmFirmwareImp1::dosorting(), and l1t::Stage2Layer2EGammaAlgorithmFirmwareImp1::processEvent().

    {
        aOutput.resize( mSize );

        mSortArrays[0].clear();
        mSortArrays[0].insert( mSortArrays[0].begin() , aInput.begin() , aInput.end() );

        for( uint32_t i(0) ; i!=mSize ; ++i ) AccumulatorUnit( mSortArrays[ i ] , aOutput[ i ] , mSortArrays[ i+1 ] );
    }

Member Data Documentation

template<typename T>

uint32_t AccumulatingSort< T >::mSize

private

Definition at line 12 of file AccumulatingSort.h.

Referenced by AccumulatingSort< T >::Merge().

template<typename T>

std::vector< std::list < T > > AccumulatingSort< T >::mSortArrays

private

Definition at line 11 of file AccumulatingSort.h.

Referenced by AccumulatingSort< T >::Merge().