glist.h
Go to the documentation of this file.
/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
* Copyright (c) 1999-2004 Carnegie Mellon University. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* This work was supported in part by funding from the Defense Advanced
* Research Projects Agency and the National Science Foundation of the
* United States of America, and the CMU Sphinx Speech Consortium.
*
* THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND
* ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
* NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* ====================================================================
*
*/
/*
* glist.h -- Module for maintaining a generic, linear linked-list structure.
*
* **********************************************
* CMU ARPA Speech Project
*
* Copyright (c) 1999 Carnegie Mellon University.
* ALL RIGHTS RESERVED.
* **********************************************
*
* HISTORY
* $Log: glist.h,v $
* Revision 1.9 2005/06/22 03:02:51 arthchan2003
* 1, Fixed doxygen documentation, 2, add keyword.
*
* Revision 1.4 2005/05/03 04:09:11 archan
* Implemented the heart of word copy search. For every ci-phone, every word end, a tree will be allocated to preserve its pathscore. This is different from 3.5 or below, only the best score for a particular ci-phone, regardless of the word-ends will be preserved at every frame. The graph propagation will not collect unused word tree at this point. srch_WST_propagate_wd_lv2 is also as the most stupid in the century. But well, after all, everything needs a start. I will then really get the results from the search and see how it looks.
*
* Revision 1.3 2005/03/30 01:22:48 archan
* Fixed mistakes in last updates. Add
*
*
* 09-Mar-1999 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University
* Added glist_chkdup_*().
*
* 13-Feb-1999 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University
* Created from earlier version.
*/
#ifndef _LIBUTIL_GLIST_H_
#define _LIBUTIL_GLIST_H_
#include <stdlib.h>
/* Win32/WinCE DLL gunk */
#include <sphinxbase/sphinxbase_export.h>
#include <sphinxbase/prim_type.h>
#ifdef __cplusplus
extern "C" {
#endif
#if 0
/* Fool Emacs. */
}
#endif
typedef struct gnode_s {
anytype_t data;
struct gnode_s *next;
} gnode_t;
typedef gnode_t *glist_t;
#define gnode_ptr(g) ((g)->data.ptr)
#define gnode_int32(g) ((g)->data.i)
#define gnode_uint32(g) ((g)->data.ui)
#define gnode_float32(g) ((float32)(g)->data.fl)
#define gnode_float64(g) ((g)->data.fl)
#define gnode_next(g) ((g)->next)
SPHINXBASE_EXPORT
glist_t glist_add_ptr (glist_t g,
void *ptr
);
SPHINXBASE_EXPORT
glist_t glist_add_int32 (glist_t g,
int32 val
);
SPHINXBASE_EXPORT
glist_t glist_add_uint32 (glist_t g,
uint32 val
);
SPHINXBASE_EXPORT
glist_t glist_add_float32 (glist_t g,
float32 val
);
SPHINXBASE_EXPORT
glist_t glist_add_float64 (glist_t g,
float64 val
);
SPHINXBASE_EXPORT
gnode_t *glist_insert_ptr (gnode_t *gn,
void *ptr
);
SPHINXBASE_EXPORT
gnode_t *glist_insert_int32 (gnode_t *gn,
int32 val
);
SPHINXBASE_EXPORT
gnode_t *glist_insert_uint32 (gnode_t *gn,
uint32 val
);
SPHINXBASE_EXPORT
gnode_t *glist_insert_float32 (gnode_t *gn,
float32 val
);
SPHINXBASE_EXPORT
gnode_t *glist_insert_float64 (gnode_t *gn,
float64 val
);
SPHINXBASE_EXPORT
glist_t glist_reverse (glist_t g
);
SPHINXBASE_EXPORT
int32 glist_count (glist_t g
);
SPHINXBASE_EXPORT
void glist_free (glist_t g);
SPHINXBASE_EXPORT
gnode_t *gnode_free(gnode_t *gn,
gnode_t *pred
);
SPHINXBASE_EXPORT
gnode_t *glist_tail (glist_t g);
#ifdef __cplusplus
}
#endif
#endif
glist_add_float32
SPHINXBASE_EXPORT glist_t glist_add_float32(glist_t g, float32 val)
Create and prepend a new list node containing a single-precision float.
Definition: glist.c:110
glist_add_int32
SPHINXBASE_EXPORT glist_t glist_add_int32(glist_t g, int32 val)
Create and prepend a new list node containing an integer.
Definition: glist.c:86
gnode_t
struct gnode_s gnode_t
A node in a generic list.
glist_insert_uint32
SPHINXBASE_EXPORT gnode_t * glist_insert_uint32(gnode_t *gn, uint32 val)
Create and insert a new list node containing an unsigned integer.
Definition: glist.c:215
glist_insert_int32
SPHINXBASE_EXPORT gnode_t * glist_insert_int32(gnode_t *gn, int32 val)
Create and insert a new list node containing an integer.
Definition: glist.c:201
gnode_s
A node in a generic list.
Definition: glist.h:100
prim_type.h
Basic type definitions used in Sphinx.
glist_add_ptr
SPHINXBASE_EXPORT glist_t glist_add_ptr(glist_t g, void *ptr)
Create and prepend a new list node, with the given user-defined data, at the HEAD of the given generi...
Definition: glist.c:74
glist_insert_float64
SPHINXBASE_EXPORT gnode_t * glist_insert_float64(gnode_t *gn, float64 val)
Create and insert a new list node containing a double-precision float.
Definition: glist.c:244
glist_reverse
SPHINXBASE_EXPORT glist_t glist_reverse(glist_t g)
Reverse the order of the given glist.
Definition: glist.c:169
glist_free
SPHINXBASE_EXPORT void glist_free(glist_t g)
Free the given generic list; user-defined data contained within is not automatically freed...
Definition: glist.c:133
gnode_free
SPHINXBASE_EXPORT gnode_t * gnode_free(gnode_t *gn, gnode_t *pred)
Free the given node, gn, of a glist, pred being its predecessor in the list.
Definition: glist.c:257
glist_tail
SPHINXBASE_EXPORT gnode_t * glist_tail(glist_t g)
Return the last node in the given list.
Definition: glist.c:156
glist_insert_float32
SPHINXBASE_EXPORT gnode_t * glist_insert_float32(gnode_t *gn, float32 val)
Create and insert a new list node containing a single-precision float.
Definition: glist.c:230
gnode_s::next
struct gnode_s * next
See prim_type.h.
Definition: glist.h:102
anytype_s
Union of basic types.
Definition: prim_type.h:107
glist_add_float64
SPHINXBASE_EXPORT glist_t glist_add_float64(glist_t g, float64 val)
Create and prepend a new list node containing a double-precision float.
Definition: glist.c:122
glist_add_uint32
SPHINXBASE_EXPORT glist_t glist_add_uint32(glist_t g, uint32 val)
Create and prepend a new list node containing an unsigned integer.
Definition: glist.c:98
glist_count
SPHINXBASE_EXPORT int32 glist_count(glist_t g)
Count the number of element in a given link list.
Definition: glist.c:145
glist_insert_ptr
SPHINXBASE_EXPORT gnode_t * glist_insert_ptr(gnode_t *gn, void *ptr)
Create and insert a new list node, with the given user-defined data, after the given generic node gn...
Definition: glist.c:187