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
|
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2009 Sun Microsystems
*
* Authors:
*
* Padraig O'Sullivan <osullivan.padraig@gmail.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/**
* @file
*
* Implementation of helper methods for working with
* bitsets and methods for thread-safe bitsets.
*/
#include <drizzled/sql_bitmap.h>
#include <bitset>
using namespace std;
uint32_t setNextBit(bitset<MAX_FIELDS> &bitmap)
{
uint32_t bit_found;
if ((bit_found= getFirstBitPos(bitmap)) != MY_BIT_NONE)
bitmap.set(bit_found);
return bit_found;
}
uint32_t getFirstBitPos(const bitset<MAX_FIELDS> &bitmap)
{
uint32_t first_bit= MY_BIT_NONE;
for (int idx= 0; idx < MAX_FIELDS; idx++)
{
if (!bitmap.test(idx))
{
first_bit= idx;
break;
}
}
return first_bit;
}
bool isBitmapOverlapping(const bitset<MAX_FIELDS> &map1, const bitset<MAX_FIELDS> &map2)
{
bitset<MAX_FIELDS> tmp= map1 & map2;
return (tmp.any());
}
|