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
26 #include <lttoolbox/SortedVector.H>
33 //typedef map<int, MatchNode *> MNode;
35 typedef SortedVector MNode;
38 * Node class of TransExe. State is a friend class since the
39 * algorithms are implemented in MatchState
44 friend class MatchState;
47 * The outgoing transitions from this node.
48 * Schema: (input symbol, destination)
54 * @param n the node to be copied
56 void copy(MatchNode const &n);
68 MatchNode(int const svsize);
77 * @param n the node to be copied
79 MatchNode(MatchNode const &n);
83 * @param n the node to be assigned
84 * @return the assigned object
86 MatchNode & operator=(MatchNode const &n);
89 * Making a link between this node and another
90 * @param i input symbol
91 * @param d destination
93 void addTransition(int const i, MatchNode * const d, int pos);