|
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 |
||
20 |
#ifndef DRIZZLED_KEY_MAP_H
|
|
21 |
#define DRIZZLED_KEY_MAP_H
|
|
22 |
||
23 |
#include <bitset> |
|
24 |
||
25 |
/* Used for finding keys */
|
|
26 |
#if MAX_INDEXES <= 64
|
|
27 |
typedef std::bitset<64> key_map; |
|
28 |
#else
|
|
29 |
typedef std::bitset<((MAX_INDEXES+7)/8*8)> key_map; |
|
30 |
#endif
|
|
31 |
||
32 |
bool is_subset(const key_map& map, const key_map& map2); |
|
33 |
bool is_prefix(const key_map& map, const uint32_t n); |
|
34 |
bool is_overlapping(const key_map& map, const key_map& map2); |
|
35 |
||
36 |
#endif
|