sc/source/core/tool/indexmap.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: indexmap.cxx,v $
  10  * $Revision: 1.4 $
  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 // MARKER(update_precomp.py): autogen include statement, do not remove
  32 #include "precompiled_sc.hxx"
  33
  34
  35
  36
  37
  38 #include <memory.h>
  39
  40 #include "indexmap.hxx"
  41
  42
  43 ScIndexMap::ScIndexMap( USHORT nEntries )
  44 {
  45     nCount = nEntries;
  46     ULONG nC = nEntries ? ((ULONG) nEntries * 2) : 2;
  47     pMap = new USHORT [ nC ];
  48     memset( pMap, 0, nC * sizeof(USHORT) );
  49 }
  50
  51
  52 ScIndexMap::~ScIndexMap()
  53 {
  54     delete [] pMap;
  55 }
  56
  57
  58 void ScIndexMap::SetPair( USHORT nEntry, USHORT nIndex1, USHORT nIndex2 )
  59 {
  60     if ( nEntry < nCount )
  61     {
  62         ULONG nOff = (ULONG) nEntry * 2;
  63         pMap[nOff] = nIndex1;
  64         pMap[nOff+1] = nIndex2;
  65     }
  66 }
  67
  68
  69 USHORT ScIndexMap::Find( USHORT nIndex1 ) const
  70 {
  71     USHORT* pStop = pMap + (ULONG) nCount * 2;
  72     for ( USHORT* pOff = pMap; pOff < pStop; pOff += 2 )
  73     {
  74         if ( *pOff == nIndex1 )
  75             return *(pOff+1);
  76     }
  77     return nIndex1;
  78 }
  79
  80