~drizzle-trunk/drizzle/development

499.1.7 by Monty Taylor
Added key_map and table_map_iterator.
1
/* - mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-
2
 *  vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
3
 *
4
 *  Copyright (C) 2008 Sun Microsystems, Inc.
5
 *
6
 *  This program is free software; you can redistribute it and/or modify
7
 *  it under the terms of the GNU General Public License as published by
8
 *  the Free Software Foundation; version 2 of the License.
9
 *
10
 *  This program is distributed in the hope that it will be useful,
11
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
12
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13
 *  GNU General Public License for more details.
14
 *
15
 *  You should have received a copy of the GNU General Public License
16
 *  along with this program; if not, write to the Free Software
17
 *  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
18
 */
19
612.2.4 by Monty Taylor
Moved some defines to config.h. Stopped including config.h directly anywhere.
20
#include <drizzled/global.h>
499.1.7 by Monty Taylor
Added key_map and table_map_iterator.
21
22
#include <drizzled/key_map.h>
23
24
bool is_subset(const key_map& map, const key_map& map2)
25
{
26
27
  size_t count;
28
  for (count= 0; count < map.size(); count++)
29
  {
30
    if (map[count] & ~map2[count])
31
      return true;
32
  }
33
  return false;
34
35
}
36
37
bool is_prefix(const key_map& map, const uint32_t prefix_size)
38
{
39
  size_t pos= 0;
40
41
  for (; pos < prefix_size; pos++)
42
    if (map[pos] == false)
43
      return false;
44
45
  /*TODO: huh?
46
    uint32_t prefix_bits= prefix_size & 0x7;
47
    if (prefix_bits &&  != (1 << prefix_bits)-1)
48
    return false;
49
  */
50
51
  for (; pos < map.size(); pos++)
52
    if (map[pos] == true)
53
      return false;
54
55
  return true;
56
}
57
58
bool is_overlapping(const key_map& map, const key_map& map2)
59
{
60
  size_t count;
61
  for (count= 0; count < map.size(); count++)
62
  {
63
    if (map[count] & map2[count])
64
      return false;
65
  }
66
  return true;
67
}