summaryrefslogtreecommitdiff
path: root/linguistic/source/spelldsp.cxx
diff options
context:
space:
mode:
authorXisco Fauli <anistenis@gmail.com>2011-04-04 15:13:25 +0200
committerChristina Rossmanith <ChrRossmanith@web.de>2011-04-04 15:13:25 +0200
commitfe44fe403e57155cb479cd8e9cfbb77e1ba4fb01 (patch)
treed2eb6d6abccf8c091e0014499d58850bb0cfcdaf /linguistic/source/spelldsp.cxx
parent8607aaf27498ebd949023354d776ae0af49ab43a (diff)
Remove commented code in libs-core/linguistic
Diffstat (limited to 'linguistic/source/spelldsp.cxx')
-rw-r--r--linguistic/source/spelldsp.cxx19
1 files changed, 0 insertions, 19 deletions
diff --git a/linguistic/source/spelldsp.cxx b/linguistic/source/spelldsp.cxx
index 3ab2eeb3a0bd..97f96ce227b4 100644
--- a/linguistic/source/spelldsp.cxx
+++ b/linguistic/source/spelldsp.cxx
@@ -60,7 +60,6 @@ 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.
@@ -68,7 +67,6 @@ using ::rtl::OUString;
// 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;
@@ -82,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 );
@@ -185,9 +182,6 @@ void ProposalList::Remove( const OUString &rText )
}
}
-
-///////////////////////////////////////////////////////////////////////////
-
sal_Bool SvcListHasLanguage(
const LangSvcEntries_Spell &rEntry,
LanguageType nLanguage )
@@ -210,9 +204,6 @@ sal_Bool SvcListHasLanguage(
return bHasLanguage;
}
-///////////////////////////////////////////////////////////////////////////
-
-
SpellCheckerDispatcher::SpellCheckerDispatcher( LngSvcMgr &rLngSvcMgr ) :
rMgr (rLngSvcMgr)
{
@@ -408,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))
{
@@ -594,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()))
@@ -681,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;
@@ -869,6 +852,4 @@ void SpellCheckerDispatcher::FlushSpellCache()
pCache->Flush();
}
-///////////////////////////////////////////////////////////////////////////
-
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */