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
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
|
/* -*- 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 .
*/
#include <tools/urlobj.hxx>
#include <vcl/dialog.hxx>
#include <vcl/msgbox.hxx>
#include <vcl/button.hxx>
#include <vcl/fixed.hxx>
#include <vcl/lstbox.hxx>
#include <svl/fstathelper.hxx>
#include <unotools/pathoptions.hxx>
#include <unotools/transliterationwrapper.hxx>
#include <swtypes.hxx>
#include <swmodule.hxx>
#include <shellio.hxx>
#include <initui.hxx>
#include <glosdoc.hxx>
#include <gloslst.hxx>
#include <swunohelper.hxx>
#include <vector>
#include <utlui.hrc>
#define STRING_DELIM (char)0x0A
#define GLOS_TIMEOUT 30000 // update every 30 seconds
#define FIND_MAX_GLOS 20
struct TripleString
{
String sGroup;
String sBlock;
String sShort;
};
class SwGlossDecideDlg : public ModalDialog
{
OKButton* m_pOk;
ListBox* m_pListLB;
DECL_LINK(DoubleClickHdl, void*);
DECL_LINK(SelectHdl, void*);
public:
SwGlossDecideDlg(Window* pParent);
ListBox& GetListBox() {return *m_pListLB;}
};
SwGlossDecideDlg::SwGlossDecideDlg(Window* pParent)
: ModalDialog(pParent, "SelectAutoTextDialog",
"modules/swriter/ui/selectautotextdialog.ui")
{
get(m_pOk, "ok");
get(m_pListLB, "treeview");
m_pListLB->set_height_request(m_pListLB->GetTextHeight() * 10);
m_pListLB->SetDoubleClickHdl(LINK(this, SwGlossDecideDlg, DoubleClickHdl));
m_pListLB->SetSelectHdl(LINK(this, SwGlossDecideDlg, SelectHdl));
}
IMPL_LINK_NOARG(SwGlossDecideDlg, DoubleClickHdl)
{
EndDialog(RET_OK);
return 0;
}
IMPL_LINK_NOARG(SwGlossDecideDlg, SelectHdl)
{
m_pOk->Enable(LISTBOX_ENTRY_NOTFOUND != m_pListLB->GetSelectEntryPos());
return 0;
}
SwGlossaryList::SwGlossaryList() :
bFilled(false)
{
SvtPathOptions aPathOpt;
sPath = aPathOpt.GetAutoTextPath();
SetTimeout(GLOS_TIMEOUT);
}
SwGlossaryList::~SwGlossaryList()
{
ClearGroups();
}
// If the GroupName is already known, then only rShortName
// will be filled. Otherwise also rGroupName will be set and
// on demand asked for the right group.
sal_Bool SwGlossaryList::GetShortName(const String& rLongName,
String& rShortName, String& rGroupName )
{
if(!bFilled)
Update();
std::vector<TripleString> aTripleStrings;
sal_uInt16 nCount = aGroupArr.size();
sal_uInt16 nFound = 0;
for(sal_uInt16 i = 0; i < nCount; i++ )
{
AutoTextGroup* pGroup = aGroupArr[i];
if(rGroupName.Len() && rGroupName != pGroup->sName)
continue;
for(sal_uInt16 j = 0; j < pGroup->nCount; j++)
{
OUString sLong = pGroup->sLongNames.getToken(j, STRING_DELIM);
if(rLongName != sLong)
continue;
TripleString pTriple;
pTriple.sGroup = pGroup->sName;
pTriple.sBlock = sLong;
pTriple.sShort = pGroup->sShortNames.getToken(j, STRING_DELIM);
aTripleStrings.push_back(pTriple);
++nFound;
}
}
sal_Bool bRet = sal_False;
nCount = aTripleStrings.size();
if(1 == nCount)
{
const TripleString& pTriple(aTripleStrings.front());
rShortName = pTriple.sShort;
rGroupName = pTriple.sGroup;
bRet = sal_True;
}
else if(1 < nCount)
{
SwGlossDecideDlg aDlg(0);
OUString sTitle = aDlg.GetText() + " " + aTripleStrings.front().sBlock;
aDlg.SetText(sTitle);
ListBox& rLB = aDlg.GetListBox();
for(std::vector<TripleString>::const_iterator i = aTripleStrings.begin(); i != aTripleStrings.end(); ++i)
rLB.InsertEntry(i->sGroup.GetToken(0, GLOS_DELIM));
rLB.SelectEntryPos(0);
if(RET_OK == aDlg.Execute() &&
LISTBOX_ENTRY_NOTFOUND != rLB.GetSelectEntryPos())
{
const TripleString& pTriple(aTripleStrings[rLB.GetSelectEntryPos()]);
rShortName = pTriple.sShort;
rGroupName = pTriple.sGroup;
bRet = sal_True;
}
else
bRet = sal_False;
}
return bRet;
}
sal_uInt16 SwGlossaryList::GetGroupCount()
{
if(!bFilled)
Update();
return aGroupArr.size();
}
OUString SwGlossaryList::GetGroupName(sal_uInt16 nPos, bool bNoPath)
{
OSL_ENSURE(aGroupArr.size() > nPos, "group not available");
if(nPos < aGroupArr.size())
{
AutoTextGroup* pGroup = aGroupArr[nPos];
OUString sRet = pGroup->sName;
if(bNoPath)
sRet = sRet.getToken(0, GLOS_DELIM);
return sRet;
}
return OUString();
}
OUString SwGlossaryList::GetGroupTitle(sal_uInt16 nPos)
{
OSL_ENSURE(aGroupArr.size() > nPos, "group not available");
if(nPos < aGroupArr.size())
{
AutoTextGroup* pGroup = aGroupArr[nPos];
return pGroup->sTitle;
}
return OUString();
}
sal_uInt16 SwGlossaryList::GetBlockCount(sal_uInt16 nGroup)
{
OSL_ENSURE(aGroupArr.size() > nGroup, "group not available");
if(nGroup < aGroupArr.size())
{
AutoTextGroup* pGroup = aGroupArr[nGroup];
return pGroup->nCount;
}
return 0;
}
OUString SwGlossaryList::GetBlockLongName(sal_uInt16 nGroup, sal_uInt16 nBlock)
{
OSL_ENSURE(aGroupArr.size() > nGroup, "group not available");
if(nGroup < aGroupArr.size())
{
AutoTextGroup* pGroup = aGroupArr[nGroup];
return pGroup->sLongNames.getToken(nBlock, STRING_DELIM);
}
return OUString();
}
OUString SwGlossaryList::GetBlockShortName(sal_uInt16 nGroup, sal_uInt16 nBlock)
{
OSL_ENSURE(aGroupArr.size() > nGroup, "group not available");
if(nGroup < aGroupArr.size())
{
AutoTextGroup* pGroup = aGroupArr[nGroup];
return pGroup->sShortNames.getToken(nBlock, STRING_DELIM);
}
return OUString();
}
void SwGlossaryList::Update()
{
if(!IsActive())
Start();
SvtPathOptions aPathOpt;
OUString sTemp( aPathOpt.GetAutoTextPath() );
if(sTemp != sPath)
{
sPath = sTemp;
bFilled = false;
ClearGroups();
}
SwGlossaries* pGlossaries = ::GetGlossaries();
const std::vector<OUString> & rPathArr = pGlossaries->GetPathArray();
const OUString sExt( SwGlossaries::GetExtension() );
if(!bFilled)
{
sal_uInt16 nGroupCount = pGlossaries->GetGroupCnt();
for(sal_uInt16 i = 0; i < nGroupCount; i++)
{
OUString sGrpName = pGlossaries->GetGroupName(i);
sal_uInt16 nPath = (sal_uInt16)sGrpName.getToken(1, GLOS_DELIM).toInt32();
if( static_cast<size_t>(nPath) < rPathArr.size() )
{
AutoTextGroup* pGroup = new AutoTextGroup;
pGroup->sName = sGrpName;
FillGroup(pGroup, pGlossaries);
OUString sName = rPathArr[nPath] + OUString(INET_PATH_TOKEN) +
pGroup->sName.getToken(0, GLOS_DELIM) + sExt;
FStatHelper::GetModifiedDateTimeOfFile( sName,
&pGroup->aDateModified,
&pGroup->aDateModified );
aGroupArr.insert( aGroupArr.begin(), pGroup );
}
}
bFilled = true;
}
else
{
for( size_t nPath = 0; nPath < rPathArr.size(); nPath++ )
{
std::vector<String> aFoundGroupNames;
std::vector<OUString*> aFiles;
std::vector<DateTime*> aDateTimeArr;
SWUnoHelper::UCB_GetFileListOfFolder( rPathArr[nPath], aFiles,
&sExt, &aDateTimeArr );
for( size_t nFiles = 0; nFiles < aFiles.size(); ++nFiles )
{
const OUString* pTitle = aFiles[ nFiles ];
::DateTime* pDT = (::DateTime*) aDateTimeArr[ static_cast<sal_uInt16>(nFiles) ];
OUString sName( pTitle->copy( 0, pTitle->getLength() - sExt.getLength() ));
aFoundGroupNames.push_back(sName);
sName += OUString(GLOS_DELIM) + OUString::number( static_cast<sal_uInt16>(nPath) );
AutoTextGroup* pFound = FindGroup( sName );
if( !pFound )
{
pFound = new AutoTextGroup;
pFound->sName = sName;
FillGroup( pFound, pGlossaries );
pFound->aDateModified = *pDT;
aGroupArr.push_back(pFound);
}
else if( pFound->aDateModified < *pDT )
{
FillGroup(pFound, pGlossaries);
pFound->aDateModified = *pDT;
}
// don't need any more these pointers
delete pTitle;
delete pDT;
}
sal_uInt16 nArrCount = aGroupArr.size();
for( sal_uInt16 i = nArrCount; i; --i)
{
// maybe remove deleted groups
AutoTextGroup* pGroup = aGroupArr[i - 1];
sal_uInt16 nGroupPath = (sal_uInt16)pGroup->sName.getToken( 1,
GLOS_DELIM).toInt32();
// Only the groups will be checked which are registered
// for the current subpath.
if( nGroupPath == static_cast<sal_uInt16>(nPath) )
{
bool bFound = false;
OUString sCompareGroup = pGroup->sName.getToken(0, GLOS_DELIM);
for(std::vector<String>::const_iterator j = aFoundGroupNames.begin(); j != aFoundGroupNames.end() && !bFound; ++j)
bFound = (sCompareGroup == *j);
if(!bFound)
{
aGroupArr.erase(aGroupArr.begin() + i - 1);
delete pGroup;
}
}
}
}
}
}
void SwGlossaryList::Timeout()
{
// Only update automatically if a SwView has the focus.
if(::GetActiveView())
Update();
}
AutoTextGroup* SwGlossaryList::FindGroup(const OUString& rGroupName)
{
for(sal_uInt16 i = 0; i < aGroupArr.size(); i++)
{
AutoTextGroup* pRet = aGroupArr[i];
if(pRet->sName == rGroupName)
return pRet;
}
return 0;
}
void SwGlossaryList::FillGroup(AutoTextGroup* pGroup, SwGlossaries* pGlossaries)
{
SwTextBlocks* pBlock = pGlossaries->GetGroupDoc(pGroup->sName);
pGroup->nCount = pBlock ? pBlock->GetCount() : 0;
pGroup->sLongNames = pGroup->sShortNames = aEmptyStr;
if(pBlock)
pGroup->sTitle = pBlock->GetName();
for(sal_uInt16 j = 0; j < pGroup->nCount; j++)
{
pGroup->sLongNames += pBlock->GetLongName(j);
pGroup->sLongNames += OUString(STRING_DELIM);
pGroup->sShortNames += pBlock->GetShortName(j);
pGroup->sShortNames += OUString(STRING_DELIM);
}
pGlossaries->PutGroupDoc(pBlock);
}
// Give back all (not exceeding FIND_MAX_GLOS) found modules
// with matching beginning.
bool SwGlossaryList::HasLongName(const String& rBegin, std::vector<String> *pLongNames)
{
if(!bFilled)
Update();
sal_uInt16 nFound = 0;
sal_uInt16 nCount = aGroupArr.size();
sal_uInt16 nBeginLen = rBegin.Len();
const ::utl::TransliterationWrapper& rSCmp = GetAppCmpStrIgnore();
for(sal_uInt16 i = 0; i < nCount; i++ )
{
AutoTextGroup* pGroup = aGroupArr[i];
for(sal_uInt16 j = 0; j < pGroup->nCount; j++)
{
OUString sBlock = pGroup->sLongNames.getToken(j, STRING_DELIM);
if( nBeginLen + 1 < sBlock.getLength() &&
rSCmp.isEqual( sBlock.copy(0, nBeginLen), rBegin ))
{
pLongNames->push_back( sBlock );
nFound++;
if(FIND_MAX_GLOS == nFound)
break;
}
}
}
return nFound > 0;
}
void SwGlossaryList::ClearGroups()
{
sal_uInt16 nCount = aGroupArr.size();
for( sal_uInt16 i = 0; i < nCount; ++i )
delete aGroupArr[ i ];
aGroupArr.clear();
bFilled = false;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|