/* -*- 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 #include #include #include #include #include #include #include #include #include #include using namespace osl; 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 MAX_PROPOSALS 40 static bool SeqHasEntry( const std::vector< OUString > &rSeq, std::u16string_view rTxt) { bool bRes = false; sal_Int32 nLen = rSeq.size(); for (sal_Int32 i = 0; i < nLen && !bRes; ++i) { if (rTxt == rSeq[i]) bRes = true; } return bRes; } void SearchSimilarText( const OUString &rText, LanguageType nLanguage, Reference< XSearchableDictionaryList > const &xDicList, std::vector< OUString > & rDicListProps ) { if (!xDicList.is()) return; const uno::Sequence< Reference< XDictionary > > aDics( xDicList->getDictionaries() ); const Reference< XDictionary > *pDic = aDics.getConstArray(); sal_Int32 nDics = xDicList->getCount(); for (sal_Int32 i = 0; i < nDics; i++) { Reference< XDictionary > xDic = pDic[i]; LanguageType nLang = LinguLocaleToLanguage( xDic->getLocale() ); if ( xDic.is() && xDic->isActive() && (nLang == nLanguage || LinguIsUnspecified( nLang)) ) { #if OSL_DEBUG_LEVEL > 0 DictionaryType eType = xDic->getDictionaryType(); (void) eType; assert( eType != DictionaryType_MIXED && "unexpected dictionary type" ); #endif const Sequence< Reference< XDictionaryEntry > > aEntries = xDic->getEntries(); for (const Reference& rEntry : aEntries) { OUString aEntryTxt; if (rEntry.is()) { // remove characters used to determine hyphenation positions aEntryTxt = rEntry->getDictionaryWord().replaceAll("=", ""); } if (!aEntryTxt.isEmpty() && aEntryTxt.getLength() > 1 && LevDistance( rText, aEntryTxt ) <= 2) rDicListProps.push_back( aEntryTxt ); } } } } void SeqRemoveNegEntries( std::vector< OUString > &rSeq, Reference< XSearchableDictionaryList > const &rxDicList, LanguageType nLanguage ) { bool bSthRemoved = false; sal_Int32 nLen = rSeq.size(); for (sal_Int32 i = 0; i < nLen; ++i) { Reference< XDictionaryEntry > xNegEntry( SearchDicList( rxDicList, rSeq[i], nLanguage, false, true ) ); if (xNegEntry.is()) { rSeq[i].clear(); bSthRemoved = true; } } if (bSthRemoved) { std::vector< OUString > aNew; // merge sequence without duplicates and empty strings in new empty sequence rSeq = MergeProposalSeqs( aNew, rSeq ); } } std::vector< OUString > MergeProposalSeqs( std::vector< OUString > &rAlt1, std::vector< OUString > &rAlt2 ) { std::vector< OUString > aMerged; size_t nAltCount1 = rAlt1.size(); size_t nAltCount2 = rAlt2.size(); sal_Int32 nCountNew = std::min( nAltCount1 + nAltCount2, sal_Int32(MAX_PROPOSALS) ); aMerged.resize( nCountNew ); sal_Int32 nIndex = 0; sal_Int32 i = 0; for (int j = 0; j < 2; j++) { sal_Int32 nCount = j == 0 ? nAltCount1 : nAltCount2; std::vector< OUString >& rAlt = j == 0 ? rAlt1 : rAlt2; for (i = 0; i < nCount && nIndex < MAX_PROPOSALS; i++) { if (!rAlt[i].isEmpty() && !SeqHasEntry(aMerged, rAlt[i] )) aMerged[ nIndex++ ] = rAlt[ i ]; } } aMerged.resize( nIndex ); return aMerged; } SpellAlternatives::SpellAlternatives() { nLanguage = LANGUAGE_NONE; nType = SpellFailure::IS_NEGATIVE_WORD; } SpellAlternatives::SpellAlternatives( OUString aWord_, LanguageType nLang, const Sequence< OUString > &rAlternatives ) : aAlt (rAlternatives), aWord (std::move(aWord_)), nType (SpellFailure::IS_NEGATIVE_WORD), nLanguage (nLang) { } SpellAlternatives::~SpellAlternatives() { } OUString SAL_CALL SpellAlternatives::getWord() { MutexGuard aGuard( GetLinguMutex() ); return aWord; } Locale SAL_CALL SpellAlternatives::getLocale() { MutexGuard aGuard( GetLinguMutex() ); return LanguageTag::convertToLocale( nLanguage ); } sal_Int16 SAL_CALL SpellAlternatives::getFailureType() { MutexGuard aGuard( GetLinguMutex() ); return nType; } sal_Int16 SAL_CALL SpellAlternatives::getAlternativesCount() { MutexGuard aGuard( GetLinguMutex() ); return static_cast(aAlt.getLength()); } Sequence< OUString > SAL_CALL SpellAlternatives::getAlternatives() { MutexGuard aGuard( GetLinguMutex() ); return aAlt; } void SAL_CALL SpellAlternatives::setAlternatives( const uno::Sequence< OUString >& rAlternatives ) { MutexGuard aGuard( GetLinguMutex() ); aAlt = rAlternatives; } void SAL_CALL SpellAlternatives::setFailureType( sal_Int16 nFailureType ) { MutexGuard aGuard( GetLinguMutex() ); nType = nFailureType; } void SpellAlternatives::SetWordLanguage(const OUString &rWord, LanguageType nLang) { MutexGuard aGuard( GetLinguMutex() ); aWord = rWord; nLanguage = nLang; } void SpellAlternatives::SetFailureType(sal_Int16 nTypeP) { MutexGuard aGuard( GetLinguMutex() ); nType = nTypeP; } void SpellAlternatives::SetAlternatives( const Sequence< OUString > &rAlt ) { MutexGuard aGuard( GetLinguMutex() ); aAlt = rAlt; } css::uno::Reference < css::linguistic2::XSpellAlternatives > SpellAlternatives::CreateSpellAlternatives( const OUString &rWord, LanguageType nLang, sal_Int16 nTypeP, const css::uno::Sequence< OUString > &rAlt ) { rtl::Reference pAlt = new SpellAlternatives; pAlt->SetWordLanguage( rWord, nLang ); pAlt->SetFailureType( nTypeP ); pAlt->SetAlternatives( rAlt ); return pAlt; } } // namespace linguistic /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ tion value='distro/mimo/mimo-6-3'>distro/mimo/mimo-6-3 LibreOffice 核心代码仓库文档基金会
summaryrefslogtreecommitdiff
path: root/oox/source/crypto/AgileEngine.cxx
AgeCommit message (Expand)Author
2020-07-22ofz#24317 hash too shortCaolán McNamara
2020-07-15comphelper: don't hardcode hash sizes in Hash::getLength()Miklos Vajna
2020-07-01Upcoming improved loplugin:staticanonymous -> redundantstatic: ooxStephan Bergmann
2020-05-25[MS-OFFCRYPTO] convert oox implementation into UNO serviceVasily Melenchuk
2020-04-25make FastParser always take a FastTokenHandlerBase subclassNoel Grandin
2020-03-16tdf#42949 Fix IWYU warnings in oox/source/[cd]*/*cxxGabor Kelemen
2020-01-31new loplugin:namespaceindentationNoel Grandin
2020-01-15clang-tidy modernize-concat-nested-namespace in ooxNoel Grandin
2019-08-15loplugin:sequenceloop in forms..ooxNoel Grandin
2019-08-12Fix typosAndrea Gelmini
2018-10-18clang-tidy readability-simplify-boolean-exprNoel Grandin
2018-10-17tdf#42949 Fix IWYU warnings in include/tools/*Gabor Kelemen
2018-09-17New loplugin:externalStephan Bergmann
2018-08-13loplugin:returnconstant in oox,packageNoel Grandin
2018-07-23Fix typosAndrea Gelmini
2018-07-07oox: Handle agile encryption info "reserved" field correctlyTomaž Vajngerl
2018-07-06oox: Agile encryption and data integrity verificationTomaž Vajngerl
2018-07-06oox: move reading of the encryption info into the crypt engineTomaž Vajngerl
2018-02-27Switch AgileEngine::calculateHashFinal() to GetOoxHashAsVector()Eike Rathke
2018-01-15convert a<b?a:b to std::min(a,b)Noel Grandin
2017-11-29ofz: avoid invalid short hashValuesCaolán McNamara
2017-10-23loplugin:includeform: ooxStephan Bergmann
2017-04-29replace oox internal hashing code with new comphelper codeMarkus Mohrhard
2017-01-30oox: clean-up crypto classes, use c++11 featuresTomaž Vajngerl
2016-04-26tdf#42949: clean up includes in include/oox/crypto with iwyuJorenz Paragas
2016-01-12loplugin:unusedmethods unused return value in include/ooxNoel Grandin