Edinburgh Speech Tools  2.1-release
EST_sort.h
Go to the documentation of this file.
1 /*************************************************************************/
2 /* */
3 /* Centre for Speech Technology Research */
4 /* University of Edinburgh, UK */
5 /* Copyright (c) 1995,1996 */
6 /* All Rights Reserved. */
7 /* */
8 /* Permission is hereby granted, free of charge, to use and distribute */
9 /* this software and its documentation without restriction, including */
10 /* without limitation the rights to use, copy, modify, merge, publish, */
11 /* distribute, sublicense, and/or sell copies of this work, and to */
12 /* permit persons to whom this work is furnished to do so, subject to */
13 /* the following conditions: */
14 /* 1. The code must retain the above copyright notice, this list of */
15 /* conditions and the following disclaimer. */
16 /* 2. Any modifications must be clearly marked as such. */
17 /* 3. Original authors' names are not deleted. */
18 /* 4. The authors' names are not used to endorse or promote products */
19 /* derived from this software without specific prior written */
20 /* permission. */
21 /* */
22 /* THE UNIVERSITY OF EDINBURGH AND THE CONTRIBUTORS TO THIS WORK */
23 /* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */
24 /* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */
25 /* SHALL THE UNIVERSITY OF EDINBURGH NOR THE CONTRIBUTORS BE LIABLE */
26 /* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */
27 /* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */
28 /* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */
29 /* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */
30 /* THIS SOFTWARE. */
31 /* */
32 /*************************************************************************/
33 /* Author : Simon King */
34 /* Date : January 1997 */
35 /*-----------------------------------------------------------------------*/
36 /* Sorting Functions */
37 /* */
38 /*=======================================================================*/
39 #ifndef __EST_SORT_H__
40 #define __EST_SORT_H__
41 
42 #include "EST_TList.h"
43 
44 // functions in Tlist_aux.C
45 template<class T> bool operator==(const EST_TList<T> &a,const EST_TList<T> &b);
46 template<class T> void sort(EST_TList<T> &a);
47 template<class T> void ptr_sort(EST_TList<T> &a);
48 template<class T> void qsort(EST_TList<T> &a);
49 template<class T> void ptr_qsort(EST_TList<T> &a);
50 template<class T> void sort_unique(EST_TList<T> &l);
51 template<class T> void merge_sort_unique(EST_TList<T> &l, EST_TList<T> &m);
52 
53 
54 #endif // __EST_SORT_H__
void qsort(EST_TList< T > &a)
void sort_unique(EST_TList< T > &l)
Definition: EST_TList.h:317
void ptr_sort(EST_TList< T > &a)
Definition: EST_TList.h:299
void ptr_qsort(EST_TList< T > &a)
Definition: EST_TList.h:311
bool operator==(const EST_TList< T > &a, const EST_TList< T > &b)
Definition: EST_TList.h:274
void merge_sort_unique(EST_TList< T > &l, EST_TList< T > &m)
Definition: EST_TList.h:326
void sort(EST_TList< T > &a)