1 files changed, 96 insertions, 0 deletions
diff --git a/i18npool/inc/xdictionary.hxx b/i18npool/inc/xdictionary.hxx
new file mode 100644
index 000000000000..99a52b6ea1b0
--- /dev/null
+++ b/i18npool/inc/xdictionary.hxx
@@ -0,0 +1,96 @@
+/*************************************************************************
+ *
+ * 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.
+ *
+ ************************************************************************/
+#ifndef _XDICTIONARY_H_
+#define _XDICTIONARY_H_
+
+#include <sal/types.h>
+#include <osl/module.h>
+
+#include <com/sun/star/i18n/Boundary.hpp>
+
+namespace com { namespace sun { namespace star { namespace i18n {
+
+// Whether to use cell boundary code, currently unused but prepared.
+#define USE_CELL_BOUNDARY_CODE 0
+
+#define CACHE_MAX 32        // max cache structure number
+#define DEFAULT_SIZE 256    // for boundary size, to avoid alloc and release memory
+
+// cache structure.
+struct WordBreakCache {
+    sal_Int32 length;       // contents length saved here.
+    sal_Unicode *contents;      // seperated segment contents.
+    sal_Int32* wordboundary;        // word boundaries in segments.
+    sal_Int32 size;         // size of wordboundary
+
+    WordBreakCache();
+    sal_Bool equals(const sal_Unicode *str, Boundary& boundary);    // checking cached string
+};
+
+class xdictionary
+{
+private:
+    const sal_uInt8  * existMark;
+    const sal_Int16  * index1;
+    const sal_Int32 * index2;
+    const sal_Int32 * lenArray;
+    const sal_Unicode* dataArea;
+    oslModule hModule;
+    Boundary boundary;
+    sal_Bool japaneseWordBreak;
+
+#if USE_CELL_BOUNDARY_CODE
+    // For CTL breakiterator, where the word boundary should not be inside cell.
+    sal_Bool useCellBoundary;
+    sal_Int32* cellBoundary;
+#endif
+
+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 );
+    void setJapaneseWordBreak();
+
+#if USE_CELL_BOUNDARY_CODE
+    void setCellBoundary(sal_Int32* cellArray);
+#endif
+
+private:
+    WordBreakCache cache[CACHE_MAX];
+
+    sal_Bool        seekSegment(const rtl::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);
+};
+
+} } } }
+
+#endif
+