sfx2/source/bastyp/bitset.cxx

   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
  20 #include <tools/debug.hxx>
  21 #include <sal/log.hxx>
  22
  23 #include "bitset.hxx"
  24
  25 #include <string.h>
  26 #include <limits.h>
  27
  28 // creates the asymmetric difference with another bitset
  29
  30 IndexBitSet& IndexBitSet::operator-=(sal_uInt16 nBit)
  31 {
  32     sal_uInt16 nBlock = nBit / 32;
  33     sal_uInt32 nBitVal = 1L << (nBit % 32);
  34
  35     if ( nBlock >= nBlocks )
  36       return *this;
  37
  38     if ( (*(pBitmap+nBlock) & nBitVal) )
  39     {
  40         *(pBitmap+nBlock) &= ~nBitVal;
  41         --nCount;
  42     }
  43
  44     return *this;
  45 }
  46
  47 // unites with a single bit
  48
  49 IndexBitSet& IndexBitSet::operator|=( sal_uInt16 nBit )
  50 {
  51     sal_uInt16 nBlock = nBit / 32;
  52     sal_uInt32 nBitVal = 1L << (nBit % 32);
  53
  54     if ( nBlock >= nBlocks )
  55     {
  56         sal_uInt32 *pNewMap = new sal_uInt32[nBlock+1];
  57         memset( pNewMap + nBlocks, 0, 4 * (nBlock - nBlocks + 1) );
  58
  59         if ( pBitmap )
  60         {
  61             memcpy( pNewMap, pBitmap, 4 * nBlocks );
  62             delete [] pBitmap;
  63         }
  64         pBitmap = pNewMap;
  65         nBlocks = nBlock+1;
  66     }
  67
  68     if ( (*(pBitmap+nBlock) & nBitVal) == 0 )
  69     {
  70         *(pBitmap+nBlock) |= nBitVal;
  71         ++nCount;
  72     }
  73
  74     return *this;
  75 }
  76
  77
  78 // determines if the bit is set (may be the only one)
  79
  80 bool IndexBitSet::Contains( sal_uInt16 nBit ) const
  81 {
  82     sal_uInt16 nBlock = nBit / 32;
  83     sal_uInt32 nBitVal = 1L << (nBit % 32);
  84
  85     if ( nBlock >= nBlocks )
  86         return false;
  87     return ( nBitVal & *(pBitmap+nBlock) ) == nBitVal;
  88 }
  89
  90 IndexBitSet::IndexBitSet()
  91 {
  92     nCount = 0;
  93     nBlocks = 0;
  94     pBitmap = nullptr;
  95 }
  96
  97 IndexBitSet::~IndexBitSet()
  98 {
  99     delete [] pBitmap;
 100 }
 101
 102 sal_uInt16 IndexBitSet::GetFreeIndex()
 103 {
 104   for(int i=0;i<USHRT_MAX;i++)
 105     if(!Contains(i))
 106       {
 107         *this|=i;
 108         return i;
 109       }
 110   SAL_WARN( "sfx", "IndexBitSet enthaelt mehr als USHRT_MAX Eintraege");
 111   return 0;
 112 }
 113
 114
 115 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */