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
|
/* -*- 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 <hintids.hxx>
#include <hints.hxx>
#include <acmplwrd.hxx>
#include <doc.hxx>
#include <pagedesc.hxx>
#include <poolfmt.hxx>
#include <calbck.hxx>
#include <IDocumentStylePoolAccess.hxx>
#include <editeng/svxacorr.hxx>
#include <osl/diagnose.h>
#include <editeng/acorrcfg.hxx>
#include <sfx2/docfile.hxx>
#include <docsh.hxx>
#include <cassert>
#include <vector>
class SwAutoCompleteClient : public SwClient
{
SwAutoCompleteWord* m_pAutoCompleteWord;
SwDoc* m_pDoc;
#if OSL_DEBUG_LEVEL > 0
static sal_uLong s_nSwAutoCompleteClientCount;
#endif
public:
SwAutoCompleteClient(SwAutoCompleteWord& rToTell, SwDoc& rSwDoc);
SwAutoCompleteClient(const SwAutoCompleteClient& rClient);
virtual ~SwAutoCompleteClient() override;
SwAutoCompleteClient& operator=(const SwAutoCompleteClient& rClient);
const SwDoc& GetDoc() const {return *m_pDoc;}
#if OSL_DEBUG_LEVEL > 0
static sal_uLong GetElementCount() {return s_nSwAutoCompleteClientCount;}
#endif
protected:
virtual void Modify( const SfxPoolItem* pOld, const SfxPoolItem *pNew) override;
};
class SwAutoCompleteWord_Impl
{
std::vector<SwAutoCompleteClient>
m_aClientVector;
SwAutoCompleteWord& m_rAutoCompleteWord;
public:
explicit SwAutoCompleteWord_Impl(SwAutoCompleteWord& rParent) :
m_rAutoCompleteWord(rParent){}
void AddDocument(SwDoc& rDoc);
void RemoveDocument(const SwDoc& rDoc);
};
class SwAutoCompleteString
: public editeng::IAutoCompleteString
{
#if OSL_DEBUG_LEVEL > 0
static sal_uLong s_nSwAutoCompleteStringCount;
#endif
std::vector<const SwDoc*> m_aSourceDocs;
public:
SwAutoCompleteString(const OUString& rStr, sal_Int32 nLen);
virtual ~SwAutoCompleteString() override;
void AddDocument(const SwDoc& rDoc);
//returns true if last document reference has been removed
bool RemoveDocument(const SwDoc& rDoc);
#if OSL_DEBUG_LEVEL > 0
static sal_uLong GetElementCount() {return s_nSwAutoCompleteStringCount;}
#endif
};
#if OSL_DEBUG_LEVEL > 0
sal_uLong SwAutoCompleteClient::s_nSwAutoCompleteClientCount = 0;
sal_uLong SwAutoCompleteString::s_nSwAutoCompleteStringCount = 0;
#endif
SwAutoCompleteClient::SwAutoCompleteClient(SwAutoCompleteWord& rToTell, SwDoc& rSwDoc) :
m_pAutoCompleteWord(&rToTell),
m_pDoc(&rSwDoc)
{
m_pDoc->getIDocumentStylePoolAccess().GetPageDescFromPool(RES_POOLPAGE_STANDARD)->Add(this);
#if OSL_DEBUG_LEVEL > 0
++s_nSwAutoCompleteClientCount;
#endif
}
SwAutoCompleteClient::SwAutoCompleteClient(const SwAutoCompleteClient& rClient) :
SwClient(),
m_pAutoCompleteWord(rClient.m_pAutoCompleteWord),
m_pDoc(rClient.m_pDoc)
{
m_pDoc->getIDocumentStylePoolAccess().GetPageDescFromPool(RES_POOLPAGE_STANDARD)->Add(this);
#if OSL_DEBUG_LEVEL > 0
++s_nSwAutoCompleteClientCount;
#endif
}
SwAutoCompleteClient::~SwAutoCompleteClient()
{
#if OSL_DEBUG_LEVEL > 0
--s_nSwAutoCompleteClientCount;
#else
(void) this;
#endif
}
SwAutoCompleteClient& SwAutoCompleteClient::operator=(const SwAutoCompleteClient& rClient)
{
m_pAutoCompleteWord = rClient.m_pAutoCompleteWord;
m_pDoc = rClient.m_pDoc;
StartListeningToSameModifyAs(rClient);
return *this;
}
void SwAutoCompleteClient::Modify( const SfxPoolItem* pOld, const SfxPoolItem *)
{
switch( pOld ? pOld->Which() : 0 )
{
case RES_REMOVE_UNO_OBJECT:
case RES_OBJECTDYING:
if( static_cast<void*>(GetRegisteredIn()) == static_cast<const SwPtrMsgPoolItem *>(pOld)->pObject )
EndListeningAll();
m_pAutoCompleteWord->DocumentDying(*m_pDoc);
break;
}
}
void SwAutoCompleteWord_Impl::AddDocument(SwDoc& rDoc)
{
if (std::any_of(m_aClientVector.begin(), m_aClientVector.end(),
[&rDoc](SwAutoCompleteClient& rClient) { return &rClient.GetDoc() == &rDoc; }))
return;
m_aClientVector.emplace_back(m_rAutoCompleteWord, rDoc);
}
void SwAutoCompleteWord_Impl::RemoveDocument(const SwDoc& rDoc)
{
auto aIt = std::find_if(m_aClientVector.begin(), m_aClientVector.end(),
[&rDoc](SwAutoCompleteClient& rClient) { return &rClient.GetDoc() == &rDoc; });
if (aIt != m_aClientVector.end())
m_aClientVector.erase(aIt);
}
SwAutoCompleteString::SwAutoCompleteString(
const OUString& rStr, sal_Int32 const nLen)
: editeng::IAutoCompleteString(rStr.copy(0, nLen))
{
#if OSL_DEBUG_LEVEL > 0
++s_nSwAutoCompleteStringCount;
#endif
}
SwAutoCompleteString::~SwAutoCompleteString()
{
#if OSL_DEBUG_LEVEL > 0
--s_nSwAutoCompleteStringCount;
#else
(void) this;
#endif
}
void SwAutoCompleteString::AddDocument(const SwDoc& rDoc)
{
auto aIt = std::find(m_aSourceDocs.begin(), m_aSourceDocs.end(), &rDoc);
if (aIt != m_aSourceDocs.end())
return;
m_aSourceDocs.push_back(&rDoc);
}
bool SwAutoCompleteString::RemoveDocument(const SwDoc& rDoc)
{
auto aIt = std::find(m_aSourceDocs.begin(), m_aSourceDocs.end(), &rDoc);
if (aIt != m_aSourceDocs.end())
{
m_aSourceDocs.erase(aIt);
return m_aSourceDocs.empty();
}
return false;
}
SwAutoCompleteWord::SwAutoCompleteWord(
editeng::SortedAutoCompleteStrings::size_type nWords, sal_uInt16 nMWrdLen ):
m_pImpl(new SwAutoCompleteWord_Impl(*this)),
m_nMaxCount( nWords ),
m_nMinWordLen( nMWrdLen ),
m_bLockWordList( false )
{
}
SwAutoCompleteWord::~SwAutoCompleteWord()
{
m_WordList.DeleteAndDestroyAll(); // so the assertion below works
#if OSL_DEBUG_LEVEL > 0
sal_uLong nStrings = SwAutoCompleteString::GetElementCount();
sal_uLong nClients = SwAutoCompleteClient::GetElementCount();
OSL_ENSURE(!nStrings && !nClients, "AutoComplete: clients or string count mismatch");
#endif
}
bool SwAutoCompleteWord::InsertWord( const OUString& rWord, SwDoc& rDoc )
{
SwDocShell* pDocShell = rDoc.GetDocShell();
SfxMedium* pMedium = pDocShell ? pDocShell->GetMedium() : nullptr;
// strings from help module should not be added
if( pMedium )
{
const INetURLObject& rURL = pMedium->GetURLObject();
if ( rURL.GetProtocol() == INetProtocol::VndSunStarHelp )
return false;
}
OUString aNewWord = rWord.replaceAll(OUStringChar(CH_TXTATR_INWORD), "")
.replaceAll(OUStringChar(CH_TXTATR_BREAKWORD), "");
m_pImpl->AddDocument(rDoc);
bool bRet = false;
sal_Int32 nWrdLen = aNewWord.getLength();
while( nWrdLen && '.' == aNewWord[ nWrdLen-1 ])
--nWrdLen;
if( !m_bLockWordList && nWrdLen >= m_nMinWordLen )
{
SwAutoCompleteString* pNew = new SwAutoCompleteString( aNewWord, nWrdLen );
pNew->AddDocument(rDoc);
std::pair<editeng::SortedAutoCompleteStrings::const_iterator, bool>
aInsPair = m_WordList.insert(pNew);
m_LookupTree.insert( aNewWord.copy(0, nWrdLen) );
if (aInsPair.second)
{
bRet = true;
if (m_aLRUList.size() >= m_nMaxCount)
{
// the last one needs to be removed
// so that there is space for the first one
SwAutoCompleteString* pDel = m_aLRUList.back();
m_aLRUList.pop_back();
m_WordList.erase(pDel);
delete pDel;
}
m_aLRUList.push_front(pNew);
}
else
{
delete pNew;
// then move "up"
pNew = static_cast<SwAutoCompleteString*>(*aInsPair.first);
// add the document to the already inserted string
pNew->AddDocument(rDoc);
// move pNew to the front of the LRU list
SwAutoCompleteStringPtrDeque::iterator it = std::find( m_aLRUList.begin(), m_aLRUList.end(), pNew );
OSL_ENSURE( m_aLRUList.end() != it, "String not found" );
if ( m_aLRUList.begin() != it && m_aLRUList.end() != it )
{
m_aLRUList.erase( it );
m_aLRUList.push_front( pNew );
}
}
}
return bRet;
}
void SwAutoCompleteWord::SetMaxCount(
editeng::SortedAutoCompleteStrings::size_type nNewMax )
{
if( nNewMax < m_nMaxCount && m_aLRUList.size() > nNewMax )
{
// remove the trailing ones
SwAutoCompleteStringPtrDeque::size_type nLRUIndex = nNewMax-1;
while (nNewMax < m_WordList.size() && nLRUIndex < m_aLRUList.size())
{
editeng::SortedAutoCompleteStrings::const_iterator it =
m_WordList.find(m_aLRUList[ nLRUIndex++ ]);
OSL_ENSURE( m_WordList.end() != it, "String not found" );
editeng::IAutoCompleteString *const pDel = *it;
m_WordList.erase(it - m_WordList.begin());
delete pDel;
}
m_aLRUList.erase( m_aLRUList.begin() + nNewMax - 1, m_aLRUList.end() );
}
m_nMaxCount = nNewMax;
}
void SwAutoCompleteWord::SetMinWordLen( sal_uInt16 n )
{
// Do you really want to remove all words that are less than the minWrdLen?
if( n < m_nMinWordLen )
{
for (size_t nPos = 0; nPos < m_WordList.size(); ++nPos)
if (m_WordList[ nPos ]->GetAutoCompleteString().getLength() < n)
{
SwAutoCompleteString *const pDel =
dynamic_cast<SwAutoCompleteString*>(m_WordList[nPos]);
m_WordList.erase(nPos);
SwAutoCompleteStringPtrDeque::iterator it = std::find( m_aLRUList.begin(), m_aLRUList.end(), pDel );
OSL_ENSURE( m_aLRUList.end() != it, "String not found" );
m_aLRUList.erase( it );
--nPos;
delete pDel;
}
}
m_nMinWordLen = n;
}
/** Return all words matching a given prefix
*
* @param aMatch the prefix to search for
* @param rWords the words found matching
*/
bool SwAutoCompleteWord::GetWordsMatching(const OUString& aMatch, std::vector<OUString>& rWords) const
{
assert(rWords.empty());
m_LookupTree.findSuggestions(aMatch, rWords);
return !rWords.empty();
}
void SwAutoCompleteWord::CheckChangedList(
const editeng::SortedAutoCompleteStrings& rNewLst)
{
size_t nMyLen = m_WordList.size(), nNewLen = rNewLst.size();
size_t nMyPos = 0, nNewPos = 0;
for( ; nMyPos < nMyLen && nNewPos < nNewLen; ++nMyPos, ++nNewPos )
{
const editeng::IAutoCompleteString * pStr = rNewLst[ nNewPos ];
while (m_WordList[nMyPos] != pStr)
{
SwAutoCompleteString *const pDel =
dynamic_cast<SwAutoCompleteString*>(m_WordList[nMyPos]);
m_WordList.erase(nMyPos);
SwAutoCompleteStringPtrDeque::iterator it = std::find( m_aLRUList.begin(), m_aLRUList.end(), pDel );
OSL_ENSURE( m_aLRUList.end() != it, "String not found" );
m_aLRUList.erase( it );
delete pDel;
if( nMyPos >= --nMyLen )
break;
}
}
// remove the elements at the end of the array
if( nMyPos < nMyLen )
{
// clear LRU array first then delete the string object
for( ; nNewPos < nMyLen; ++nNewPos )
{
SwAutoCompleteString *const pDel =
dynamic_cast<SwAutoCompleteString*>(m_WordList[nNewPos]);
SwAutoCompleteStringPtrDeque::iterator it = std::find( m_aLRUList.begin(), m_aLRUList.end(), pDel );
OSL_ENSURE( m_aLRUList.end() != it, "String not found" );
m_aLRUList.erase( it );
delete pDel;
}
// remove from array
m_WordList.erase(m_WordList.begin() + nMyPos,
m_WordList.begin() + nMyLen);
}
}
void SwAutoCompleteWord::DocumentDying(const SwDoc& rDoc)
{
m_pImpl->RemoveDocument(rDoc);
SvxAutoCorrect* pACorr = SvxAutoCorrCfg::Get().GetAutoCorrect();
const bool bDelete = !pACorr->GetSwFlags().bAutoCmpltKeepList;
for (size_t nPos = m_WordList.size(); nPos; nPos--)
{
SwAutoCompleteString *const pCurrent = dynamic_cast<SwAutoCompleteString*>(m_WordList[nPos - 1]);
if(pCurrent && pCurrent->RemoveDocument(rDoc) && bDelete)
{
m_WordList.erase(nPos - 1);
SwAutoCompleteStringPtrDeque::iterator it = std::find( m_aLRUList.begin(), m_aLRUList.end(), pCurrent );
OSL_ENSURE( m_aLRUList.end() != it, "word not found in LRU list" );
m_aLRUList.erase( it );
delete pCurrent;
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|