/usr/include/lttoolbox-3.1/lttoolbox/node.h is in liblttoolbox3-3.1-0-dev 3.1.0-1.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 | /*
* Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
* 02111-1307, USA.
*/
#ifndef _NODE_
#define _NODE_
#include <cstdlib>
#include <list>
#include <map>
class State;
class Node;
using namespace std;
class Dest
{
private:
int size;
int *out_tag;
Node **dest;
friend class State;
friend class Node;
void copy(Dest const &d)
{
destroy();
size = d.size;
out_tag = new int[size];
dest = new Node*[size];
}
void destroy()
{
if(size != 0)
{
size = 0;
if(out_tag)
{
delete[] out_tag;
}
if(dest)
{
delete[] dest;
}
}
}
void init()
{
size = 0;
out_tag = NULL;
dest = NULL;
}
public:
Dest()
{
init();
}
~Dest()
{
destroy();
}
Dest(Dest const &d)
{
init();
copy(d);
}
Dest & operator=(Dest const &d)
{
if(this != &d)
{
destroy();
copy(d);
}
return *this;
}
};
/**
* Node class of TransExe. State is a friend class since the
* algorithms are implemented in State
*/
class Node
{
private:
friend class State;
/**
* The outgoing transitions of this node.
* Schema: (input symbol, (output symbol, destination))
*/
map<int, Dest> transitions;
/**
* Copy method
* @param n the node to be copied
*/
void copy(Node const &n);
/**
* Destroy method
*/
void destroy();
public:
/**
* Constructor
*/
Node();
/**
* Destructor
*/
~Node();
/**
* Copy constructor
* @param n the node to be copied
*/
Node(Node const &n);
/**
* Assignment operator
* @param n the node to be assigned
* @return the assigned object
*/
Node & operator=(Node const &n);
/**
* Making a link between this node and another
* @param i input symbol
* @param o output symbol
* @param d destination
*/
void addTransition(int i, int o, Node * const d);
};
#endif
|