Edinburgh Speech Tools  2.1-release
EST_Relation_mls.h
Go to the documentation of this file.
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 Multi-linear structure relations */
35 /* */
36 /*************************************************************************/
37 #ifndef __EST_RELATION_MLS_H__
38 #define __EST_RELATION_MLS_H__
39 
40 #include "EST_Item.h"
41 
42 inline EST_Item *link1(EST_Item *n) { return n->down()->down()->down(); }
43 inline EST_Item *link2(EST_Item *n)
44  { return n->down()->down()->next()->down(); }
45 inline EST_Item *linkn(EST_Item *n)
46  { return n->down()->down()->last()->down(); }
47 EST_Item *link(int l,EST_Item *n);
48 
50  { return n->up()->first()->up()->up(); }
51 int linked(EST_Item *from, EST_Item *to);
52 
53 inline EST_Item *next_link(EST_Item *n) { return n->up()->next()->down(); }
54 
55 void add_link(EST_Item *from, EST_Item *to);
56 void remove_link(EST_Item *from, EST_Item *to);
57 
58 #endif
EST_Item * last() const
Definition: EST_Item.cc:329
EST_Item * first() const
Definition: EST_Item.cc:339
EST_Item * linkedfrom(EST_Item *n)
int linked(EST_Item *from, EST_Item *to)
EST_Item * up() const
Definition: EST_Item.h:354
EST_Item * link(int l, EST_Item *n)
EST_Item * down() const
Definition: EST_Item.h:352
EST_Item * link1(EST_Item *n)
void remove_link(EST_Item *from, EST_Item *to)
EST_Item * next() const
Definition: EST_Item.h:348
void add_link(EST_Item *from, EST_Item *to)
EST_Item * linkn(EST_Item *n)
EST_Item * next_link(EST_Item *n)
EST_Item * link2(EST_Item *n)