/usr/include/lttoolbox-3.1/lttoolbox/state.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 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 | /*
* 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 _STATE_
#define _STATE_
#include <set>
#include <string>
#include <vector>
#include <queue>
#include <lttoolbox/alphabet.h>
#include <lttoolbox/node.h>
#include <lttoolbox/pool.h>
using namespace std;
/**
* Class to represent the current state of transducer processing
*/
class State
{
private:
/**
* The current state of transducer processing
*/
struct TNodeState
{
Node *where;
vector<int> *sequence;
bool dirty;
TNodeState(Node * const &w, vector<int> * const &s, bool const &d): where(w), sequence(s), dirty(d){}
TNodeState & operator=(TNodeState const &other)
{
where = other.where;
sequence = other.sequence;
dirty = other.dirty;
return *this;
}
};
vector<TNodeState> state;
/**
* Pool of wchar_t vectors, for efficience (static class)
*/
static Pool<vector<int> > pool;
/**
* Copy function
* @param s the state to be copied
*/
void copy(State const &s);
/**
* Destroy function
*/
void destroy();
/**
* Make a transition, version for lowercase letters and symbols
* @param input the input symbol
*/
void apply(int const input);
/**
* Make a transition, version for lowercase and uppercase letters
* @param input the input symbol
* @param alt the alternative input symbol
*/
void apply(int const input, int const alt);
/**
* Calculate the epsilon closure over the current state, replacing
* its content.
*/
void epsilonClosure();
public:
/**
* Constructor
*/
State();
/**
* Destructor
*/
~State();
/**
* Copy constructor
* @param s the state to be copied
*/
State(State const &s);
/**
* Assignment operator
* @param s the state to be assigned
* @return the object that results from the assignation
*/
State & operator =(State const &s);
/**
* Number of alive transductions
* @return the size
*/
int size() const;
/**
* step = apply + epsilonClosure
* @param input the input symbol
*/
void step(int const input);
/**
* step = apply + epsilonClosure
* @param input the input symbol
* @param alt the alternative input symbol
*/
void step(int const input, int const alt);
/**
* Init the state with the initial node and empty output
* @param initial the initial node of the transducer
*/
void init(Node *initial);
/**
* Print all outputs of current parsing, preceeded by a bar '/',
* from the final nodes of the state
* @param finals the set of final nodes
* @param a the alphabet to decode strings
* @param escaped_chars the set of chars to be preceeded with one
* backslash
* @param uppercase true if the word is uppercase
* @param firstupper true if the first letter of a word is uppercase
* @param firstchar first character of the word
* @return the result of the transduction
*/
wstring filterFinals(set<Node *> const &finals, Alphabet const &a,
set<wchar_t> const &escaped_chars,
bool uppercase = false,
bool firstupper = false,
int firstchar = 0) const;
/**
* Same as previous one, but the output is adapted to the SAO system
* @param finals the set of final nodes
* @param a the alphabet to decode strings
* @param escaped_chars the set of chars to be preceeded with one
* backslash
* @param uppercase true if the word is uppercase
* @param firstupper true if the first letter of a word is uppercase
* @param firstchar first character of the word
* @return the result of the transduction
*/
wstring filterFinalsSAO(set<Node *> const &finals, Alphabet const &a,
set<wchar_t> const &escaped_chars,
bool uppercase = false,
bool firstupper = false,
int firstchar = 0) const;
/**
* Returns true if at least one record of the state references a
* final node of the set
* @param finals set of final nodes @return
* @true if the state is final
*/
bool isFinal(set<Node *> const &finals) const;
wstring filterFinalsTM(set<Node *> const &finals,
Alphabet const &alphabet,
set<wchar_t> const &escaped_chars,
queue<wstring> &blanks,
vector<wstring> &numbers) const;
};
#endif
|