43 #include "ling_class/EST_Item.h"
44 #include "ling_class/EST_Item_Content.h"
45 #include "ling_class/EST_Relation.h"
51 for (i=l; i != 0; i=i->next())
82 EST_Item::splice(p,n);
91 merge_features(to->features(),from->features());
98 i->set_contents(to->contents());
100 from->set_contents(to->contents());
110 if (keep_id) keep = to->
S(
"id",
"0");
111 merge_features(to->features(),from->features());
112 if (keep_id) to->
set(
"id", keep);
121 to->set_contents(from->contents());
138 to->set_contents(from->contents());
141 d = to->grab_daughters();
169 EST_Item *from_d = rfrom->grab_daughters();
170 EST_Item *to_d = to->grab_daughters();
172 to->set_contents(fromc);
173 rfrom->set_contents(toc);
175 copy_node_tree(from_d,to->insert_below(from_d));
177 copy_node_tree(to_d,from->insert_below(to_d));
194 else if (to ==
"Syllable")
196 else if (to ==
"Word")
198 else if (to ==
"IntEvent")
210 if ( t == 0 || f == 0 )
EST_Item * next_sibling(const EST_Item *n)
return next sibling (sister) of n
void remove_item(EST_Item *item)
int in_relation(const EST_String &relname) const
TRUE if this item is in named relation.
int in_tree(const EST_Item *c, const EST_Item *t)
EST_Item * as_relation(const char *relname) const
View item from another relation (const char *) method.
void set(const EST_String &name, int ival)
const EST_String & relation_name() const
The relation name of this particular item.
EST_TKVL< EST_String, EST_Val > & relations()
Access to the relation links.
EST_TList< EST_TKVI< K, V > > list
Linked list of key-val pairs. Don't use this as it will be made private in the future.
const EST_String S(const EST_String &name) const
EST_Item * daughter1(const EST_Item *n)
return first daughter of n