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
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
|
/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: iprcache.cxx,v $
*
* $Revision: 1.8 $
*
* last change: $Author: vg $ $Date: 2007-05-25 12:23:20 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_linguistic.hxx"
#include <string.h>
#include "iprcache.hxx"
#include "misc.hxx"
#include <com/sun/star/linguistic2/DictionaryListEventFlags.hpp>
#ifndef _TOOLS_DEBUG_HXX
#include <tools/debug.hxx>
#endif
#ifndef _OSL_MUTEX_HXX_
#include <osl/mutex.hxx>
#endif
//#define IPR_DEF_CACHE_SIZE 503
#define IPR_DEF_CACHE_MAX 375
#define IPR_DEF_CACHE_MAXINPUT 200
#ifdef DBG_STATISTIC
#ifndef _STREAM_HXX
#include <tools/stream.hxx>
#endif
//#define IPR_CACHE_SIZE nTblSize
#define IPR_CACHE_MAX nMax
#define IPR_CACHE_MAXINPUT nMaxInput
#else
//#define IPR_CACHE_SIZE IPR_DEF_CACHE_SIZE
#define IPR_CACHE_MAX IPR_DEF_CACHE_MAX
#define IPR_CACHE_MAXINPUT IPR_DEF_CACHE_MAXINPUT
#endif
#ifndef _UNOTOOLS_PROCESSFACTORY_HXX_
#include <unotools/processfactory.hxx>
#endif
#include <lngprops.hxx>
using namespace utl;
using namespace osl;
using namespace rtl;
using namespace com::sun::star;
using namespace com::sun::star::beans;
using namespace com::sun::star::lang;
using namespace com::sun::star::uno;
using namespace com::sun::star::linguistic2;
namespace linguistic
{
///////////////////////////////////////////////////////////////////////////
#define NUM_FLUSH_PROPS 6
static const struct
{
const char *pPropName;
INT32 nPropHdl;
} aFlushProperties[ NUM_FLUSH_PROPS ] =
{
{ UPN_IS_GERMAN_PRE_REFORM, UPH_IS_GERMAN_PRE_REFORM },
{ UPN_IS_USE_DICTIONARY_LIST, UPH_IS_USE_DICTIONARY_LIST },
{ UPN_IS_IGNORE_CONTROL_CHARACTERS, UPH_IS_IGNORE_CONTROL_CHARACTERS },
{ UPN_IS_SPELL_UPPER_CASE, UPH_IS_SPELL_UPPER_CASE },
{ UPN_IS_SPELL_WITH_DIGITS, UPH_IS_SPELL_WITH_DIGITS },
{ UPN_IS_SPELL_CAPITALIZATION, UPH_IS_SPELL_CAPITALIZATION }
};
static void lcl_AddAsPropertyChangeListener(
Reference< XPropertyChangeListener > xListener,
Reference< XPropertySet > &rPropSet )
{
if (xListener.is() && rPropSet.is())
{
for (int i = 0; i < NUM_FLUSH_PROPS; ++i)
{
rPropSet->addPropertyChangeListener(
A2OU(aFlushProperties[i].pPropName), xListener );
}
}
}
static void lcl_RemoveAsPropertyChangeListener(
Reference< XPropertyChangeListener > xListener,
Reference< XPropertySet > &rPropSet )
{
if (xListener.is() && rPropSet.is())
{
for (int i = 0; i < NUM_FLUSH_PROPS; ++i)
{
rPropSet->removePropertyChangeListener(
A2OU(aFlushProperties[i].pPropName), xListener );
}
}
}
static BOOL lcl_IsFlushProperty( INT32 nHandle )
{
int i;
for (i = 0; i < NUM_FLUSH_PROPS; ++i)
{
if (nHandle == aFlushProperties[i].nPropHdl)
break;
}
return i < NUM_FLUSH_PROPS;
}
FlushListener::FlushListener( Flushable *pFO )
{
SetFlushObj( pFO );
}
FlushListener::~FlushListener()
{
}
void FlushListener::SetDicList( Reference<XDictionaryList> &rDL )
{
MutexGuard aGuard( GetLinguMutex() );
if (xDicList != rDL)
{
if (xDicList.is())
xDicList->removeDictionaryListEventListener( this );
xDicList = rDL;
if (xDicList.is())
xDicList->addDictionaryListEventListener( this, FALSE );
}
}
void FlushListener::SetPropSet( Reference< XPropertySet > &rPS )
{
MutexGuard aGuard( GetLinguMutex() );
if (xPropSet != rPS)
{
if (xPropSet.is())
lcl_RemoveAsPropertyChangeListener( this, xPropSet );
xPropSet = rPS;
if (xPropSet.is())
lcl_AddAsPropertyChangeListener( this, xPropSet );
}
}
void SAL_CALL FlushListener::disposing( const EventObject& rSource )
throw(RuntimeException)
{
MutexGuard aGuard( GetLinguMutex() );
if (xDicList.is() && rSource.Source == xDicList)
{
xDicList->removeDictionaryListEventListener( this );
xDicList = NULL; //! release reference
}
if (xPropSet.is() && rSource.Source == xPropSet)
{
lcl_RemoveAsPropertyChangeListener( this, xPropSet );
xPropSet = NULL; //! release reference
}
}
void SAL_CALL FlushListener::processDictionaryListEvent(
const DictionaryListEvent& rDicListEvent )
throw(RuntimeException)
{
MutexGuard aGuard( GetLinguMutex() );
if (rDicListEvent.Source == xDicList)
{
INT16 nEvt = rDicListEvent.nCondensedEvent;
INT16 nFlushFlags =
DictionaryListEventFlags::ADD_NEG_ENTRY |
DictionaryListEventFlags::DEL_POS_ENTRY |
DictionaryListEventFlags::ACTIVATE_NEG_DIC |
DictionaryListEventFlags::DEACTIVATE_POS_DIC;
BOOL bFlush = 0 != (nEvt & nFlushFlags);
DBG_ASSERT( pFlushObj, "missing object (NULL pointer)" );
if (bFlush && pFlushObj != NULL)
pFlushObj->Flush();
}
}
void SAL_CALL FlushListener::propertyChange(
const PropertyChangeEvent& rEvt )
throw(RuntimeException)
{
MutexGuard aGuard( GetLinguMutex() );
if (rEvt.Source == xPropSet)
{
BOOL bFlush = lcl_IsFlushProperty( rEvt.PropertyHandle );
DBG_ASSERT( pFlushObj, "missing object (NULL pointer)" );
if (bFlush && pFlushObj != NULL)
pFlushObj->Flush();
}
}
///////////////////////////////////////////////////////////////////////////
class IPRCachedWord
{
String aWord;
IPRCachedWord *pNext;
IPRCachedWord *pPrev;
IPRCachedWord *pFollow;
INT16 nLanguage;
ULONG nFound;
// don't allow to use copy-constructor and assignment-operator
IPRCachedWord(const IPRCachedWord &);
IPRCachedWord & operator = (const IPRCachedWord &);
public:
IPRCachedWord( const String& rWord, IPRCachedWord* pFollowPtr, INT16 nLang )
: aWord( rWord ), pNext( 0 ), pPrev( 0 ), pFollow( pFollowPtr ),
nLanguage( nLang ), nFound( 0 ) {}
~IPRCachedWord(){}
const String& GetWord() { return aWord; }
void SetWord( const String& aNew ) { aWord = aNew; }
USHORT GetLang() { return nLanguage; }
void SetLang( INT16 nNew ) { nLanguage = nNew; }
IPRCachedWord* GetNext() { return pNext; }
void SetNext( IPRCachedWord* pNew ) { pNext = pNew; }
IPRCachedWord* GetPrev() { return pPrev; }
void SetPrev( IPRCachedWord* pNew ) { pPrev = pNew; }
IPRCachedWord* GetFollow() { return pFollow; }
void SetFollow( IPRCachedWord* pNew ){ pFollow = pNew; }
void IncFound() { ++nFound; }
ULONG GetFound() { return nFound; }
void SetFound( ULONG nNew ) { nFound = nNew; }
};
///////////////////////////////////////////////////////////////////////////
IPRSpellCache::IPRSpellCache( ULONG nSize ) :
ppHash ( NULL ),
pFirst ( NULL ),
pLast ( NULL ),
nIndex ( 0 ),
nCount ( 0 ),
nInputPos ( 0 ),
nInputValue ( 0 ),
nTblSize ( nSize )
#ifdef DBG_STATISTIC
,nMax ( IPR_DEF_CACHE_MAX ),
nMaxInput ( IPR_DEF_CACHE_MAXINPUT ),
nFound ( 0 ),
nLost ( 0 )
#endif
{
pFlushLstnr = new FlushListener( this );
xFlushLstnr = pFlushLstnr;
Reference<XDictionaryList> aDictionaryList(GetDictionaryList());
pFlushLstnr->SetDicList( aDictionaryList ); //! after reference is established
Reference<XPropertySet> aPropertySet(GetLinguProperties());
pFlushLstnr->SetPropSet( aPropertySet ); //! after reference is established
}
IPRSpellCache::~IPRSpellCache()
{
MutexGuard aGuard( GetLinguMutex() );
Reference<XDictionaryList> aDictionaryList;
pFlushLstnr->SetDicList( aDictionaryList );
Reference<XPropertySet> aPropertySet;
pFlushLstnr->SetPropSet( aPropertySet );
#ifdef DBG_STATISTIC
// Binary File oeffnen
String aOutTmp( String::CreateFromAscii( "iprcache.stk" ) )
SvFileStream aOut( aOutTmp, STREAM_STD_WRITE );
if( aOut.IsOpen() && !aOut.GetError() && ppHash )
{
ByteString aStr( "Gefunden: ");
aStr += nFound;
aStr += " Verloren: ";
aStr += nLost;
ULONG nSumSum = 0;
aOut << aStr.GetBuffer() << endl;
for( ULONG i = 0; i < nTblSize; ++i )
{
aStr = "Index: ";
aStr += i;
aStr += " Tiefe: ";
ULONG nDeep = 0;
ULONG nSum = 0;
IPRCachedWord* pTmp = *( ppHash + i );
while( pTmp )
{
++nDeep;
nSum += pTmp->GetFound();
pTmp = pTmp->GetNext();
}
aStr += nDeep;
aStr += " Anzahl: ";
aStr += nSum;
nSumSum += nSum;
aOut << aStr.GetBuffer() << endl;
pTmp = *( ppHash + i );
aStr = " Found: ";
while( pTmp )
{
aStr += pTmp->GetFound();
aStr += " ";
pTmp = pTmp->GetNext();
}
aOut << aStr.GetBuffer() << endl;
}
aStr = "Summe: ";
aStr += nSumSum;
aOut << aStr.GetBuffer() << endl;
}
#endif
while( pFirst )
{
pLast = pFirst->GetNext();
delete pFirst;
pFirst = pLast;
}
delete ppHash;
}
void IPRSpellCache::Flush()
{
MutexGuard aGuard( GetLinguMutex() );
if( ppHash )
{
while( pFirst )
{
pLast = pFirst->GetNext();
delete pFirst;
pFirst = pLast;
}
delete ppHash;
ppHash = NULL;
nIndex = 0;
nCount = 0;
nInputPos = 0;
nInputValue = 0;
#ifdef DBG_STATISTIC
nFound = 0;
nLost = 0;
#endif
}
}
BOOL IPRSpellCache::CheckWord( const String& rWord, INT16 nLang, BOOL bAllLang )
{
MutexGuard aGuard( GetLinguMutex() );
BOOL bRet = FALSE;
// Hash-Index-Berechnung
nIndex = 0;
const sal_Unicode* pp = rWord.GetBuffer();
while( *pp )
nIndex = nIndex << 1 ^ *pp++;
nIndex %= nTblSize;
if( ppHash )
{
pRun = *(ppHash + nIndex);
if( pRun && FALSE == ( bRet = (rWord == pRun->GetWord() &&
(nLang == pRun->GetLang() || bAllLang)) ) )
{
IPRCachedWord* pTmp = pRun->GetNext();
while( pTmp && FALSE ==( bRet = ( rWord == pTmp->GetWord() &&
(nLang == pTmp->GetLang() || bAllLang) ) ) )
{
pRun = pTmp;
pTmp = pTmp->GetNext();
}
if ( bRet )
{ // Gefunden: Umsortieren in der Hash-Liste
pRun->SetNext( pTmp->GetNext() );
pTmp->SetNext( *( ppHash + nIndex ) );
*( ppHash + nIndex ) = pTmp;
pRun = pTmp;
}
}
if( bRet )
{
if ( pRun->GetPrev() )
{ // Wenn wir noch nicht erster sind, werden wir es jetzt:
if ( ( pRun->GetFound() <= nInputValue ) &&
( ++nInputPos > IPR_CACHE_MAXINPUT )
|| ( pInput == pRun ) && NULL == ( pInput = pRun->GetFollow() ) )
{ // Wenn die Input-Stelle am Maximum anlangt, erhoehen
++nInputValue; // wir den InputValue und gehen wieder
nInputPos = 0; // an den Anfang
pInput = pFirst;
}
IPRCachedWord* pTmp = pRun->GetFollow();
pRun->GetPrev()->SetFollow( pTmp ); //Unser Ex-Prev -> Ex-Follow
pRun->SetFollow( pFirst ); // Wir selbst -> Ex-First
pFirst->SetPrev( pRun ); // Wir selbst <- Ex-First
if( pTmp )
pTmp->SetPrev( pRun->GetPrev() ); // Ex-Prev <- Ex-Follow
else
pLast = pRun->GetPrev(); // falls wir letzter waren
pRun->SetPrev( NULL ); // Erste haben keinen Prev
pFirst = pRun; // Wir sind Erster!
}
pRun->IncFound(); // Mitzaehlen, wie oft wiedergefunden
}
}
return bRet;
}
void IPRSpellCache::AddWord( const String& rWord, INT16 nLang )
{
MutexGuard aGuard( GetLinguMutex() );
if( !ppHash )
{
ppHash = new IPRCachedWord* [ nTblSize ];
memset( (void *)ppHash, 0, ( sizeof( IPRCachedWord* ) * nTblSize ) );
}
IPRCachedWord* pTmp;
if( nCount == IPR_CACHE_MAX-1 )
{
ULONG nDel = 0;
pRun = pLast; // Der letzte wird ueberschrieben
const sal_Unicode* pp = pRun->GetWord().GetBuffer();
while( *pp )
nDel = nDel << 1 ^ *pp++;
nDel %= nTblSize; // Hash-Index des letzten
// Der letzte wird aus seiner alten Hash-Liste entfernt
if( ( pTmp = *( ppHash + nDel ) ) == pRun )
*( ppHash + nDel ) = pRun->GetNext();
else
{
while( pTmp->GetNext() != pRun )
pTmp = pTmp->GetNext();
pTmp->SetNext( pRun->GetNext() );
}
pRun->SetWord( rWord ); // Ueberschreiben des alten Inhalts
pRun->SetLang( nLang );
pRun->SetFound( 0 );
}
else
{
++nCount;
pRun = new IPRCachedWord( rWord, pFirst, nLang );
if( pFirst )
pFirst->SetPrev( pRun );
pFirst = pRun; // Ganz Neue kommen erstmal nach vorne
if ( !pLast )
{
pLast = pRun;
pInput = pRun;
}
}
pRun->SetNext( *( ppHash + nIndex ) ); // In der Hash-Liste
*(ppHash + nIndex ) = pRun; // vorne einsortieren
// In der LRU-Kette umsortieren ...
if ( pRun != pInput && pRun != pInput->GetPrev() )
{
pTmp = pRun->GetPrev();
IPRCachedWord* pFoll = pRun->GetFollow();
// Entfernen aus der alten Position
if( pTmp )
pTmp->SetFollow( pFoll );
else
pFirst = pFoll; // wir waren erster
if( pFoll )
pFoll->SetPrev( pTmp );
else
pLast = pTmp; // wir waren letzter
// Einfuegen vor pInput
if( NULL != (pTmp = pInput->GetPrev()) )
pTmp->SetFollow( pRun );
else
pFirst = pRun; // pInput war erster
pRun->SetPrev( pTmp );
pRun->SetFollow( pInput );
pInput->SetPrev( pRun );
}
pInput = pRun; // pInput zeigt auf den zuletzt einsortierten
}
///////////////////////////////////////////////////////////////////////////
} // namespace linguistic
|