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
68
69
70
71
72
73
74
|
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2010 Brian Aker
*
* 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
*/
#include "config.h"
#include "plugin/information_schema_dictionary/dictionary.h"
using namespace std;
using namespace drizzled;
ReferentialConstraints::ReferentialConstraints() :
InformationSchema("REFERENTIAL_CONSTRAINTS")
{
add_field("CONSTRAINT_CATALOG");
add_field("CONSTRAINT_SCHEMA");
add_field("CONSTRAINT_NAME");
add_field("UNIQUE_CONSTRAINT_CATALOG");
add_field("UNIQUE_CONSTRAINT_SCHEMA");
add_field("UNIQUE_CONSTRAINT_NAME");
add_field("MATCH_OPTION");
add_field("UPDATE_RULE");
add_field("DELETE_RULE");
}
void ReferentialConstraints::Generator::fill()
{
}
bool ReferentialConstraints::Generator::nextCore()
{
return false;
}
bool ReferentialConstraints::Generator::next()
{
while (not nextCore())
{
return false;
}
return true;
}
ReferentialConstraints::Generator::Generator(drizzled::Field **arg) :
InformationSchema::Generator(arg),
is_primed(false)
{
}
bool ReferentialConstraints::Generator::populate()
{
if (not next())
return false;
fill();
return true;
}
|