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
|
/* - mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2008 Sun Microsystems, Inc.
*
* 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; version 2 of the License.
*
* 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
*/
#include <config.h>
#include <drizzled/key_map.h>
bool is_subset(const key_map& map, const key_map& map2)
{
size_t count;
for (count= 0; count < map.size(); count++)
{
if (map[count] & ~map2[count])
return true;
}
return false;
}
bool is_prefix(const key_map& map, const uint32_t prefix_size)
{
size_t pos= 0;
for (; pos < prefix_size; pos++)
if (map[pos] == false)
return false;
/*TODO: huh?
uint32_t prefix_bits= prefix_size & 0x7;
if (prefix_bits && != (1 << prefix_bits)-1)
return false;
*/
for (; pos < map.size(); pos++)
if (map[pos] == true)
return false;
return true;
}
bool is_overlapping(const key_map& map, const key_map& map2)
{
size_t count;
for (count= 0; count < map.size(); count++)
{
if (map[count] & map2[count])
return false;
}
return true;
}
|