55 lines
3.3 KiB
C++
55 lines
3.3 KiB
C++
/*************************************************************************/
|
|
/* */
|
|
/* Centre for Speech Technology Research */
|
|
/* University of Edinburgh, UK */
|
|
/* Copyright (c) 1995,1996 */
|
|
/* All Rights Reserved. */
|
|
/* */
|
|
/* Permission is hereby granted, free of charge, to use and distribute */
|
|
/* this software and its documentation without restriction, including */
|
|
/* without limitation the rights to use, copy, modify, merge, publish, */
|
|
/* distribute, sublicense, and/or sell copies of this work, and to */
|
|
/* permit persons to whom this work is furnished to do so, subject to */
|
|
/* the following conditions: */
|
|
/* 1. The code must retain the above copyright notice, this list of */
|
|
/* conditions and the following disclaimer. */
|
|
/* 2. Any modifications must be clearly marked as such. */
|
|
/* 3. Original authors' names are not deleted. */
|
|
/* 4. The authors' names are not used to endorse or promote products */
|
|
/* derived from this software without specific prior written */
|
|
/* permission. */
|
|
/* */
|
|
/* THE UNIVERSITY OF EDINBURGH AND THE CONTRIBUTORS TO THIS WORK */
|
|
/* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */
|
|
/* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */
|
|
/* SHALL THE UNIVERSITY OF EDINBURGH NOR THE CONTRIBUTORS BE LIABLE */
|
|
/* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */
|
|
/* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */
|
|
/* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */
|
|
/* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */
|
|
/* THIS SOFTWARE. */
|
|
/* */
|
|
/*************************************************************************/
|
|
/* Author : Simon King */
|
|
/* Date : January 1997 */
|
|
/*-----------------------------------------------------------------------*/
|
|
/* Sorting Functions */
|
|
/* */
|
|
/*=======================================================================*/
|
|
#ifndef __EST_SORT_H__
|
|
#define __EST_SORT_H__
|
|
|
|
#include "EST_TList.h"
|
|
|
|
// functions in Tlist_aux.C
|
|
template<class T> bool operator==(const EST_TList<T> &a,const EST_TList<T> &b);
|
|
template<class T> void sort(EST_TList<T> &a);
|
|
template<class T> void ptr_sort(EST_TList<T> &a);
|
|
template<class T> void qsort(EST_TList<T> &a);
|
|
template<class T> void ptr_qsort(EST_TList<T> &a);
|
|
template<class T> void sort_unique(EST_TList<T> &l);
|
|
template<class T> void merge_sort_unique(EST_TList<T> &l, EST_TList<T> &m);
|
|
|
|
|
|
#endif // __EST_SORT_H__
|