summaryrefslogtreecommitdiffstats
path: root/i18npool/inc/xdictionary.hxx
diff options
context:
space:
mode:
authorLuboš Luňák <l.lunak@suse.cz>2013-04-07 12:06:47 +0200
committerLuboš Luňák <l.lunak@suse.cz>2013-04-07 14:23:11 +0200
commit1946794ae09ba732022fe6a74ea45e304ab70b84 (patch)
treee32bd7ba61fa021ecc7f8c85959df8ca837d6e81 /i18npool/inc/xdictionary.hxx
parentTypo in comment in resmgr.hxx (diff)
downloadcore-1946794ae09ba732022fe6a74ea45e304ab70b84.tar.gz
core-1946794ae09ba732022fe6a74ea45e304ab70b84.zip
mass removal of rtl:: prefixes for O(U)String*
Modules sal, salhelper, cppu, cppuhelper, codemaker (selectively) and odk have kept them, in order not to break external API (the automatic using declaration is LO-internal). Change-Id: I588fc9e0c45b914f824f91c0376980621d730f09
Diffstat (limited to 'i18npool/inc/xdictionary.hxx')
-rw-r--r--i18npool/inc/xdictionary.hxx8
1 files changed, 4 insertions, 4 deletions
diff --git a/i18npool/inc/xdictionary.hxx b/i18npool/inc/xdictionary.hxx
index 12cc9088a957..847cb097a3f1 100644
--- a/i18npool/inc/xdictionary.hxx
+++ b/i18npool/inc/xdictionary.hxx
@@ -57,15 +57,15 @@ private:
public:
xdictionary(const sal_Char *lang);
~xdictionary();
- Boundary nextWord( const rtl::OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
- Boundary previousWord( const rtl::OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
- Boundary getWordBoundary( const rtl::OUString& rText, sal_Int32 nPos, sal_Int16 wordType, sal_Bool bDirection );
+ Boundary nextWord( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
+ Boundary previousWord( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
+ Boundary getWordBoundary( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType, sal_Bool bDirection );
void setJapaneseWordBreak();
private:
WordBreakCache cache[CACHE_MAX];
- sal_Bool seekSegment(const rtl::OUString& rText, sal_Int32 pos, Boundary& boundary);
+ sal_Bool seekSegment(const OUString& rText, sal_Int32 pos, Boundary& boundary);
WordBreakCache& getCache(const sal_Unicode *text, Boundary& boundary);
sal_Bool exists(const sal_uInt32 u);
sal_Int32 getLongestMatch(const sal_Unicode *text, sal_Int32 len);