"Fossies" - the Fresh Open Source Software Archive  

Source code changes of the file "include/ling_class/EST_Relation_list.h" between
speech_tools-2.4-release.tar.gz and speech_tools-2.5.0-release.tar.gz

About: The speech_tools - Edinburgh Speech Tools Library (used by the Festival Speech Synthesis System).

EST_Relation_list.h  (speech_tools-2.4-release)	:	EST_Relation_list.h  (speech_tools-2.5.0-release)
skipping to change at line 40		skipping to change at line 40
/*************************************************************************/		/*************************************************************************/
/* Author : Alan W Black */		/* Author : Alan W Black */
/* Date : February 1998 */		/* Date : February 1998 */
/* --------------------------------------------------------------------- */		/* --------------------------------------------------------------------- */
/* Functions for LIST relations */		/* Functions for LIST relations */
/* */		/* */
/*************************************************************************/		/*************************************************************************/
#ifndef __EST_RELATION_LIST_H__		#ifndef __EST_RELATION_LIST_H__
#define __EST_RELATION_LIST_H__		#define __EST_RELATION_LIST_H__
#if 0
/**@name Functions for building and traversing list relations
*/
//@{
/**@name List traversal functions */
//@{
/** return next item of <parameter>n</parameter>
*/
inline EST_Item *next(const EST_Item *n) { return n->next(); }
/** return previous item of <parameter>n</parameter>
*/
inline EST_Item *prev(const EST_Item *n) { return n->prev(); }
/** return last item in <parameter>n</parameter>'s relation
*/
inline EST_Item *last(const EST_Item *n) { return n->last(); }
/** return first item in <parameter>n</parameter>'s relation
*/
inline EST_Item *first(const EST_Item *n) { return n->first(); }
/** return next item of <parameter>n</parameter> as seen from relation
<parameter>relname</parameter> */
inline EST_Item *next(const EST_Item *n,const char *relname)
{ return next(as(n,relname)); }
/** return previous item of <parameter>n</parameter> as seen from relation
<parameter>relname</parameter> */
inline EST_Item *prev(const EST_Item *n,const char *relname)
{ return prev(as(n,relname)); }
/** return first item of <parameter>n</parameter> as seen from relation
<parameter>relname</parameter> */
inline EST_Item *first(const EST_Item *n,const char *relname)
{ return first(as(n,relname)); }
/** return last item of <parameter>n</parameter> as seen from relation
<parameter>relname</parameter> */
inline EST_Item *last(const EST_Item *n,const char *relname)
{ return last(as(n,relname)); }
#endif
/** Given a node <parameter>l</parameter>, return true if		/** Given a node <parameter>l</parameter>, return true if
<parameter>c</parameter> after it in a list relation. */		<parameter>c</parameter> after it in a list relation. */
int in_list(const EST_Item *c, const EST_Item *l);		int in_list(const EST_Item *c, const EST_Item *l);
/** Add a item after node <parameter>n</parameter>, and return the new		/** Add a item after node <parameter>n</parameter>, and return the new
item. If <parameter>n</parameter> is the first item in the list, the		item. If <parameter>n</parameter> is the first item in the list, the
new item becomes the head of the list, otherwise it is inserted between		new item becomes the head of the list, otherwise it is inserted between
<parameter>n</parameter> and it's previous current item.		<parameter>n</parameter> and it's previous current item.
If <parameter>p</parameter> is 0, make a new node for the new		If <parameter>p</parameter> is 0, make a new node for the new
item, otherwise add <parameter>p</parameter> to this relation as the		item, otherwise add <parameter>p</parameter> to this relation as the
End of changes. 1 change blocks.
46 lines changed or deleted		0 lines changed or added

---