Main Page
Classes
Files
File List
File Members
include
sort.h
Go to the documentation of this file.
1
/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
2
/* ====================================================================
3
* Copyright (c) 1995-2002 Carnegie Mellon University. All rights
4
* reserved.
5
*
6
* Redistribution and use in source and binary forms, with or without
7
* modification, are permitted provided that the following conditions
8
* are met:
9
*
10
* 1. Redistributions of source code must retain the above copyright
11
* notice, this list of conditions and the following disclaimer.
12
*
13
* 2. Redistributions in binary form must reproduce the above copyright
14
* notice, this list of conditions and the following disclaimer in
15
* the documentation and/or other materials provided with the
16
* distribution.
17
*
18
* This work was supported in part by funding from the Defense Advanced
19
* Research Projects Agency and the National Science Foundation of the
20
* United States of America, and the CMU Sphinx Speech Consortium.
21
*
22
* THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND
23
* ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
24
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
25
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
26
* NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
27
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
28
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
32
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33
*
34
* ====================================================================
35
*
36
*/
37
/*
38
* sort.h -- Packaged I/O routines.
39
*
40
* **********************************************
41
* CMU ARPA Speech Project
42
*
43
* Copyright (c) 1996 Carnegie Mellon University.
44
* ALL RIGHTS RESERVED.
45
* **********************************************
46
*
47
* HISTORY
48
*
49
* $Log$
50
* Revision 1.1 2006/04/05 20:27:30 dhdfu
51
* A Great Reorganzation of header files and executables
52
*
53
* Revision 1.2 2006/02/24 03:15:17 arthchan2003
54
* Merged from branch SPHINX3_5_2_RCI_IRII_BRANCH: Added a customized sorting algorithm.
55
*
56
* Revision 1.1.2.1 2005/09/25 19:38:00 arthchan2003
57
* Added a stupid insertion sorting routine. It was used in gau_select (now gauvq) and gau_read.
58
*
59
*
60
* 05-Jan-2004 A. Chan (archan@cs.cmu.edu) at Carnegie Mellon University
61
* created.
62
*/
63
64
#ifndef _LIBUTIL_SORT_H_
65
#define _LIBUTIL_SORT_H_
66
67
#include <stdlib.h>
68
69
#include "prim_type.h"
70
71
72
#ifdef __cplusplus
73
extern
"C"
{
74
#endif
75
#if 0
76
/* Fool Emacs. */
77
}
78
#endif
79
80
typedef
struct
{
81
int32
key
;
82
float32
val
;
83
}
sort_t
;
84
85
typedef
struct
{
86
sort_t
*
s_array
;
87
int32
size
;
88
}
sort_array_t
;
89
90
void
init_sort_array
(
int
size,
sort_array_t
*s);
91
void
change_size
(
int
size,
sort_array_t
*s);
92
void
free_sort_array
(
sort_array_t
*s);
93
void
print_sort_array
(
sort_array_t
*s);
94
void
reverse_sort_array
(
sort_array_t
*s);
95
void
insertion_sort
(
sort_array_t
*s);
/* Sorting an array to a descending order*/
96
97
#ifdef __cplusplus
98
}
99
#endif
100
101
102
#endif
Generated by
1.8.3.1