"Fossies" - the Fresh Open Source Software Archive

Member "speech_tools/include/ling_class/EST_Relation_mls.h" (4 Sep 2017, 3358 Bytes) of package /linux/misc/speech_tools-2.5.0-release.tar.gz:

As a special service "Fossies" has tried to format the requested source page into HTML format using (guessed) C and C++ source code syntax highlighting (style: standard) with prefixed line numbers and code folding option. Alternatively you can here view or download the uninterpreted source code file. For more information about "EST_Relation_mls.h" see the Fossies "Dox" file reference documentation and the last Fossies "Diffs" side-by-side code changes report: 2.4-release_vs_2.5.0-release.

    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 inline EST_Item *link1(EST_Item *n) { return idown(idown(idown(n))); }
   41 inline EST_Item *link2(EST_Item *n) { return idown(inext(idown(idown(n)))); }
   42 inline EST_Item *linkn(EST_Item *n) { return idown(last(idown(idown(n)))); }
   43 
   44 EST_Item *link(int l,EST_Item *n);
   45 
   46 inline EST_Item *linkedfrom(EST_Item *n) { return iup(iup(first(iup(n)))); }
   47 int linked(EST_Item *from, EST_Item *to);
   48 
   49  inline EST_Item *next_link(EST_Item *n) { return idown(inext(iup(n))); }
   50 
   51 void add_link(EST_Item *from, EST_Item *to);
   52 void remove_link(EST_Item *from, EST_Item *to);
   53 
   54 #endif