Edinburgh Speech Tools 2.4-release
EST_Relation_list.h
1/*************************************************************************/
2/* */
3/* Centre for Speech Technology Research */
4/* University of Edinburgh, UK */
5/* Copyright (c) 1998 */
6/* All Rights Reserved. */
7/* Permission is hereby granted, free of charge, to use and distribute */
8/* this software and its documentation without restriction, including */
9/* without limitation the rights to use, copy, modify, merge, publish, */
10/* distribute, sublicense, and/or sell copies of this work, and to */
11/* permit persons to whom this work is furnished to do so, subject to */
12/* the following conditions: */
13/* 1. The code must retain the above copyright notice, this list of */
14/* conditions and the following disclaimer. */
15/* 2. Any modifications must be clearly marked as such. */
16/* 3. Original authors' names are not deleted. */
17/* 4. The authors' names are not used to endorse or promote products */
18/* derived from this software without specific prior written */
19/* permission. */
20/* THE UNIVERSITY OF EDINBURGH AND THE CONTRIBUTORS TO THIS WORK */
21/* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */
22/* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */
23/* SHALL THE UNIVERSITY OF EDINBURGH NOR THE CONTRIBUTORS BE LIABLE */
24/* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */
25/* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */
26/* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */
27/* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */
28/* THIS SOFTWARE. */
29/* */
30/*************************************************************************/
31/* Author : Alan W Black */
32/* Date : February 1998 */
33/* --------------------------------------------------------------------- */
34/* Functions for LIST relations */
35/* */
36/*************************************************************************/
37#ifndef __EST_RELATION_LIST_H__
38#define __EST_RELATION_LIST_H__
39
40/** Given a node <parameter>l</parameter>, return true if
41 <parameter>c</parameter> after it in a list relation. */
42int in_list(const EST_Item *c, const EST_Item *l);
43
44
45/** Add a item after node <parameter>n</parameter>, and return the new
46item. If <parameter>n</parameter> is the first item in the list, the
47new item becomes the head of the list, otherwise it is inserted between
48<parameter>n</parameter> and it's previous current item.
49If <parameter>p</parameter> is 0, make a new node for the new
50item, otherwise add <parameter>p</parameter> to this relation as the
51next item in <parameter>n</parameter>'s relation. */
52
53EST_Item *add_after(const EST_Item *n, EST_Item *p=0);
54
55/** Add a item before node <parameter>n</parameter>, and return the new
56item. If <parameter>n</parameter> is the first item in the list, the
57new item becomes the head of the list, otherwise it is inserted between
58<parameter>n</parameter> and it's previous current item.
59If <parameter>p</parameter> is 0, make a new node for the new
60item, otherwise add <parameter>p</parameter> to this relation as the
61previous item in <parameter>n</parameter>'s relation. */
62
63EST_Item *add_before(const EST_Item *n, EST_Item *p=0);
64
65/** Remove the given item.
66*/
67
68void remove_item_list(EST_Relation *rel, EST_Item *n);
69
70//@}
71//@}
72#endif