DynaSort.h

Go to the documentation of this file.

#ifndef DYNASORT_H
#define DYNASORT_H

#include "DynaList.h"
#include "DynaArray.h"
#include "DynaAlloc.h"
#include "IDynaComparator.h"

static const int INSERTION_SORT_THRESHOLD = 7;


#define MAKE_SORTLISTTYPE_DEF(C, T) \
    typedef DynaAllocVect<C> T##AllocVect; \
    typedef DynaSortList<C> T##SortList

#define MAKE_SORTARRAYTYPE_DEF(C, T) \
    typedef DynaAllocArray<C> T##AllocArray; \
    typedef DynaSortArray<C> T##SortArray

template <class T> class DynaSortList {
protected:
    static void _mergeSort( T** src, T** dest, int low, int high, IDynaComparator<T*>& comparator );
    static void _swap( T** x, int a, int b );

public:
    static void mergeSort( T** array, int length, int low, int high, IDynaComparator<T*>& comparator );
    static void mergeSort( T** array, int length, IDynaComparator<T*>& comparator );

    static void mergeSort( DynaList<T>* list, int low, int high, IDynaComparator<T*>& comparator );
    static void mergeSort( DynaList<T>* list, IDynaComparator<T*>& comparator );
};

template <class T> class DynaSortArray {
protected:
    static void _mergeSort( T* src, T* dest, int low, int high, IDynaComparator<T>& comparator );
    static void _swap( T* x, int a, int b );

public:
    static void mergeSort( T* array, int length, int low, int high, IDynaComparator<T>& comparator );
    static void mergeSort( T* array, int length, IDynaComparator<T>& comparator );

    static void mergeSort( DynaArray<T>* array, int low, int high, IDynaComparator<T>& comparator );
    static void mergeSort( DynaArray<T>* array, IDynaComparator<T>& comparator );
};


#endif