24 #include <com/sun/star/i18n/Boundary.hpp>
28 #define CACHE_MAX 32 // max cache structure number
29 #define DEFAULT_SIZE 256 // for boundary size, to avoid alloc and release memory
67 #ifdef DICT_JA_ZH_IN_DATAFILE
68 oslFileHandle m_aFileHandle;
69 sal_uInt64 m_nFileSize;
76 css::i18n::Boundary
nextWord(
const OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
77 css::i18n::Boundary
previousWord(
const OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
78 css::i18n::Boundary
const &
getWordBoundary(
const OUString& rText, sal_Int32 nPos, sal_Int16 wordType,
bool bDirection );
86 bool seekSegment(
const OUString& rText, sal_Int32 pos, css::i18n::Boundary& boundary);
88 bool exists(
const sal_uInt32 u)
const;
const sal_uInt8 * existMark
const sal_Int32 * lenArray
void initDictionaryData(const char *lang)
void setJapaneseWordBreak()
WordBreakCache & getCache(const sal_Unicode *text, css::i18n::Boundary const &boundary)
const sal_Unicode * dataArea
bool exists(const sal_uInt32 u) const
bool seekSegment(const OUString &rText, sal_Int32 pos, css::i18n::Boundary &boundary)
Constant values shared between i18npool and, for example, the number formatter.
css::i18n::Boundary nextWord(const OUString &rText, sal_Int32 nPos, sal_Int16 wordType)
css::i18n::Boundary boundary
css::i18n::Boundary const & getWordBoundary(const OUString &rText, sal_Int32 nPos, sal_Int16 wordType, bool bDirection)
sal_Int32 getLongestMatch(const sal_Unicode *text, sal_Int32 len) const
WordBreakCache cache[CACHE_MAX]
OUString segmentCachedString
css::i18n::Boundary segmentCachedBoundary
xdictionary(const char *lang)
css::i18n::Boundary previousWord(const OUString &rText, sal_Int32 nPos, sal_Int16 wordType)
bool equals(const sal_Unicode *str, css::i18n::Boundary const &boundary) const