/usr/include/apertium-3.4/apertium/interchunk.h is in apertium-dev 3.4.0~r61013-5.
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 | /*
* 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 _INTERCHUNK_
#define _INTERCHUNK_
#include <apertium/transfer_instr.h>
#include <apertium/transfer_token.h>
#include <apertium/interchunk_word.h>
#include <apertium/apertium_re.h>
#include <lttoolbox/alphabet.h>
#include <lttoolbox/buffer.h>
#include <lttoolbox/ltstr.h>
#include <lttoolbox/match_exe.h>
#include <lttoolbox/match_state.h>
#include <cstring>
#include <cstdio>
#include <libxml/parser.h>
#include <libxml/tree.h>
#include <map>
#include <set>
#include <vector>
using namespace std;
class Interchunk
{
private:
Alphabet alphabet;
MatchExe *me;
MatchState ms;
map<string, ApertiumRE, Ltstr> attr_items;
map<string, string, Ltstr> variables;
map<string, int, Ltstr> macros;
map<string, set<string, Ltstr>, Ltstr> lists;
map<string, set<string, Ltstr>, Ltstr> listslow;
vector<xmlNode *> macro_map;
vector<xmlNode *> rule_map;
xmlDoc *doc;
xmlNode *root_element;
InterchunkWord **word;
string **blank;
int lword, lblank;
Buffer<TransferToken> input_buffer;
vector<wstring *> tmpword;
vector<wstring *> tmpblank;
FILE *output;
int any_char;
int any_tag;
xmlNode *lastrule;
unsigned int nwords;
map<xmlNode *, TransferInstr> evalStringCache;
bool inword;
bool null_flush;
bool internal_null_flush;
bool trace;
string emptyblank;
void copy(Interchunk const &o);
void destroy();
void readData(FILE *input);
void readInterchunk(string const &input);
void collectMacros(xmlNode *localroot);
void collectRules(xmlNode *localroot);
string caseOf(string const &str);
string copycase(string const &source_word, string const &target_word);
void processLet(xmlNode *localroot);
void processAppend(xmlNode *localroot);
void processOut(xmlNode *localroot);
void processCallMacro(xmlNode *localroot);
void processModifyCase(xmlNode *localroot);
bool processLogical(xmlNode *localroot);
bool processTest(xmlNode *localroot);
bool processAnd(xmlNode *localroot);
bool processOr(xmlNode *localroot);
bool processEqual(xmlNode *localroot);
bool processBeginsWith(xmlNode *localroot);
bool processBeginsWithList(xmlNode *localroot);
bool processEndsWith(xmlNode *localroot);
bool processEndsWithList(xmlNode *localroot);
bool processContainsSubstring(xmlNode *localroot);
bool processNot(xmlNode *localroot);
bool processIn(xmlNode *localroot);
void processRule(xmlNode *localroot);
string evalString(xmlNode *localroot);
void processInstruction(xmlNode *localroot);
void processChoose(xmlNode *localroot);
string processChunk(xmlNode *localroot);
bool beginsWith(string const &str1, string const &str2) const;
bool endsWith(string const &str1, string const &str2) const;
string tolower(string const &str) const;
string tags(string const &str) const;
string readWord(FILE *in);
string readBlank(FILE *in);
string readUntil(FILE *in, int const symbol) const;
void applyWord(wstring const &word_str);
void applyRule();
TransferToken & readToken(FILE *in);
bool checkIndex(xmlNode *element, int index, int limit);
void interchunk_wrapper_null_flush(FILE *in, FILE *out);
public:
Interchunk();
~Interchunk();
Interchunk(Interchunk const &o);
Interchunk & operator =(Interchunk const &o);
void read(string const &transferfile, string const &datafile);
void interchunk(FILE *in, FILE *out);
bool getNullFlush(void);
void setNullFlush(bool null_flush);
void setTrace(bool trace);
};
#endif
|