00001 /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */ 00002 /* ==================================================================== 00003 * Copyright (c) 1995-2002 Carnegie Mellon University. All rights 00004 * reserved. 00005 * 00006 * Redistribution and use in source and binary forms, with or without 00007 * modification, are permitted provided that the following conditions 00008 * are met: 00009 * 00010 * 1. Redistributions of source code must retain the above copyright 00011 * notice, this list of conditions and the following disclaimer. 00012 * 00013 * 2. Redistributions in binary form must reproduce the above copyright 00014 * notice, this list of conditions and the following disclaimer in 00015 * the documentation and/or other materials provided with the 00016 * distribution. 00017 * 00018 * This work was supported in part by funding from the Defense Advanced 00019 * Research Projects Agency and the National Science Foundation of the 00020 * United States of America, and the CMU Sphinx Speech Consortium. 00021 * 00022 * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND 00023 * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 00024 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00025 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY 00026 * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 00027 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 00028 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 00029 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 00030 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 00031 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 00032 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00033 * 00034 * ==================================================================== 00035 * 00036 */ 00037 /* 00038 * sort.h -- Packaged I/O routines. 00039 * 00040 * ********************************************** 00041 * CMU ARPA Speech Project 00042 * 00043 * Copyright (c) 1996 Carnegie Mellon University. 00044 * ALL RIGHTS RESERVED. 00045 * ********************************************** 00046 * 00047 * HISTORY 00048 * 00049 * $Log$ 00050 * Revision 1.1 2006/04/05 20:27:30 dhdfu 00051 * A Great Reorganzation of header files and executables 00052 * 00053 * Revision 1.2 2006/02/24 03:15:17 arthchan2003 00054 * Merged from branch SPHINX3_5_2_RCI_IRII_BRANCH: Added a customized sorting algorithm. 00055 * 00056 * Revision 1.1.2.1 2005/09/25 19:38:00 arthchan2003 00057 * Added a stupid insertion sorting routine. It was used in gau_select (now gauvq) and gau_read. 00058 * 00059 * 00060 * 05-Jan-2004 A. Chan (archan@cs.cmu.edu) at Carnegie Mellon University 00061 * created. 00062 */ 00063 00064 #ifndef _LIBUTIL_SORT_H_ 00065 #define _LIBUTIL_SORT_H_ 00066 00067 #include <stdlib.h> 00068 00069 #include "prim_type.h" 00070 00071 00072 #ifdef __cplusplus 00073 extern "C" { 00074 #endif 00075 #if 0 00076 /* Fool Emacs. */ 00077 } 00078 #endif 00079 00080 typedef struct { 00081 int32 key; 00082 float32 val; 00083 } sort_t; 00084 00085 typedef struct { 00086 sort_t* s_array; 00087 int32 size; 00088 } sort_array_t; 00089 00090 void init_sort_array(int size, sort_array_t *s); 00091 void change_size(int size,sort_array_t *s); 00092 void free_sort_array(sort_array_t *s); 00093 void print_sort_array(sort_array_t *s); 00094 void reverse_sort_array(sort_array_t *s); 00095 void insertion_sort(sort_array_t *s); /* Sorting an array to a descending order*/ 00096 00097 #ifdef __cplusplus 00098 } 00099 #endif 00100 00101 00102 #endif