blob: df4c2c726c0d3452fb08b6555080c39494978ac2 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <tools/debug.hxx>
#include "bitset.hxx"
#include <string.h>
#include <limits.h>
// creates the asymmetric difference with another bitset
IndexBitSet& IndexBitSet::operator-=(sal_uInt16 nBit)
{
sal_uInt16 nBlock = nBit / 32;
sal_uInt32 nBitVal = 1L << (nBit % 32);
if ( nBlock >= nBlocks )
return *this;
if ( (*(pBitmap+nBlock) & nBitVal) )
{
*(pBitmap+nBlock) &= ~nBitVal;
--nCount;
}
return *this;
}
// unites with a single bit
IndexBitSet& IndexBitSet::operator|=( sal_uInt16 nBit )
{
sal_uInt16 nBlock = nBit / 32;
sal_uInt32 nBitVal = 1L << (nBit % 32);
if ( nBlock >= nBlocks )
{
sal_uInt32 *pNewMap = new sal_uInt32[nBlock+1];
memset( pNewMap + nBlocks, 0, 4 * (nBlock - nBlocks + 1) );
if ( pBitmap )
{
memcpy( pNewMap, pBitmap, 4 * nBlocks );
delete [] pBitmap;
}
pBitmap = pNewMap;
nBlocks = nBlock+1;
}
if ( (*(pBitmap+nBlock) & nBitVal) == 0 )
{
*(pBitmap+nBlock) |= nBitVal;
++nCount;
}
return *this;
}
// determines if the bit is set (may be the only one)
bool IndexBitSet::Contains( sal_uInt16 nBit ) const
{
sal_uInt16 nBlock = nBit / 32;
sal_uInt32 nBitVal = 1L << (nBit % 32);
if ( nBlock >= nBlocks )
return false;
return ( nBitVal & *(pBitmap+nBlock) ) == nBitVal;
}
IndexBitSet::IndexBitSet()
{
nCount = 0;
nBlocks = 0;
pBitmap = nullptr;
}
IndexBitSet::~IndexBitSet()
{
delete [] pBitmap;
}
sal_uInt16 IndexBitSet::GetFreeIndex()
{
for(int i=0;i<USHRT_MAX;i++)
if(!Contains(i))
{
*this|=i;
return i;
}
DBG_ASSERT(false, "IndexBitSet enthaelt mehr als USHRT_MAX Eintraege");
return 0;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
