trunk/lttoolbox/lttoolbox/node.cc

   1 /*
   2  * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
   3  *
   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.
   8  *
   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.
  13  *
  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
  17  * 02111-1307, USA.
  18  */
  19 #include <lttoolbox/node.h>
  20
  21 Node::Node()
  22 {
  23 }
  24
  25 Node::~Node()
  26 {
  27   destroy();
  28 }
  29
  30 Node::Node(Node const &n)
  31 {
  32   copy(n);
  33 }
  34
  35 Node &
  36 Node::operator =(Node const &n)
  37 {
  38   if(this != &n)
  39   {
  40     destroy();
  41     copy(n);
  42   }
  43   return *this;
  44 }
  45
  46 void
  47 Node::copy(Node const &n)
  48 {
  49   transitions = n.transitions;
  50 }
  51
  52 void
  53 Node::destroy()
  54 {
  55 }
  56
  57 void
  58 Node::addTransition(int const i, int const o, Node * const d)
  59 {
  60   Dest &aux = transitions[i];
  61   aux.size++;
  62   int *out_tag = new int[aux.size];
  63   Node **dest = new Node*[aux.size];
  64
  65   for(int i = 0; i<aux.size-1; i++)
  66   {
  67     out_tag[i] = aux.out_tag[i];
  68     dest[i] = aux.dest[i];
  69   }
  70
  71   if(aux.size > 1)
  72   {
  73     delete aux.out_tag;
  74     delete aux.dest;
  75   }
  76
  77   out_tag[aux.size-1] = o;
  78   dest[aux.size-1] = d;
  79   aux.out_tag = out_tag;
  80   aux.dest = dest;
  81 }