i18nutil/source/utility/oneToOneMapping.cxx

   1 /*************************************************************************
   2  *
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * Copyright 2008 by Sun Microsystems, Inc.
   6  *
   7  * OpenOffice.org - a multi-platform office productivity suite
   8  *
   9  * $RCSfile: oneToOneMapping.cxx,v $
  10  * $Revision: 1.6 $
  11  *
  12  * This file is part of OpenOffice.org.
  13  *
  14  * OpenOffice.org is free software: you can redistribute it and/or modify
  15  * it under the terms of the GNU Lesser General Public License version 3
  16  * only, as published by the Free Software Foundation.
  17  *
  18  * OpenOffice.org is distributed in the hope that it will be useful,
  19  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  20  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  21  * GNU Lesser General Public License version 3 for more details
  22  * (a copy is included in the LICENSE file that accompanied this code).
  23  *
  24  * You should have received a copy of the GNU Lesser General Public License
  25  * version 3 along with OpenOffice.org.  If not, see
  26  * <http://www.openoffice.org/license.html>
  27  * for a copy of the LGPLv3 License.
  28  *
  29  ************************************************************************/
  30
  31 #include <i18nutil/oneToOneMapping.hxx>
  32
  33 namespace com { namespace sun { namespace star { namespace i18n {
  34
  35 oneToOneMapping::oneToOneMapping( OneToOneMappingTable_t *rpTable, const size_t rnBytes, const size_t rnUnitSize )
  36     : mpTable( rpTable ),
  37       mnSize( rnBytes / rnUnitSize )
  38 {
  39 }
  40
  41 oneToOneMapping::~oneToOneMapping()
  42 {
  43 }
  44
  45 sal_Unicode oneToOneMapping::find(const sal_Unicode nKey) const
  46 {
  47     if( mpTable )
  48     {
  49         // binary search
  50         int bottom = 0;
  51         int top = mnSize - 1;
  52         int current;
  53
  54         for (;;) {
  55             current = (top + bottom) / 2;
  56             if( nKey < mpTable[current].first )
  57                 top = current - 1;
  58             else if( nKey > mpTable[current].first )
  59                 bottom = current + 1;
  60             else
  61                 return mpTable[current].second;
  62
  63             if( bottom > top )
  64                 return sal_Unicode( nKey );
  65         }
  66     }
  67     else
  68         return sal_Unicode( nKey );
  69 }
  70
  71 oneToOneMappingWithFlag::oneToOneMappingWithFlag( UnicodePairWithFlag *rpTableWF, const size_t rnSize, const UnicodePairFlag rnFlag )
  72     : oneToOneMapping( NULL, rnSize, sizeof(UnicodePairWithFlag) ),
  73       mpTableWF ( rpTableWF ),
  74       mnFlag    ( rnFlag ),
  75       mbHasIndex( sal_False )
  76 {
  77 }
  78
  79 oneToOneMappingWithFlag::~oneToOneMappingWithFlag()
  80 {
  81     if( mbHasIndex )
  82         for( int i = 0; i < 256; i++ )
  83             if( mpIndex[i] )
  84                 delete [] mpIndex[i];
  85 }
  86
  87
  88 void oneToOneMappingWithFlag::makeIndex()
  89 {
  90     if( !mbHasIndex && mpTableWF )
  91     {
  92         int i, j, high, low, current = -1;
  93
  94         for( i = 0; i < 256; i++ )
  95             mpIndex[i] = NULL;
  96
  97         for( size_t k = 0; k < mnSize; k++ )
  98         {
  99             high = (mpTableWF[k].first >> 8) & 0xFF;
 100             low  = (mpTableWF[k].first)      & 0xFF;
 101             if( high != current )
 102             {
 103                 current = high;
 104                 mpIndex[high] = new UnicodePairWithFlag*[256];
 105
 106                 for( j = 0; j < 256; j++ )
 107                     mpIndex[high][j] = NULL;
 108             }
 109             mpIndex[high][low] = &mpTableWF[k];
 110         }
 111
 112         mbHasIndex = sal_True;
 113     }
 114 }
 115
 116 sal_Unicode oneToOneMappingWithFlag::find( const sal_Unicode nKey ) const
 117 {
 118     if( mpTableWF )
 119     {
 120         if( mbHasIndex )
 121         {
 122             // index search
 123             int high, low;
 124             high = (nKey >> 8) & 0xFF;
 125             low = nKey & 0xFF;
 126             if( mpIndex[high] != NULL &&
 127                 mpIndex[high][low] != NULL &&
 128                 mpIndex[high][low]->flag & mnFlag )
 129                 return mpIndex[high][low]->second;
 130             else
 131                 return sal_Unicode( nKey );
 132         }
 133         else
 134         {
 135             // binary search
 136             int bottom = 0;
 137             int top = mnSize - 1;
 138             int current;
 139
 140             for (;;) {
 141                 current = (top + bottom) / 2;
 142                 if( nKey < mpTableWF[current].first )
 143                     top = current - 1;
 144                 else if( nKey > mpTableWF[current].first )
 145                     bottom = current + 1;
 146                 else
 147                 {
 148                     if( mpTableWF[current].flag & mnFlag )
 149                         return mpTableWF[current].second;
 150                     else
 151                         return sal_Unicode( nKey );
 152                 }
 153
 154                 if( bottom > top )
 155                     return sal_Unicode( nKey );
 156             }
 157         }
 158     }
 159     else
 160         return sal_Unicode( nKey );
 161 }
 162
 163
 164 } } } }