linguistic/source/spelldta.cxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   5  * This Source Code Form is subject to the terms of the Mozilla Public
   6  * License, v. 2.0. If a copy of the MPL was not distributed with this
   7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   8  *
   9  * This file incorporates work covered by the following license notice:
  10  *
  11  *   Licensed to the Apache Software Foundation (ASF) under one or more
  12  *   contributor license agreements. See the NOTICE file distributed
  13  *   with this work for additional information regarding copyright
  14  *   ownership. The ASF licenses this file to you under the Apache
  15  *   License, Version 2.0 (the "License"); you may not use this file
  16  *   except in compliance with the License. You may obtain a copy of
  17  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
  18  */
  19
  20 #include <com/sun/star/uno/Reference.h>
  21 #include <com/sun/star/linguistic2/SpellFailure.hpp>
  22 #include <com/sun/star/linguistic2/XSearchableDictionaryList.hpp>
  23 #include <osl/mutex.hxx>
  24 #include <i18nlangtag/languagetag.hxx>
  25
  26 #include <algorithm>
  27 #include <vector>
  28
  29 #include <linguistic/misc.hxx>
  30 #include <linguistic/spelldta.hxx>
  31
  32
  33 using namespace osl;
  34 using namespace com::sun::star;
  35 using namespace com::sun::star::beans;
  36 using namespace com::sun::star::lang;
  37 using namespace com::sun::star::uno;
  38 using namespace com::sun::star::linguistic2;
  39
  40
  41 namespace linguistic
  42 {
  43
  44 #define MAX_PROPOSALS   40
  45
  46 static bool SeqHasEntry(
  47         const std::vector< OUString > &rSeq,
  48         const OUString &rTxt)
  49 {
  50     bool bRes = false;
  51     sal_Int32 nLen = rSeq.size();
  52     for (sal_Int32 i = 0;  i < nLen && !bRes;  ++i)
  53     {
  54         if (rTxt == rSeq[i])
  55             bRes = true;
  56     }
  57     return bRes;
  58 }
  59
  60
  61 void SearchSimilarText( const OUString &rText, LanguageType nLanguage,
  62         Reference< XSearchableDictionaryList > const &xDicList,
  63         std::vector< OUString > & rDicListProps )
  64 {
  65     if (!xDicList.is())
  66         return;
  67
  68     const uno::Sequence< Reference< XDictionary > >
  69             aDics( xDicList->getDictionaries() );
  70     const Reference< XDictionary >
  71             *pDic = aDics.getConstArray();
  72     sal_Int32 nDics = xDicList->getCount();
  73
  74     for (sal_Int32 i = 0;  i < nDics;  i++)
  75     {
  76         Reference< XDictionary > xDic = pDic[i];
  77
  78         LanguageType nLang = LinguLocaleToLanguage( xDic->getLocale() );
  79
  80         if ( xDic.is() && xDic->isActive()
  81             && (nLang == nLanguage  ||  LinguIsUnspecified( nLang)) )
  82         {
  83 #if OSL_DEBUG_LEVEL > 0
  84             DictionaryType  eType = xDic->getDictionaryType();
  85             (void) eType;
  86             assert( eType != DictionaryType_MIXED && "unexpected dictionary type" );
  87 #endif
  88             const Sequence< Reference< XDictionaryEntry > > aEntries = xDic->getEntries();
  89             for (const Reference<XDictionaryEntry>& rEntry : aEntries)
  90             {
  91                 OUString aEntryTxt;
  92                 if (rEntry.is())
  93                 {
  94                     // remove characters used to determine hyphenation positions
  95                     aEntryTxt = rEntry->getDictionaryWord().replaceAll("=", "");
  96                 }
  97                 if (!aEntryTxt.isEmpty()  &&  aEntryTxt.getLength() > 1  &&  LevDistance( rText, aEntryTxt ) <= 2)
  98                     rDicListProps.push_back( aEntryTxt );
  99             }
 100         }
 101     }
 102 }
 103
 104
 105 void SeqRemoveNegEntries( std::vector< OUString > &rSeq,
 106         Reference< XSearchableDictionaryList > const &rxDicList,
 107         LanguageType nLanguage )
 108 {
 109     bool bSthRemoved = false;
 110     sal_Int32 nLen = rSeq.size();
 111     for (sal_Int32 i = 0;  i < nLen;  ++i)
 112     {
 113         Reference< XDictionaryEntry > xNegEntry( SearchDicList( rxDicList,
 114                     rSeq[i], nLanguage, false, true ) );
 115         if (xNegEntry.is())
 116         {
 117             rSeq[i].clear();
 118             bSthRemoved = true;
 119         }
 120     }
 121     if (bSthRemoved)
 122     {
 123         std::vector< OUString > aNew;
 124         // merge sequence without duplicates and empty strings in new empty sequence
 125         rSeq = MergeProposalSeqs( aNew, rSeq );
 126     }
 127 }
 128
 129
 130 std::vector< OUString > MergeProposalSeqs(
 131             std::vector< OUString > &rAlt1,
 132             std::vector< OUString > &rAlt2 )
 133 {
 134     std::vector< OUString > aMerged;
 135
 136     size_t nAltCount1 = rAlt1.size();
 137     size_t nAltCount2 = rAlt2.size();
 138
 139     sal_Int32 nCountNew = std::min<sal_Int32>( nAltCount1 + nAltCount2, sal_Int32(MAX_PROPOSALS) );
 140     aMerged.resize( nCountNew );
 141
 142     sal_Int32 nIndex = 0;
 143     sal_Int32 i = 0;
 144     for (int j = 0;  j < 2;  j++)
 145     {
 146         sal_Int32        nCount  = j == 0 ? nAltCount1 : nAltCount2;
 147         std::vector< OUString >& rAlt   = j == 0 ? rAlt1 : rAlt2;
 148         for (i = 0;  i < nCount  &&  nIndex < MAX_PROPOSALS;  i++)
 149         {
 150             if (!rAlt[i].isEmpty() &&
 151                 !SeqHasEntry(aMerged, rAlt[i] ))
 152                 aMerged[ nIndex++ ] = rAlt[ i ];
 153         }
 154     }
 155     aMerged.resize( nIndex );
 156
 157     return aMerged;
 158 }
 159
 160
 161 SpellAlternatives::SpellAlternatives()
 162 {
 163     nLanguage   = LANGUAGE_NONE;
 164     nType       = SpellFailure::IS_NEGATIVE_WORD;
 165 }
 166
 167
 168 SpellAlternatives::SpellAlternatives(
 169         const OUString &rWord, LanguageType nLang,
 170         const Sequence< OUString > &rAlternatives ) :
 171     aAlt        (rAlternatives),
 172     aWord       (rWord),
 173     nType       (SpellFailure::IS_NEGATIVE_WORD),
 174     nLanguage   (nLang)
 175 {
 176 }
 177
 178
 179 SpellAlternatives::~SpellAlternatives()
 180 {
 181 }
 182
 183
 184 OUString SAL_CALL SpellAlternatives::getWord()
 185 {
 186     MutexGuard  aGuard( GetLinguMutex() );
 187     return aWord;
 188 }
 189
 190
 191 Locale SAL_CALL SpellAlternatives::getLocale()
 192 {
 193     MutexGuard  aGuard( GetLinguMutex() );
 194     return LanguageTag::convertToLocale( nLanguage );
 195 }
 196
 197
 198 sal_Int16 SAL_CALL SpellAlternatives::getFailureType()
 199 {
 200     MutexGuard  aGuard( GetLinguMutex() );
 201     return nType;
 202 }
 203
 204
 205 sal_Int16 SAL_CALL SpellAlternatives::getAlternativesCount()
 206 {
 207     MutexGuard  aGuard( GetLinguMutex() );
 208     return static_cast<sal_Int16>(aAlt.getLength());
 209 }
 210
 211
 212 Sequence< OUString > SAL_CALL SpellAlternatives::getAlternatives()
 213 {
 214     MutexGuard  aGuard( GetLinguMutex() );
 215     return aAlt;
 216 }
 217
 218
 219 void SAL_CALL SpellAlternatives::setAlternatives( const uno::Sequence< OUString >& rAlternatives )
 220 {
 221     MutexGuard  aGuard( GetLinguMutex() );
 222     aAlt = rAlternatives;
 223 }
 224
 225
 226 void SAL_CALL SpellAlternatives::setFailureType( sal_Int16 nFailureType )
 227 {
 228     MutexGuard  aGuard( GetLinguMutex() );
 229     nType = nFailureType;
 230 }
 231
 232
 233 void SpellAlternatives::SetWordLanguage(const OUString &rWord, LanguageType nLang)
 234 {
 235     MutexGuard  aGuard( GetLinguMutex() );
 236     aWord = rWord;
 237     nLanguage = nLang;
 238 }
 239
 240
 241 void SpellAlternatives::SetFailureType(sal_Int16 nTypeP)
 242 {
 243     MutexGuard  aGuard( GetLinguMutex() );
 244     nType = nTypeP;
 245 }
 246
 247
 248 void SpellAlternatives::SetAlternatives( const Sequence< OUString > &rAlt )
 249 {
 250     MutexGuard  aGuard( GetLinguMutex() );
 251     aAlt = rAlt;
 252 }
 253
 254
 255 css::uno::Reference < css::linguistic2::XSpellAlternatives > SpellAlternatives::CreateSpellAlternatives(
 256         const OUString &rWord, LanguageType nLang, sal_Int16 nTypeP, const css::uno::Sequence< OUString > &rAlt )
 257 {
 258     SpellAlternatives* pAlt = new SpellAlternatives;
 259     pAlt->SetWordLanguage( rWord, nLang );
 260     pAlt->SetFailureType( nTypeP );
 261     pAlt->SetAlternatives( rAlt );
 262     return Reference < XSpellAlternatives >(pAlt);
 263 }
 264
 265
 266 }   // namespace linguistic
 267
 268 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */