1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
// { dg-do run }
#include <stdlib.h>
#include <string.h>
template <class T>
class List {
public:
int len;
T *array;
int length() const { return( len ); }
List() : len( 0 ), array( 0 ) {}
};
template <class T>
int AlgoStdCompare(const T* a, const T* b) {
if (*a < *b)
return -1;
else
return (*a > *b); // 0 if equal, 1 if greater
}
int AlgoStdCompare(const char* const* a, const char * const*b)
{
return strcmp(*a,*b);
}
template <class T>
void AlgoFixupSort(List< T >* , int, int ) {
}
template <class T>
void AlgoSort(int (*compare)(const T *, const T *),
void (*fixup)( List<T> *, int first, int last),
List< T >* theList, int first, int last) {
if (last < 0)
last = theList->length()-1;
qsort(theList->array+first, last-first+1, sizeof(T),
(int (*)(const void *, const void *))compare);
if (fixup)
fixup(theList, first, last);
}
template <class T>
void AlgoSort(List< T >* theList, int first = 0, int last = -1) {
int (*compare)(const T*, const T*) = AlgoStdCompare;
void (*fixup)( List<T> *, int first, int last) = AlgoFixupSort;
AlgoSort(compare, fixup, theList, first, last);
}
int
main()
{
List<const char *> slist;
AlgoSort( &slist );
List<int> ilist;
AlgoSort( &ilist );
}
|
