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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#ifndef INCLUDED_L10NTOOLS_INC_EXPORT_HXX
#define INCLUDED_L10NTOOLS_INC_EXPORT_HXX
#include "sal/config.h"
#include "po.hxx"
#include <cstddef>
#include <fstream>
#include <osl/file.hxx>
#include <osl/file.h>
#include <boost/unordered_map.hpp>
#include <iterator>
#include <set>
#include <vector>
#include <queue>
#include <string>
#ifdef WNT
#include <direct.h>
#else
#include <unistd.h>
#endif
#define NO_TRANSLATE_ISO "x-no-translate"
class MergeEntrys;
typedef boost::unordered_map<OString, OString, OStringHash>
OStringHashMap;
typedef boost::unordered_map<OString, bool, OStringHash>
OStringBoolHashMap;
#define SOURCE_LANGUAGE "en-US"
#define X_COMMENT "x-comment"
//
// class ResData
//
#define ID_LEVEL_NULL 0x0000
#define ID_LEVEL_TEXT 0x0002
#define ID_LEVEL_IDENTIFIER 0x0005
typedef std::vector< OString > ExportList;
/// Purpose: holds mandatory data to export a single res (used with ResStack)
class ResData
{
public:
ResData( const OString &rGId );
ResData( const OString &rGId , const OString &rFilename );
bool SetId(const OString &rId, sal_uInt16 nLevel);
sal_uInt16 nIdLevel;
bool bChild;
bool bChildWithText;
bool bText;
bool bQuickHelpText;
bool bTitle;
OString sResTyp;
OString sId;
OString sGId;
OString sFilename;
OStringHashMap sText;
OStringHashMap sQuickHelpText;
OStringHashMap sTitle;
OString sTextTyp;
ExportList m_aList;
};
//
// class Export
//
#define LIST_NON 0x0000
#define LIST_STRING 0x0001
#define LIST_FILTER 0x0002
#define LIST_ITEM 0x0004
#define LIST_PAIRED 0x0005
#define STRING_TYP_TEXT 0x0010
#define STRING_TYP_QUICKHELPTEXT 0x0040
#define STRING_TYP_TITLE 0x0080
#define MERGE_MODE_NORMAL 0x0000
#define MERGE_MODE_LIST 0x0001
typedef ::std::vector< ResData* > ResStack;
class ParserQueue;
/// Purpose: syntax check and export of *.src, called from lexer
class Export
{
private:
union
{
std::ofstream* mSimple;
PoOfstream* mPo;
} aOutput;
ResStack aResStack; ///< stack for parsing recursive
bool bDefine; // cur. res. in a define?
bool bNextMustBeDefineEOL; ///< define but no \ at lineend
std::size_t nLevel; // res. recursiv? how deep?
sal_uInt16 nList; ///< cur. res. is List
std::size_t nListIndex;
std::size_t nListLevel;
bool bMergeMode;
OString sMergeSrc;
bool bError; // any errors while export?
bool bReadOver;
OString sFilename;
OString sLanguages;
std::vector<OString> aLanguages;
bool WriteData( ResData *pResData, bool bCreateNew = false ); ///< called befor dest. cur ResData
bool WriteExportList( ResData *pResData, ExportList& rExportList, const sal_uInt16 nTyp );
OString MergePairedList( OString const & sLine , OString const & sText );
OString FullId(); ///< creates cur. GID
OString GetPairedListID(const OString & rText);
OString GetPairedListString(const OString& rText);
OString StripList(const OString& rText);
void InsertListEntry(const OString &rLine);
void CleanValue( OString &rValue );
OString GetText(const OString &rSource, int nToken);
void ResData2Output( MergeEntrys *pEntry, sal_uInt16 nType, const OString& rTextType );
void MergeRest( ResData *pResData );
void ConvertMergeContent( OString &rText );
void ConvertExportContent( OString &rText );
void WriteToMerged(const OString &rText , bool bSDFContent);
void SetChildWithText();
void CutComment( OString &rText );
void WriteUTF8ByteOrderMarkToOutput() { *aOutput.mSimple << '\xEF' << '\xBB' << '\xBF'; }
public:
Export( const OString &rOutput );
Export(const OString &rMergeSource, const OString &rOutput, const OString &rLanguage, bool bUTF8BOM);
~Export();
void Init();
int Execute( int nToken, const char * pToken ); ///< called from lexer
void SetError() { bError = true; }
bool GetError() { return bError; }
ParserQueue* pParseQueue; // public!!
};
//
// class MergeEntrys
//
/// Purpose: holds information of data to merge
class MergeEntrys
{
friend class MergeDataFile;
private:
OStringHashMap sText;
OStringBoolHashMap bTextFirst;
OStringHashMap sQuickHelpText;
OStringBoolHashMap bQuickHelpTextFirst;
OStringHashMap sTitle;
OStringBoolHashMap bTitleFirst;
public:
MergeEntrys(){};
void InsertEntry(const OString &rId, const OString &rText,
const OString &rQuickHelpText, const OString &rTitle)
{
sText[ rId ] = rText;
bTextFirst[ rId ] = true;
sQuickHelpText[ rId ] = rQuickHelpText;
bQuickHelpTextFirst[ rId ] = true;
sTitle[ rId ] = rTitle;
bTitleFirst[ rId ] = true;
}
bool GetText( OString &rReturn, sal_uInt16 nTyp, const OString &nLangIndex, bool bDel = false );
/**
Generate QTZ string with ResData
For executable which works one language and without PO files.
*/
static OString GetQTZText(const ResData& rResData, const OString& rOrigText);
};
//
// class MergeDataHashMap
//
class MergeData;
/** Container for MergeData
This class is an HashMap with a hidden insertion
order. The class can used just like a simple
HashMap, but good to know that it's use is
more effective if the accessing(find) order
match with the insertion order.
In the most case, this match is good.
(e.g. reading PO files of different languages,
executables merging)
*/
class MergeDataHashMap
{
private:
typedef boost::unordered_map<OString, MergeData*, OStringHash> HashMap_t;
public:
MergeDataHashMap():bFirstSearch(true){};
~MergeDataHashMap(){};
typedef HashMap_t::iterator iterator;
typedef HashMap_t::const_iterator const_iterator;
std::pair<iterator,bool> insert(const OString& rKey, MergeData* pMergeData);
iterator find(const OString& rKey);
iterator begin() {return m_aHashMap.begin();}
iterator end() {return m_aHashMap.end();}
const_iterator begin() const {return m_aHashMap.begin();}
const_iterator end() const {return m_aHashMap.end();}
private:
bool bFirstSearch;
iterator aLastInsertion;
iterator aLastFound;
iterator aFirstInOrder;
HashMap_t m_aHashMap;
};
//
// class MergeData
//
/// Purpose: holds information of data to merge (one resource)
class MergeData
{
friend class MergeDataHashMap;
public:
OString sTyp;
OString sGID;
OString sLID;
OString sFilename;
MergeEntrys* pMergeEntrys;
private:
MergeDataHashMap::iterator m_aNextData;
public:
MergeData( const OString &rTyp, const OString &rGID, const OString &rLID , const OString &rFilename );
~MergeData();
MergeEntrys* GetMergeEntries();
bool operator==( ResData *pData );
};
//
// class MergeDataFile
//
/// Purpose: holds information of data to merge, read from PO file
class MergeDataFile
{
private:
MergeDataHashMap aMap;
std::set<OString> aLanguageSet;
MergeData *GetMergeData( ResData *pResData , bool bCaseSensitve = false );
void InsertEntry(const OString &rTYP, const OString &rGID,
const OString &rLID, const OString &nLang,
const OString &rTEXT, const OString &rQHTEXT,
const OString &rTITLE, const OString &sFilename,
bool bFirstLang, bool bCaseSensitive);
public:
explicit MergeDataFile(
const OString &rFileName, const OString& rFile,
bool bCaseSensitive, bool bWithQtz = true );
~MergeDataFile();
std::vector<OString> GetLanguages() const;
const MergeDataHashMap& getMap() const { return aMap; }
MergeEntrys *GetMergeEntrys( ResData *pResData );
MergeEntrys *GetMergeEntrysCaseSensitive( ResData *pResData );
static OString CreateKey(const OString& rTYP, const OString& rGID,
const OString& rLID, const OString& rFilename , bool bCaseSensitive = false);
};
class QueueEntry
{
public:
QueueEntry(int nTypVal, const OString &rLineVal)
: nTyp(nTypVal), sLine(rLineVal)
{
}
int nTyp;
OString sLine;
};
class ParserQueue
{
public:
ParserQueue( Export& aExportObj );
~ParserQueue();
inline void Push( const QueueEntry& aEntry );
bool bCurrentIsM; // public ?
bool bNextIsM; // public ?
bool bLastWasM; // public ?
bool bMflag; // public ?
void Close();
private:
std::queue<QueueEntry>* aQueueNext;
std::queue<QueueEntry>* aQueueCur;
std::queue<QueueEntry>* aQref;
Export& aExport;
bool bStart;
inline void Pop( std::queue<QueueEntry>& aQueue );
};
#endif // INCLUDED_L10NTOOLS_INC_EXPORT_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|