i18npool/inc/xdictionary.hxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   5  * This Source Code Form is subject to the terms of the Mozilla Public
   6  * License, v. 2.0. If a copy of the MPL was not distributed with this
   7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   8  *
   9  * This file incorporates work covered by the following license notice:
  10  *
  11  *   Licensed to the Apache Software Foundation (ASF) under one or more
  12  *   contributor license agreements. See the NOTICE file distributed
  13  *   with this work for additional information regarding copyright
  14  *   ownership. The ASF licenses this file to you under the Apache
  15  *   License, Version 2.0 (the "License"); you may not use this file
  16  *   except in compliance with the License. You may obtain a copy of
  17  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
  18  */
  19 #ifndef INCLUDED_I18NPOOL_INC_XDICTIONARY_HXX
  20 #define INCLUDED_I18NPOOL_INC_XDICTIONARY_HXX
  21
  22 #include <sal/types.h>
  23
  24 #include <com/sun/star/i18n/Boundary.hpp>
  25
  26 namespace i18npool {
  27
  28 #define CACHE_MAX 32        // max cache structure number
  29 #define DEFAULT_SIZE 256    // for boundary size, to avoid alloc and release memory
  30
  31 // cache structure.
  32 struct WordBreakCache {
  33     sal_Int32 length;       // contents length saved here.
  34     sal_Unicode *contents;      // separated segment contents.
  35     sal_Int32* wordboundary;        // word boundaries in segments.
  36     sal_Int32 size;         // size of wordboundary
  37
  38     WordBreakCache();
  39     bool equals(const sal_Unicode *str, css::i18n::Boundary const & boundary);    // checking cached string
  40 };
  41
  42 struct xdictionarydata
  43 {
  44     const sal_uInt8  * existMark;
  45     const sal_Int16  * index1;
  46     const sal_Int32  * index2;
  47     const sal_Int32  * lenArray;
  48     const sal_Unicode* dataArea;
  49     xdictionarydata() :
  50         existMark( nullptr ),
  51         index1( nullptr ),
  52         index2( nullptr ),
  53         lenArray( nullptr ),
  54         dataArea( nullptr )
  55     {
  56     }
  57 };
  58
  59 class xdictionary
  60 {
  61 private:
  62     xdictionarydata data;
  63     void initDictionaryData(const sal_Char *lang);
  64
  65     css::i18n::Boundary boundary;
  66     bool japaneseWordBreak;
  67
  68 public:
  69     xdictionary(const sal_Char *lang);
  70     ~xdictionary();
  71     css::i18n::Boundary nextWord( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
  72     css::i18n::Boundary previousWord( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType);
  73     css::i18n::Boundary const & getWordBoundary( const OUString& rText, sal_Int32 nPos, sal_Int16 wordType, bool bDirection );
  74     void setJapaneseWordBreak();
  75
  76 private:
  77     WordBreakCache cache[CACHE_MAX];
  78     OUString segmentCachedString;
  79     css::i18n::Boundary segmentCachedBoundary;
  80
  81     bool        seekSegment(const OUString& rText, sal_Int32 pos, css::i18n::Boundary& boundary);
  82     WordBreakCache& getCache(const sal_Unicode *text, css::i18n::Boundary const & boundary);
  83     bool        exists(const sal_uInt32 u);
  84     sal_Int32   getLongestMatch(const sal_Unicode *text, sal_Int32 len);
  85 };
  86
  87 }
  88
  89 #endif
  90
  91 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */