diff options
Diffstat (limited to 'linguistic/source/spelldsp.cxx')
-rw-r--r-- | linguistic/source/spelldsp.cxx | 24 |
1 files changed, 4 insertions, 20 deletions
diff --git a/linguistic/source/spelldsp.cxx b/linguistic/source/spelldsp.cxx index 6cc73236a5de..97f96ce227b4 100644 --- a/linguistic/source/spelldsp.cxx +++ b/linguistic/source/spelldsp.cxx @@ -1,3 +1,4 @@ +/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ /************************************************************************* * * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. @@ -50,7 +51,6 @@ 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; @@ -58,7 +58,8 @@ using namespace com::sun::star::uno; using namespace com::sun::star::linguistic2; using namespace linguistic; -/////////////////////////////////////////////////////////////////////////// +using ::rtl::OUString; + // ProposalList: list of proposals for misspelled words // The order of strings in the array should be left unchanged because the // spellchecker should have put the more likely suggestions at the top. @@ -66,7 +67,6 @@ using namespace linguistic; // Removing entries is done by assigning the empty string. // The sequence is constructed from all non empty strings in the original // while maintaining the order. -// class ProposalList { std::vector< OUString > aVec; @@ -80,7 +80,6 @@ class ProposalList public: ProposalList() {} - //size_t Size() const { return aVec.size(); } size_t Count() const; void Prepend( const OUString &rText ); void Append( const OUString &rNew ); @@ -183,9 +182,6 @@ void ProposalList::Remove( const OUString &rText ) } } - -/////////////////////////////////////////////////////////////////////////// - sal_Bool SvcListHasLanguage( const LangSvcEntries_Spell &rEntry, LanguageType nLanguage ) @@ -208,9 +204,6 @@ sal_Bool SvcListHasLanguage( return bHasLanguage; } -/////////////////////////////////////////////////////////////////////////// - - SpellCheckerDispatcher::SpellCheckerDispatcher( LngSvcMgr &rLngSvcMgr ) : rMgr (rLngSvcMgr) { @@ -406,9 +399,6 @@ sal_Bool SpellCheckerDispatcher::isValid_Impl( // build service initialization argument Sequence< Any > aArgs(2); aArgs.getArray()[0] <<= GetPropSet(); - //! The dispatcher searches the dictionary-list - //! thus the service needs not to now about it - //aArgs.getArray()[1] <<= GetDicList(); while (i < nLen && (!bTmpResValid || sal_False == bTmpRes)) { @@ -592,9 +582,6 @@ Reference< XSpellAlternatives > SpellCheckerDispatcher::spell_Impl( // build service initialization argument Sequence< Any > aArgs(2); aArgs.getArray()[0] <<= GetPropSet(); - //! The dispatcher searches the dictionary-list - //! thus the service needs not to now about it - //aArgs.getArray()[1] <<= GetDicList(); sal_Int32 nNumSugestions = -1; while (i < nLen && (!bTmpResValid || xTmpRes.is())) @@ -679,12 +666,10 @@ Reference< XSpellAlternatives > SpellCheckerDispatcher::spell_Impl( // list of proposals found (to be checked against entries of // neagtive dictionaries) ProposalList aProposalList; -// Sequence< OUString > aProposals; sal_Int16 eFailureType = -1; // no failure if (xRes.is()) { aProposalList.Append( xRes->getAlternatives() ); -// aProposals = xRes->getAlternatives(); eFailureType = xRes->getFailureType(); } Reference< XDictionaryList > xDList; @@ -867,5 +852,4 @@ void SpellCheckerDispatcher::FlushSpellCache() pCache->Flush(); } -/////////////////////////////////////////////////////////////////////////// - +/* vim:set shiftwidth=4 softtabstop=4 expandtab: */ |