1 files changed, 11 insertions, 11 deletions
diff --git a/i18npool/inc/xdictionary.hxx b/i18npool/inc/xdictionary.hxx
index 552117ebe980..ef279ae051b5 100644
--- a/i18npool/inc/xdictionary.hxx
+++ b/i18npool/inc/xdictionary.hxx
@@ -24,7 +24,7 @@
 
 #include <com/sun/star/i18n/Boundary.hpp>
 
-namespace com { namespace sun { namespace star { namespace i18n {
+namespace i18npool {
 
 #define CACHE_MAX 32        // max cache structure number
 #define DEFAULT_SIZE 256    // for boundary size, to avoid alloc and release memory
@@ -37,7 +37,7 @@ struct WordBreakCache {
     sal_Int32 size;         // size of wordboundary
 
     WordBreakCache();
-    bool equals(const sal_Unicode *str, Boundary const & boundary);    // checking cached string
+    bool equals(const sal_Unicode *str, css::i18n::Boundary const & boundary);    // checking cached string
 };
 
 struct xdictionarydata
@@ -63,29 +63,29 @@ private:
     xdictionarydata data;
     void initDictionaryData(const sal_Char *lang);
 
-    Boundary boundary;
+    css::i18n::Boundary boundary;
     bool japaneseWordBreak;
 
 public:
     xdictionary(const sal_Char *lang);
     ~xdictionary();
-    Boundary nextWord( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
-    Boundary previousWord( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
-    Boundary const & getWordBoundary( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType, bool bDirection );
+    css::i18n::Boundary nextWord( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
+    css::i18n::Boundary previousWord( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
+    css::i18n::Boundary const & getWordBoundary( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType, bool bDirection );
     void setJapaneseWordBreak();
 
 private:
     WordBreakCache cache[CACHE_MAX];
     OUString segmentCachedString;
-    Boundary segmentCachedBoundary;
+    css::i18n::Boundary segmentCachedBoundary;
 
-    bool        seekSegment(const OUString& rText, sal_Int32 pos, Boundary& boundary);
-    WordBreakCache& getCache(const sal_Unicode *text, Boundary const & boundary);
+    bool        seekSegment(const OUString& rText, sal_Int32 pos, css::i18n::Boundary& boundary);
+    WordBreakCache& getCache(const sal_Unicode *text, css::i18n::Boundary const & boundary);
     bool        exists(const sal_uInt32 u);
-    sal_Int32       getLongestMatch(const sal_Unicode *text, sal_Int32 len);
+    sal_Int32   getLongestMatch(const sal_Unicode *text, sal_Int32 len);
 };
 
-} } } }
+}
 
 #endif