2 * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License as
6 * published by the Free Software Foundation; either version 2 of the
7 * License, or (at your option) any later version.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
42 void copy(Dest const &d)
56 out_tag = new ushort[size];
57 dest = new Node*[size];
94 Dest & operator=(Dest const &d)
108 * Node class of TransExe. State is a friend class since the
109 * algorithms are implemented in State
117 * The outgoing transitions of this node.
118 * Schema: (input symbol, (output symbol, destination))
120 map<unsigned short, Dest> transitions;
124 * @param n the node to be copied
126 void copy(Node const &n);
147 * @param n the node to be copied
152 * Assignment operator
153 * @param n the node to be assigned
154 * @return the assigned object
156 Node & operator=(Node const &n);
159 * Making a link between this node and another
160 * @param i input symbol
161 * @param o output symbol
162 * @param d destination
164 void addTransition(unsigned short const i, unsigned short const o, Node * const d);