|
1309.2.3
by Brian Aker
Update the code so use a faster index lookup method. |
1 |
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
|
2 |
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
|
|
3 |
*
|
|
4 |
* Copyright (C) 2010 Brian Aker
|
|
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; either version 2 of the License, or
|
|
9 |
* (at your option) any later version.
|
|
10 |
*
|
|
11 |
* This program is distributed in the hope that it will be useful,
|
|
12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
14 |
* GNU General Public License for more details.
|
|
15 |
*
|
|
16 |
* You should have received a copy of the GNU General Public License
|
|
17 |
* along with this program; if not, write to the Free Software
|
|
18 |
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
19 |
*/
|
|
20 |
||
|
2234
by Brian Aker
Mass removal of ifdef/endif in favor of pragma once. |
21 |
#pragma once
|
|
1309.2.3
by Brian Aker
Update the code so use a faster index lookup method. |
22 |
|
|
1874.2.4
by Brian Aker
Have show functions be invisible. |
23 |
class ShowIndexes : public show_dictionary::Show |
|
1309.2.3
by Brian Aker
Update the code so use a faster index lookup method. |
24 |
{
|
25 |
public: |
|
26 |
ShowIndexes(); |
|
27 |
||
|
1874.2.4
by Brian Aker
Have show functions be invisible. |
28 |
class Generator : public show_dictionary::Show::Generator |
|
1309.2.3
by Brian Aker
Update the code so use a faster index lookup method. |
29 |
{
|
30 |
bool is_tables_primed; |
|
31 |
bool is_index_primed; |
|
32 |
bool is_index_part_primed; |
|
33 |
||
34 |
int32_t index_iterator; |
|
35 |
int32_t index_part_iterator; |
|
36 |
||
|
1938.4.2
by Brian Aker
Fix style issue around table for message (though this is imperfect,...) |
37 |
drizzled::message::table::shared_ptr table_proto; |
|
1309.2.3
by Brian Aker
Update the code so use a faster index lookup method. |
38 |
drizzled::message::Table::Index index; |
39 |
drizzled::message::Table::Index::IndexPart index_part; |
|
40 |
||
41 |
std::string table_name; |
|
42 |
||
43 |
const drizzled::message::Table& getTableProto() |
|
44 |
{
|
|
|
1910.2.15
by Brian Aker
Update so that we use shared_ptr from the cache throughout more of the |
45 |
return *table_proto; |
|
1309.2.3
by Brian Aker
Update the code so use a faster index lookup method. |
46 |
}
|
47 |
||
48 |
const drizzled::message::Table::Index& getIndex() |
|
49 |
{
|
|
50 |
return index; |
|
51 |
}
|
|
52 |
||
53 |
const drizzled::message::Table::Index::IndexPart& getIndexPart() |
|
54 |
{
|
|
55 |
return index_part; |
|
56 |
}
|
|
57 |
||
58 |
bool isTablesPrimed() |
|
59 |
{
|
|
60 |
return is_tables_primed; |
|
61 |
}
|
|
62 |
||
63 |
bool isIndexesPrimed() |
|
64 |
{
|
|
65 |
return is_index_primed; |
|
66 |
}
|
|
67 |
||
68 |
bool nextIndex(); |
|
69 |
bool nextIndexCore(); |
|
70 |
bool nextIndexParts(); |
|
71 |
bool nextIndexPartsCore(); |
|
72 |
||
73 |
const std::string &getTableName() |
|
74 |
{
|
|
75 |
return table_name; |
|
76 |
}
|
|
77 |
||
78 |
void fill(); |
|
79 |
||
80 |
public: |
|
81 |
Generator(drizzled::Field **arg); |
|
82 |
bool populate(); |
|
83 |
||
84 |
};
|
|
85 |
||
86 |
Generator *generator(drizzled::Field **arg) |
|
87 |
{
|
|
88 |
return new Generator(arg); |
|
89 |
}
|
|
90 |
};
|
|
91 |