280 lines
8.6 KiB
C++
280 lines
8.6 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/*************************************************************************
|
|
*
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
*
|
|
* Copyright 2000, 2010 Oracle and/or its affiliates.
|
|
*
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
|
*
|
|
* This file is part of OpenOffice.org.
|
|
*
|
|
* OpenOffice.org is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Lesser General Public License version 3
|
|
* only, as published by the Free Software Foundation.
|
|
*
|
|
* OpenOffice.org is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU Lesser General Public License version 3 for more details
|
|
* (a copy is included in the LICENSE file that accompanied this code).
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* version 3 along with OpenOffice.org. If not, see
|
|
* <http://www.openoffice.org/license.html>
|
|
* for a copy of the LGPLv3 License.
|
|
*
|
|
************************************************************************/
|
|
|
|
#include <i18npool/lang.h>
|
|
#include <tools/debug.hxx>
|
|
#include <svl/lngmisc.hxx>
|
|
|
|
#include <cppuhelper/factory.hxx> // helper for factories
|
|
#include <com/sun/star/registry/XRegistryKey.hpp>
|
|
#include <com/sun/star/beans/XPropertySet.hpp>
|
|
#include <comphelper/processfactory.hxx>
|
|
#include <osl/mutex.hxx>
|
|
|
|
#include "thesdsp.hxx"
|
|
#include "linguistic/lngprops.hxx"
|
|
|
|
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;
|
|
using namespace linguistic;
|
|
|
|
using ::rtl::OUString;
|
|
|
|
|
|
static sal_Bool SvcListHasLanguage(
|
|
const Sequence< Reference< XThesaurus > > &rRefs,
|
|
const Locale &rLocale )
|
|
{
|
|
sal_Bool bHasLanguage = sal_False;
|
|
|
|
const Reference< XThesaurus > *pRef = rRefs.getConstArray();
|
|
sal_Int32 nLen = rRefs.getLength();
|
|
for (sal_Int32 k = 0; k < nLen && !bHasLanguage; ++k)
|
|
{
|
|
if (pRef[k].is())
|
|
bHasLanguage = pRef[k]->hasLocale( rLocale );
|
|
}
|
|
|
|
return bHasLanguage;
|
|
}
|
|
|
|
|
|
|
|
ThesaurusDispatcher::ThesaurusDispatcher()
|
|
{
|
|
}
|
|
|
|
|
|
ThesaurusDispatcher::~ThesaurusDispatcher()
|
|
{
|
|
ClearSvcList();
|
|
}
|
|
|
|
|
|
void ThesaurusDispatcher::ClearSvcList()
|
|
{
|
|
// release memory for each table entry
|
|
ThesSvcByLangMap_t aTmp;
|
|
aSvcMap.swap( aTmp );
|
|
}
|
|
|
|
|
|
Sequence< Locale > SAL_CALL
|
|
ThesaurusDispatcher::getLocales()
|
|
throw(RuntimeException)
|
|
{
|
|
MutexGuard aGuard( GetLinguMutex() );
|
|
|
|
Sequence< Locale > aLocales( static_cast< sal_Int32 >(aSvcMap.size()) );
|
|
Locale *pLocales = aLocales.getArray();
|
|
ThesSvcByLangMap_t::const_iterator aIt;
|
|
for (aIt = aSvcMap.begin(); aIt != aSvcMap.end(); ++aIt)
|
|
{
|
|
*pLocales++ = CreateLocale( aIt->first );
|
|
}
|
|
return aLocales;
|
|
}
|
|
|
|
|
|
sal_Bool SAL_CALL
|
|
ThesaurusDispatcher::hasLocale( const Locale& rLocale )
|
|
throw(RuntimeException)
|
|
{
|
|
MutexGuard aGuard( GetLinguMutex() );
|
|
ThesSvcByLangMap_t::const_iterator aIt( aSvcMap.find( LocaleToLanguage( rLocale ) ) );
|
|
return aIt != aSvcMap.end();
|
|
}
|
|
|
|
|
|
Sequence< Reference< XMeaning > > SAL_CALL
|
|
ThesaurusDispatcher::queryMeanings(
|
|
const OUString& rTerm, const Locale& rLocale,
|
|
const PropertyValues& rProperties )
|
|
throw(IllegalArgumentException, RuntimeException)
|
|
{
|
|
MutexGuard aGuard( GetLinguMutex() );
|
|
|
|
Sequence< Reference< XMeaning > > aMeanings;
|
|
|
|
sal_Int16 nLanguage = LocaleToLanguage( rLocale );
|
|
if (nLanguage == LANGUAGE_NONE || !rTerm.getLength())
|
|
return aMeanings;
|
|
|
|
// search for entry with that language
|
|
ThesSvcByLangMap_t::iterator aIt( aSvcMap.find( nLanguage ) );
|
|
LangSvcEntries_Thes *pEntry = aIt != aSvcMap.end() ? aIt->second.get() : NULL;
|
|
|
|
if (!pEntry)
|
|
{
|
|
#ifdef LINGU_EXCEPTIONS
|
|
throw IllegalArgumentException();
|
|
#endif
|
|
}
|
|
else
|
|
{
|
|
OUString aChkWord( rTerm );
|
|
aChkWord = aChkWord.replace( SVT_HARD_SPACE, ' ' );
|
|
RemoveHyphens( aChkWord );
|
|
if (IsIgnoreControlChars( rProperties, GetPropSet() ))
|
|
RemoveControlChars( aChkWord );
|
|
|
|
sal_Int32 nLen = pEntry->aSvcRefs.getLength();
|
|
DBG_ASSERT( nLen == pEntry->aSvcImplNames.getLength(),
|
|
"lng : sequence length mismatch");
|
|
DBG_ASSERT( pEntry->nLastTriedSvcIndex < nLen,
|
|
"lng : index out of range");
|
|
|
|
sal_Int32 i = 0;
|
|
|
|
// try already instantiated services first
|
|
{
|
|
const Reference< XThesaurus > *pRef = pEntry->aSvcRefs.getConstArray();
|
|
while (i <= pEntry->nLastTriedSvcIndex
|
|
&& aMeanings.getLength() == 0)
|
|
{
|
|
if (pRef[i].is() && pRef[i]->hasLocale( rLocale ))
|
|
aMeanings = pRef[i]->queryMeanings( aChkWord, rLocale, rProperties );
|
|
++i;
|
|
}
|
|
}
|
|
|
|
// if still no result instantiate new services and try those
|
|
if (aMeanings.getLength() == 0
|
|
&& pEntry->nLastTriedSvcIndex < nLen - 1)
|
|
{
|
|
const OUString *pImplNames = pEntry->aSvcImplNames.getConstArray();
|
|
Reference< XThesaurus > *pRef = pEntry->aSvcRefs.getArray();
|
|
|
|
Reference< XMultiServiceFactory > xMgr(
|
|
comphelper::getProcessServiceFactory() );
|
|
if (xMgr.is())
|
|
{
|
|
// build service initialization argument
|
|
Sequence< Any > aArgs(1);
|
|
aArgs.getArray()[0] <<= GetPropSet();
|
|
|
|
while (i < nLen && aMeanings.getLength() == 0)
|
|
{
|
|
// create specific service via it's implementation name
|
|
Reference< XThesaurus > xThes;
|
|
try
|
|
{
|
|
xThes = Reference< XThesaurus >(
|
|
xMgr->createInstanceWithArguments(
|
|
pImplNames[i], aArgs ), UNO_QUERY );
|
|
}
|
|
catch (uno::Exception &)
|
|
{
|
|
DBG_ASSERT( 0, "createInstanceWithArguments failed" );
|
|
}
|
|
pRef[i] = xThes;
|
|
|
|
if (xThes.is() && xThes->hasLocale( rLocale ))
|
|
aMeanings = xThes->queryMeanings( aChkWord, rLocale, rProperties );
|
|
|
|
pEntry->nLastTriedSvcIndex = (sal_Int16) i;
|
|
++i;
|
|
}
|
|
|
|
// if language is not supported by any of the services
|
|
// remove it from the list.
|
|
if (i == nLen && aMeanings.getLength() == 0)
|
|
{
|
|
if (!SvcListHasLanguage( pEntry->aSvcRefs, rLocale ))
|
|
aSvcMap.erase( nLanguage );
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return aMeanings;
|
|
}
|
|
|
|
|
|
void ThesaurusDispatcher::SetServiceList( const Locale &rLocale,
|
|
const Sequence< OUString > &rSvcImplNames )
|
|
{
|
|
MutexGuard aGuard( GetLinguMutex() );
|
|
|
|
sal_Int16 nLanguage = LocaleToLanguage( rLocale );
|
|
|
|
sal_Int32 nLen = rSvcImplNames.getLength();
|
|
if (0 == nLen)
|
|
// remove entry
|
|
aSvcMap.erase( nLanguage );
|
|
else
|
|
{
|
|
// modify/add entry
|
|
LangSvcEntries_Thes *pEntry = aSvcMap[ nLanguage ].get();
|
|
if (pEntry)
|
|
{
|
|
pEntry->Clear();
|
|
pEntry->aSvcImplNames = rSvcImplNames;
|
|
pEntry->aSvcRefs = Sequence< Reference < XThesaurus > >( nLen );
|
|
}
|
|
else
|
|
{
|
|
boost::shared_ptr< LangSvcEntries_Thes > pTmpEntry( new LangSvcEntries_Thes( rSvcImplNames ) );
|
|
pTmpEntry->aSvcRefs = Sequence< Reference < XThesaurus > >( nLen );
|
|
aSvcMap[ nLanguage ] = pTmpEntry;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
Sequence< OUString >
|
|
ThesaurusDispatcher::GetServiceList( const Locale &rLocale ) const
|
|
{
|
|
MutexGuard aGuard( GetLinguMutex() );
|
|
|
|
Sequence< OUString > aRes;
|
|
|
|
// search for entry with that language and use data from that
|
|
sal_Int16 nLanguage = LocaleToLanguage( rLocale );
|
|
ThesaurusDispatcher *pThis = (ThesaurusDispatcher *) this;
|
|
const ThesSvcByLangMap_t::iterator aIt( pThis->aSvcMap.find( nLanguage ) );
|
|
const LangSvcEntries_Thes *pEntry = aIt != aSvcMap.end() ? aIt->second.get() : NULL;
|
|
if (pEntry)
|
|
aRes = pEntry->aSvcImplNames;
|
|
|
|
return aRes;
|
|
}
|
|
|
|
|
|
LinguDispatcher::DspType ThesaurusDispatcher::GetDspType() const
|
|
{
|
|
return DSP_THES;
|
|
}
|
|
|
|
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|